Codeforces 919F. A Game With Numbers（博弈论）

 

Imagine that Alice is playing a card game with her friend Bob. They both have exactly 88 cards and there is an integer on each card, ranging from 00 to 44. In each round, Alice or Bob in turns choose two cards from different players, let them be aa and bb, where aa is the number on the player's card, and bb is the number on the opponent's card. It is necessary that a⋅b≠0a⋅b≠0. Then they calculate c=(a+b)mod5c=(a+b)mod5 and replace the number aa with cc. The player who ends up with numbers on all 88 cards being 00, wins.

Now Alice wants to know who wins in some situations. She will give you her cards' numbers, Bob's cards' numbers and the person playing the first round. Your task is to determine who wins if both of them choose the best operation in their rounds.

Input

The first line contains one positive integer TT (1≤T≤1000001≤T≤100000), denoting the number of situations you need to consider.

The following lines describe those TT situations. For each situation:

• The first line contains a non-negative integer ff (0≤f≤10≤f≤1), where f=0f=0 means that Alice plays first and f=1f=1 means Bob plays first.
• The second line contains 88 non-negative integers a1,a2,…,a8a1,a2,…,a8 (0≤ai≤40≤ai≤4), describing Alice's cards.
• The third line contains 88 non-negative integers b1,b2,…,b8b1,b2,…,b8 (0≤bi≤40≤bi≤4), describing Bob's cards.

We guarantee that if f=0f=0, we have ∑8i=1ai≠0∑i=18ai≠0. Also when f=1f=1, ∑8i=1bi≠0∑i=18bi≠0 holds.

Output

Output TT lines. For each situation, determine who wins. Output

• "Alice" (without quotes) if Alice wins.
• "Bob" (without quotes) if Bob wins.
• "Deal" (without quotes) if it gets into a deal, i.e. no one wins.

解题思路:

博弈论，假如说做出一个决定，之后做出的可能的决定存在先手必败，那么这个先手一定像那个状态选择，这样后手作为新的新手就一定必败。

而如果后继状态中只要有先手必胜，那么这个人一定尽量不选择这个状态。

将状态抽象成点，将可以转移到的状态之间连上有向边，就出现了一个图。

比如说这道题，可以将可能的状态（495²个）连边，当然我们要反向处理。

确定先手必胜时BFS，否则拓扑排序。

细节要好好处理，二人是不会使用0去更新的（见题目描述）。

代码：

 #include<map>
 #include<queue>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 struct pnt{
     std::pair<int,int>sit;
     int hd;
     int ind;
     int fin;//-1 先手必败
 }p[];
 struct ent{
     int twd;
     int lst;
 }e[];
 std::queue<int>Q;
 std::map<int,int>M1;
 std::map<std::pair<int,int>,int>M2;
 int S[][];
 int H[];
 int tmp[];
 int cnt;
 int n,m;
 int T;
 int trans(int *a);
 int indx(int sd);
 void dfs(int x);
 void zip(void);
 void build(void);
 void Bfs(void);
 void markimp(void);
 void addedge(void);
 void work(void);
 void Pre(void);
 void ade(int f,int t);
 int main()
 {
     Pre();
     scanf("%d",&T);
     while(T--)
         work();
     return ;
 }
 void Pre(void)
 {
     dfs();
     zip();
     build();
     Bfs();
     return ;
 }
 void dfs(int x)
 {
     if(x==)
     {
         m++;
         for(int i=;i<=;i++)
         {
             S[m][i]=tmp[i];
             H[m]=H[m]*+tmp[i];
         }
         M1[H[m]]=m;
         return ;
     }
     for(int i=tmp[x-];i<=;i++)
     {
         tmp[x]=i;
         dfs(x+);
     }
     return ;
 }
 void zip(void)
 {
     for(int i=;i<=m;i++)
     {
         for(int j=;j<=m;j++)
         {
             p[++n].sit=std::make_pair(i,j);
             M2[std::make_pair(i,j)]=n;
         }
     }
     return ;
 }
 void build(void)
 {
     markimp();
     addedge();
     return ;
 }
 void Bfs(void)
 {
     while(!Q.empty())
     {
         int x=Q.front();
         Q.pop();
         for(int i=p[x].hd;i;i=e[i].lst)
         {
             int to=e[i].twd;
             if(p[to].ind==)
                 continue;
             if(p[x].fin==-)
             {
                 p[to].ind=;
                 p[to].fin=;
                 Q.push(to);
             }else{
                 p[to].ind--;
                 if(!p[to].ind&&!p[to].fin)
                 {
                     p[to].fin=-;
                     Q.push(to);
                 }
             }
         }
     }
     return ;
 }
 void markimp(void)
 {
     int sta=M1[];
     for(int i=;i<=n;i++)
     {
         if(p[i].sit.first==sta)
         {
             p[i].fin=;
             Q.push(i);
         }else if(p[i].sit.second==sta)
         {
             p[i].fin=-;
             Q.push(i);
         }
     }
     return ;
 }
 void addedge(void)
 {
     for(int x=;x<=n;x++)
     {
         if(p[x].fin)
             continue;
         for(int i=;i<=;i++)
             tmp[i]=S[p[x].sit.first][i];
         for(int f=;f<=;f++)
         {
             if(f!=&&tmp[f]==tmp[f-])
                 continue;
             if(!tmp[f])
                 continue;
             int a=tmp[f];
             for(int t=;t<=;t++)
             {
                 if(t!=&&S[p[x].sit.second][t]==S[p[x].sit.second][t-])
                     continue;
                 int b=S[p[x].sit.second][t];
                 if(!b)
                     continue;
                 int c=(a+b)%;
                 tmp[f]=c;
                 int t0=M1[trans(tmp)];
                 int y=M2[std::make_pair(p[x].sit.second,t0)];
                 ade(y,x);
                 for(int i=;i<=;i++)
                     tmp[i]=S[p[x].sit.first][i];
             }
         }
     }
 }
 int trans(int *a)
 {
     int ans=;
     std::sort(a+,a+);
     for(int i=;i<=;i++)
         ans=ans*+a[i];
     return ans;
 }
 void ade(int f,int t)
 {
     cnt++;
     e[cnt].twd=t;
     e[cnt].lst=p[f].hd;
     p[f].hd=cnt;
     p[t].ind++;
     return ;
 }
 void work(void)
 {
     int f;
     scanf("%d",&f);
     int t0,t1;
     for(int i=;i<=;i++)
         scanf("%d",&tmp[i]);
     t0=M1[trans(tmp)];
     for(int i=;i<=;i++)
         scanf("%d",&tmp[i]);
     t1=M1[trans(tmp)];
     if(f)
         std::swap(t0,t1);
     if(f)
     {
         int x=M2[std::make_pair(t0,t1)];
         if(p[x].fin==)
         {
             puts("Bob");
         }else if(p[x].fin==)
         {
             puts("Deal");
         }else{
             puts("Alice");
         }
     }else{
         int x=M2[std::make_pair(t0,t1)];
         if(p[x].fin==-)
         {
             puts("Bob");
         }else if(p[x].fin==)
         {
             puts("Deal");
         }else{
             puts("Alice");
         }
     }
 }