格式化代码

#include<bits/stdc++.h>

using namespace std;

const int mod = 1e9+;

struct node {

    int x,y,z;

};

node d[];

vector<int>v[];

int lg[],A,B,C,P,dep[],no[];

int pr[][],val[],cnt,n,m,q,T,fa[];

inline int rnd(){return A=(A*B+C)%P;}

inline int mmin(int x,int y){return dep[x]<dep[y]?x:y;}

inline int sf(int x){return fa[x]==x?x:fa[x]=sf(fa[x]);}

inline bool cmp(const node x,const node y){return x.z<y.z;}

inline int que(int x,int y){int k=lg[y-x+];return mmin(pr[x][k],pr[y-(<<k)+][k]);}

inline void dfs(int x,int f){

    dep[x]=dep[f]+;

    pr[++T][]=x;

    no[x]=T;

    for(int i=;i<v[x].size();++i){

      dfs(v[x][i],x);

      pr[++T][]=x;

    }

}

inline int ra(){

    int x=;char s=getchar();

    while(!isdigit(s))s=getchar();

    while(isdigit(s))x=(x<<)+(x<<)+(s-''),s=getchar();

    return x;

}

int main(){

    int i,j,k,Ans=;

    n=ra(),m=ra();

    for(i=;i<=m;++i)d[i].x=ra(),d[i].y=ra(),d[i].z=ra();

    sort(d+,d+m+,cmp);

    for(i=;i<=*n;++i)fa[i]=i;

    k=,cnt=n;

    for(i=;i<=m;++i){

      int x=d[i].x,y=d[i].y;

      if(sf(x)!=sf(y)){

          v[++cnt].push_back(sf(x));

          v[cnt].push_back(sf(y));

          fa[sf(x)]=fa[sf(y)]=cnt;

          val[cnt]=d[i].z;

          k++;

      }

      if(k==n-)break;

    }

    dfs(cnt,);

    lg[]=;

    for(i=;i<=T;++i)lg[i]=lg[i>>]+;

    for(i=;i<=;++i)

      for(j=;j+(<<i)<=T;++j)

        pr[j][i]=mmin(pr[j+(<<(i-))][i-],pr[j][i-]);

    q=ra(),A=ra(),B=ra(),C=ra(),P=ra();

    while(q--){

      int x=rnd()%n+,y=rnd()%n+;

      x=no[x],y=no[y];

      if(x>y)swap(x,y);

      Ans=Ans+val[que(x,y)];

      Ans=(Ans>mod?Ans-mod:Ans);

    }

    printf("%d\n",Ans);

    return ;

}