BZOJ 3040 最短路(road)

/**************************************************************
    Problem: 3040
    User: SongHL
    Language: C++
    Result: Accepted
    Time:5640 ms
    Memory:136348 kb
****************************************************************/
 
#include<bits/stdc++.h>
using namespace std;
#define clr(a,b) memset(a,b,sizeof a)
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define SUM 1e8
typedef pair<int,int> PII;
typedef long long ll;
typedef unsigned long long ull;
const int INF=0x3f3f3f3f;
const int maxn=1e6+10;
const int maxm=1e7+10;
int N,M;
int T,rxa,rxc,rya,ryc,rp;
int dis[maxn],head[maxn],tot,vis[maxn];
struct Edge{
    int v,w,nxt;
} edge[maxm];
struct Node{
    int id,W;
    bool operator < (const Node &b) const  { return W>b.W; }
};
void Init() { clr(head,-1);clr(vis,0);tot=0;}
void Addedge(int u,int v,int w)
{
    edge[tot].v=v;
    edge[tot].w=w;
    edge[tot].nxt=head[u];
    head[u]=tot++;
}
void Dijkstra()
{
    clr(dis,INF);dis[1]=0;
    priority_queue<Node> pq;
    pq.push(Node{1,0});
    while(!pq.empty())
    {
        Node u=pq.top(); pq.pop();
        if(vis[u.id]) continue;
        vis[u.id]=1;
        for(int i=head[u.id];~i;i=edge[i].nxt)
        {
            int v=edge[i].v;
            if(dis[u.id]+edge[i].w<dis[v])
            {
                dis[v]=dis[u.id]+edge[i].w;
                pq.push(Node{v,dis[v]});
            }
        }
    }
}
int main()
{
    scanf("%d%d",&N,&M);
    Init();
    scanf("%d%d%d%d%d%d",&T,&rxa,&rxc,&rya,&ryc,&rp);
    int x,y,z,a,b;
    a=b=x=y=0;
    for(int i=0;i<T;++i)
    {
        x=(x*rxa+rxc)%rp;
        y=(y*rya+ryc)%rp;
        a=min(x%N+1,y%N+1);
        b=max(y%N+1,y%N+1); 
    } 
    Addedge(a,b,SUM-100*a);
    for(int i=T;i<M;++i)
    {
        scanf("%d%d%d",&x,&y,&z);
        Addedge(x,y,z);
    }
    Dijkstra();
    printf("%d\n",dis[N]);
    return 0;
 }