牛客多校第三场 A Graph Games

hash + 分块

首先一个常用的技巧是按照点的度数进行分块，然后对于每个小点我们需要进行 sqrt（m）次的查询。所以我们希望查询的复杂度降低，采用分块的做法。 对于大点，我们 需要进行修改的次数要大于查询的次数，所以我们分块维护快的答案。

从标程里学到一个生成hash值得模板。

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 100005;
const int maxm = 400005;
int id[maxm],ver[maxm],ne[maxm],he[maxn],tot,u[maxm],v[maxm],du[maxn],num[maxn],n,m;
LL F[1000][1000],G[1000][1000],H[maxn],val[maxm];
int bl[maxm],block,tag[1000],st[1000],ed[1000];
vector<int> ve;
void add( int x,int y,int _id ){
    ver[++tot] = y;
    ne[tot] = he[x];
    he[x] = tot;
    id[tot] = _id;
}
void init( int n ){
    for( int i = 0;i <= n;i++ ) he[i] = 0;
    tot = 1;
}
void Force( int l,int r ){
    for( int i = l;i <= r;i++ ){
        val[i]^= 1;
        int x = u[i],y = v[i];
        if( du[x] >= block ){
            F[ bl[i] ][ num[x] ] ^= H[y];
            G[ bl[i] ][ num[x] ] ^= H[y];
        }
        if( du[y] >= block ){
            F[ bl[i] ][ num[y] ] ^= H[x];
            G[ bl[i] ][ num[y] ] ^= H[x];
        }
    }
}
void update( int l,int r ){
    for( int i = bl[l]+1;i <= bl[r]-1;i++ ){
        tag[i]^=1;
    }
    if( bl[l] >= bl[r] ) {
        Force( l,r );
        return;
    }
    Force( l,ed[bl[l]] );
    Force( st[ bl[r] ],r );
}
LL solve( int x ){
    LL res = 0;
    if( du[x] >= block ){
        for( int i = 1;i <= bl[m];i++ ){
            if(tag[i]){
                res ^= G[ i ][ num[x] ];
            }else{
                res ^= F[ i ][ num[x] ];
            }
        }

    }else{
        for( int cure = he[x];cure;cure = ne[cure] ){
            int _id = id[cure];
            int y = ver[cure];
            if( val[_id] ^ tag[ bl[_id] ] ) res ^= H[ y ];
        }

    };
    return res;
}
int Judge_Linux(){
    for (int i=1;i<=10;i++)
        if (rand()>32767) return 1;
    return 0;
}
LL Rand1(){return ((LL)rand()<<30LL)+rand();}
LL Rand2(){return ((LL)rand()<<45LL)+((LL)rand()<<30LL)+((LL)rand()<<15LL)+rand();}
int main(){
    int T;
    int Linux = Judge_Linux();
    scanf("%d",&T);
    while(T--){
        ve.clear();
        int x,y;
        scanf("%d%d",&n,&m);
        block = sqrt( m+1 );
        init(n);
        for( int i = 1;i <= n;i++ ) H[i] = Linux ? Rand1() : Rand2(),du[i] = 0;
        for( int i = 1;i <= m;i++ ){
            scanf("%d%d",&x,&y);add( x,y,i );add( y,x,i );
            u[i] = x;v[i] = y;val[i] =1;du[x]++;du[y]++;
        }
        for( int i = 1;i <= m;i++ ){
            bl[i] = (i-1)/block+1;
            if( bl[i] != bl[i-1] ){
                st[ bl[i] ] = i;
                ed[ bl[i-1] ] = i-1;
            }
        }
        ed[bl[m]] = m;
        for( int i = 1;i <= n;i++ ){
            if( du[i] >= block ) {
                num[i] = ve.size();
                ve.push_back( i );
            }
        }
        for( int i = 0;i <= bl[m];i++ ){
            tag[i] = 0;
            for( int j = 0;j <= ve.size();j++ ){
                F[i][j] = G[i][j] = 0;
            }
        }
        for( int i = 0;i < ve.size();i++ ){
            int x = ve[i];
            for( int cure = he[x];cure;cure = ne[cure] ){
                int y = ver[cure],_id = id[cure];
                F[ bl[_id] ][i] ^= H[y];
            }
        }

        int q,op;scanf("%d",&q);
        for( int i = 1;i <= q;i++ ){
            scanf("%d%d%d",&op,&x,&y);
            if( op == 2 ){
                LL res1 = solve(x);
                LL res2 = solve(y);
                if( res1 == res2 ) putchar('1');
                else putchar('0');
            }else{
                update( x,y );
            }
        }
        puts("");
    }
    return 0;
}