A - Rikka with Minimum Spanning Trees Gym - 102012A

https://cn.vjudge.net/contest/303774#problem/A 

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <map>
#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfl(i) scanf("%lld",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define pii pair<int,int>
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

/*
//---------------------------------------------------------
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
using namespace __gnu_pbds;
*/

//gp_hash_table<string,int>mp2;
//__gnu_pbds::priority_queue<int>q;//因为放置和std重复，故需要带上命名空间
//__gnu_pbds::priority_queue<int,greater<int>,pairing_heap_tag> pq;//最快
//----------------------------------------------------------


/*
//----------------------------------------------------------
const int BufferSize = 1 << 16;
char buffer[BufferSize], *_head, *_tail;
inline char Getchar() {
    if (_head == _tail) {
        int l = fread(buffer, 1, BufferSize, stdin);
        _tail = (_head = buffer) + l;
    }
    return *_head++;
 }
inline int read() {
    int x = 0, f = 1;char c = Getchar();
    for (;!isdigit(c);c = Getchar()) if (c == '-') f = -1;
    for (;isdigit(c);c = Getchar()) x = x * 10 + c - '0';
    return x * f;
 }
//----------------------------------------------------------
*/


const int maxn=1e6+9;
const int maxm=4e5+9;
const int mod=1e9+7;

struct E
{
    int u,v;
    ull w;
}e[maxn];
int tot=0;

void addedge(int u,int v,ull w)
{
    e[tot].u=u;
    e[tot].v=v;
    e[tot].w=w;
    tot++;
}

bool cmp(E x,E y)
{
    return x.w<y.w;
}

int p[maxn];

int Find(int x)
{
    return x==p[x]?x:p[x]=Find(p[x]);
}

void join(int x,int y)
{
    int jx=Find(x);
    int jy=Find(y);
    if(jx!=jy) p[jx]=jy;
}

bool same(int x,int y)
{
    return Find(x)==Find(y);
}

ull k1,k2;
ull xorSh()
{
    ull k3=k1;
    ull k4=k2;
    k1=k4;
    k3^=k3<<23;
    k2=k3^k4^(k3>>17)^(k4>>26);
    return k2+k4;
}
int n,m,u[100001],v[100001];
ull w[100001];
ull ans=0;
void gen()
{
    scanf("%d%d%llu%llu",&n,&m,&k1,&k2);

    for(int i=0;i<=n;i++) p[i]=i;
    tot=0;
    ans=0;

    for(int i=1;i<=m;i++)
    {
        u[i]=xorSh()%n+1;
        v[i]=xorSh()%n+1;
        w[i]=xorSh();

        addedge(u[i],v[i],w[i]);
        addedge(v[i],u[i],w[i]);
    }
}

ull kru()
{
    sort(e,e+tot,cmp);

    int num=0;
    for(int i=0;i<tot;i++)
    {
        int u=e[i].u;
        int v=e[i].v;
        ull w=e[i].w;
        if(!same(u,v))
        {
            join(u,v);
            ans+=w;
            ans%=mod;
            num++;
        }
        if(num==n-1) break;
    }
    if(num<n-1) return 0;
    return ans;
}

int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    int T;
    sfi(T);
    while(T--)
    {
        gen();

        ull ans=kru();
        cout<<ans<<endl;
    }

    return 0;
}