二分图博弈[2020CCPC长春H - Combination Lock ]

概念
结论：如果起始点在最大流里，那么先手必胜
否则先手必败。

2020CCPC长春H
这道题卡常

#include<iostream>
#include <cstring>
#include <cmath>
#include <map>
#include <vector>
#include <algorithm>
#include <set>
#define int ll
using namespace std;
typedef long long ll;
const int M = 2e6 + 5;
const int N = 2e5 + 5;
const int INF = 0x3f3f3f3f;
int tot,len;
int fac[]={1,10,100,1000,10000,100000,1000000}; 
int vis[N];
struct node
{
    int v,w,to;
} edge[M*2];
int pre[N],cnt,dep[N];
int S,T,z,head[N],sum,id;
int n,m,q[N],cur[N];
void add(int u,int v,int w)
{
    edge[cnt]= {v,w,head[u]};
    head[u]=cnt++;
    edge[cnt]= {u,0,head[v]};
    head[v]=cnt++;
}
bool bfs()
{
    for(int i=0; i<=T; i++)
        dep[i]=0;
    dep[S]=1;
    int l=0,r=1;
    q[r]=S;
    while(l<r)
    {
        int u=q[++l];
        for(int i=head[u]; i!=-1; i=edge[i].to)
        {
            int v=edge[i].v;
            if(!dep[v]&&edge[i].w)
                dep[v]=dep[u]+1,q[++r]=v;
        }
    }
    return dep[T];
}
int dfs(int u,int mi)
{
    int res=0;
    if(mi==0||u==T)
        return mi;
    for(int &i=cur[u]; i!=-1; i=edge[i].to)
    {
        int v=edge[i].v;
        if(dep[u]+1==dep[v]&&edge[i].w)
        {
            int minn=dfs(v,min(mi-res,edge[i].w));
            edge[i].w-=minn;
            edge[i^1].w+=minn;
            res+=minn;
            if(res==mi)
                return res;
        }
    }
    if(res==0) dep[u]=0;
    return res;
}
int dinic()
{
    ll res=0;
    while(bfs())
    {
        memcpy(cur,head,sizeof(head));
//        cout<<res<<endl;
        res+=dfs(S,INF);
    }
    return res;
}
int stF;
int getnum(int i){
	int ans=0;
	//cout<<i<<" ";
	while(i){
		ans += i%10;
		i/= 10;
	}
	//cout<<ans<<endl;
	return ans;
}

void cal(int n){
	int index = 10, res,org = n;
	for(int i = 0; i<len;i++){
		res = n/fac[i];
//		n/=10;
		res%=10;
		int ub = (res+1)%10;
		int lb = (res-1+10)%10;
//		cout<<"len: "<<len<<endl;
//		cout<<org<<": "<<org-res*pow(10,i)+ub*pow(10,i)<<" "<<org-res*pow(10,i)+lb*pow(10,i)<<endl;
		if(!vis[(org-res*fac[i]+ub*fac[i])])
			add(org,org-res*fac[i]+ub*fac[i],INF);
		if(!vis[(org-res*fac[i]+lb*fac[i])])
			add(org,org-res*fac[i]+lb*fac[i],INF);
	}
}
signed main(){
	ios::sync_with_stdio(0);
	int t,st,mxflow;
	cin >> t;
	while(t--){
		memset(vis,0,sizeof vis);
		cin >> len >> n >> st;
		S = fac[len],T = S+1;
//		cout<<S<<" "<<T<<endl;
		cnt = 0;
		for(int i = 0; i<=T; i++) head[i] = -1;
		stF = getnum(st);
		stF &= 1;
		int tmp;
//		_set.insert(st);
		for(int i =0; i < n;i++){
			cin >> tmp;
			vis[tmp]=1;
		}
		for(int i = 0; i<S;i++){
			if(vis[i]) continue;
			if( (getnum(i)&1) == stF){
				cal(i);
				if(i != st) add(S,i,1);
			}else{
				add(i,T,1);	
			}
		}
		

		mxflow = dinic();

		add(S,st,1);

		mxflow=dinic();
		if(mxflow == 0) cout<<"Bob\n";
		else cout<<"Alice\n"; 
	} 
}