HDU 4753 Fishhead’s Little Game(DFS)

题目链接

很繁琐的爆搜，最多要加2^12条边，暴力就可以，回溯那部分一直没有回溯好，写了一晚上。。。代码非常，非常难看。。对了，还不是普通的爆搜，双向搜索博弈，以前记得看过，这次好像第一次写。。

 #include <iostream>
 #include <cstring>
 #include <cstdio>
 #include <cmath>
 #include <algorithm>
 using namespace std;
 int p[][],flag[],o[][];
 int que[];
 int sp[];
 int sf[];
 int num,sz;
 int t1,t2;
 int dfs1(int x,int tc,int jc);
 int dfs2(int x,int tc,int jc);
 int fun(int a,int b,int c,int nu)
 {
     if(sz == )
     {
         if(sf[nu] == &&sp[a]&&sp[b]&&sp[c])
         {
             sf[nu] = ;
             return ;
         }
         else
             return ;
     }
     else
     {
         if(sf[nu] == &&sp[a]&&sp[b]&&sp[c])
         {
             sf[nu] = ;
             return ;
         }
         else
             return ;
     }
 }
 int judge(int x)
 {
     if(x <= )
         return fun(+x,+x,+x,x);
     else if(x <= )
         return fun(x-,x+,x+,x-) + fun(x+,x+,x+,x);
     else if(x <= )
         return fun(x-,x+,x+,x-) + fun(x+,x+,x+,x);
     else if(x <= )
         return fun(x-,x+,x+,x-);
     else if(x == )
         return fun(,,,);
     else if(x == )
         return fun(,,,);
     else if(x == )
         return fun(,,,);
     else if(x == )
         return fun(,,,);
     else if(x == )
         return fun(,,,);
     else if(x == )
         return fun(,,,);
     else if(x == || x == )
         return fun(x-,x-,x-,x-) + fun(x+,x-,x-,x-);
     else if(x == ||x == )
         return fun(x-,x-,x-,x-) + fun(x+,x-,x-,x-);
     else if(x == ||x == )
         return fun(x-,x-,x-,x-) + fun(x+,x-,x-,x-);
     return ;
 }
 int dfs1(int x,int tc,int jc)
 {
     int i,z,s;
     if(x == (<<num)-)
     {
         if(tc > jc)
             return ;
         else
             return ;
     }
     s = ;
     for(i = ; i < num; i ++)
     {
         if((x&(<<i)) == )
         {
             sz = ;
             z = judge(que[i]);
             sp[que[i]] = ;
             if(dfs2(x+(<<i),tc+z,jc) == )
             s = ;
             sp[que[i]] = ;
             sz = ;
             judge(que[i]);
         }
         if(s) return s;//为了回溯，回溯完了，再返回。
     }
     return s;
 }
 int dfs2(int x,int tc,int jc)
 {
     int i,z,s;
     if(x == (<<num)-)
     {
         if(tc > jc)
             return ;
         else
             return ;
     }
     s = ;
     for(i = ; i < num; i ++)
     {
         if((x&(<<i)) == )
         {
             sz = ;
             sp[que[i]] = ;
             z = judge(que[i]);
             if(dfs1(x+(<<i),tc,jc+z) == )
             s = ;
             sz = ;
             judge(que[i]);
             sp[que[i]] = ;
         }
         if(s) return s;
     }
     return s;
 }
 int main()
 {
     int i,j,k,t,u,v,n,tc,jc,cas = ;
     k = ;
     for(i = ; i <= ; i ++)
     {
         for(j = ; j <= ; j ++)
             p[i][j] = k ++;
     }
     k = ;
     for(i = ; i <= ; i ++)
     {
         for(j = ; j <= ; j ++)
         {
             // printf("%d %d\n",p[i][j],p[i][j+1]);
             o[p[i][j]][p[i][j+]] = k ++;
         }
     }
     for(i = ; i <= ; i ++)
     {
         for(j = ; j <= ; j ++)
         {
             //printf("%d %d\n",p[i][j],p[i+1][j]);
             o[p[i][j]][p[i+][j]] = k ++;
         }
     }
     scanf("%d",&t);
     while(t--)
     {
         memset(flag,,sizeof(flag));
         memset(sp,,sizeof(sp));
         memset(sf,,sizeof(sf));
         scanf("%d",&n);
         num = ;
         tc = jc = ;
         sz = ;
         for(i = ; i < n; i ++)
         {
             scanf("%d%d",&u,&v);
             int te;
             if(u > v)
             {
                 te = u;
                 u = v;
                 v = te;
             }
             if(i% == )
                 tc += judge(o[u][v]);
             else
                 jc += judge(o[u][v]);
             flag[o[u][v]] = ;
             sp[o[u][v]] = ;
         }
         for(i = ; i < ; i ++)
         {
             if(!flag[i])
                 que[num++] = i;
         }
         printf("Case #%d: ",cas ++);
         if(n% == )
         {
             if(dfs1(,tc,jc))
                 printf("Tom200\n");
             else
                 printf("Jerry404\n");
         }
         else
         {
             if(dfs1(,jc,tc))
                 printf("Jerry404\n");
             else
                 printf("Tom200\n");
         }
     }
     return ;
 }