BZOJ4730 UOJ#266【清华集训2016】Alice和Bob又在玩游戏

同BZOJ4134-_-

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<bitset>
#include<queue>
#include<stack>
using namespace std;
#define MAXN 200010
#define MAXM 4000010
#define INF 1000000000
#define MOD 1000000007
#define eps 1e-8
#define ll long long
struct vec{
    int to;
    int fro;
};
vec mp[MAXN*2];
int tai[MAXN],cnt;
int n,m;
int ans;
int sg[MAXN],rem[MAXN];
int N,D;
int son[MAXM][2];
int siz[MAXM],rev[MAXM];
int rt[MAXN];
int tot;
inline void be(int x,int y){
    mp[++cnt].to=y;
    mp[cnt].fro=tai[x];
    tai[x]=cnt;
}
inline void bde(int x,int y){
    be(x,y);
    be(y,x);
}
inline void torev(int x,int y,int d){
    rev[x]^=y;
    if(rev[x]&(1<<d)){
        swap(son[x][0],son[x][1]);
    }
}
inline void ud(int x){
    siz[x]=siz[son[x][0]]+siz[son[x][1]];
}
inline void pd(int x,int d){
    if(rev[x]){
        torev(son[x][0],rev[x],d-1);
        torev(son[x][1],rev[x],d-1);
        rev[x]=0;
    }
}
void ins(int &x,int y,int z,int p,int d){
    if(!x){
        x=++tot;
        son[x][0]=son[x][1]=siz[x]=rev[x]=0;
    }
    if(y==z){
        siz[x]=1;
        return ;
    }
    pd(x,d);
    int mid=y+z>>1;
    if(p<=mid){
        ins(son[x][0],y,mid,p,d-1);
    }else{
        ins(son[x][1],mid+1,z,p,d-1);
    }
}
int merge(int x,int y,int l,int r,int d){
    if(!x||!y){
        return x+y;
    }
    if(l==r){
        siz[x]|=siz[y];
        return x;
    }
    int mid=l+r>>1;
    pd(x,d);
    pd(y,d);
    son[x][0]=merge(son[x][0],son[y][0],l,mid,d-1);
    son[x][1]=merge(son[x][1],son[y][1],mid+1,r,d-1);
    ud(x);
    return x;
}
int ask(int x,int y,int z,int d){
    if(y==z){
        return y;
    }
    pd(x,d);
    int mid=y+z>>1;
    if(siz[son[x][0]]==mid-y+1){
        return ask(son[x][1],mid+1,z,d-1);
    }else{
        return ask(son[x][0],y,mid,d-1);
    }
}
void dfs(int x,int f){
    int i,y;
    rem[x]=0;
    for(i=tai[x];i;i=mp[i].fro){
        y=mp[i].to;
        if(y!=f){
            dfs(y,x);
            rem[x]^=sg[y];
        }
    }
    ins(rt[x],0,N,rem[x],D);
    for(i=tai[x];i;i=mp[i].fro){
        y=mp[i].to;
        if(y!=f){
            torev(rt[y],rem[x]^sg[y],D);
            merge(rt[x],rt[y],0,N,D);
        }
    }
    sg[x]=ask(rt[x],0,N,D);
}
int main(){
    int i,x,y;
    int tmp;
    scanf("%d",&tmp);
    while(tmp--){
        memset(rt,0,sizeof(rt));
        memset(tai,0,sizeof(tai));
        tot=cnt=0;
        scanf("%d%d",&n,&m);
        for(i=1;i<=m;i++){
            scanf("%d%d",&x,&y);
            bde(x,y);
        }
        ans=0;
        for(N=1,D=0;N<=n;N<<=1,D++){
             
        }
        N--;
        D--;
        for(i=1;i<=n;i++){
            if(!rt[i]){
                dfs(i,0);
                ans^=sg[i];
            }
        }
        printf(ans?"Alice\n":"Bob\n");
    }
    return 0;
}
 
/*
 
*/