HDU 4431 Mahjong(模拟题)

题目链接

写了俩小时+把....有一种情况写的时候漏了...代码还算清晰把，想了很久才开写的。

 #include <cstdio>
 #include <cstring>
 #include <algorithm>
 using namespace std;
 int p[],flag[],o[],ans[];
 int sp[];
 int que[];
 char str[][];
 int hu13[] = {,,,,,,,,,,,,};
 void judge13()
 {
     int i;
     int s1,s0,s2,key;
     s1 = s2 = s0 = ;
     for(i = ; i < ; i ++)
     {
         if(flag[hu13[i]] == )
         {
             s0 ++;
             key = hu13[i];
         }
         else if(flag[hu13[i]] == )
             s1 ++;
         else if(flag[hu13[i]] == )
             s2 ++;
     }
     if(s1 == )
     {
         for(i = ; i < ; i ++)
             ans[hu13[i]] = ;
     }
     else if(s1 == &&s2 == &&s0 == )
     {
         ans[key] = ;
     }
     return ;
 }
 void judge7d()
 {
     int i,num = ,key;
     for(i = ; i < ; i ++)
     {
         if(flag[i] == )
             num ++;
         else if(flag[i] == )
             key = i;
     }
     if(num == )
         ans[key] = ;
     return ;
 }
 int dfs(int n,int x,int step)
 {
     int i,j,a,b,c;
     if(x == step)
         return ;
     for(i = ; i < n; i ++)
     {
         if(o[i] == )
         {
             if(sp[i+] == sp[i]&&sp[i+] == sp[i]&&o[i+] == &&o[i+] == )
             {
                 o[i] = ;
                 o[i+] = ;
                 o[i+] = ;
                 if(dfs(n,x+,step))
                     return ;
                 o[i] = ;
                 o[i+] = ;
                 o[i+] = ;
             }
             a = b = c = -;
             a = i;
             for(j = i+; j < n; j ++)
             {
                 if(sp[j] > sp[i] + ) break;
                 if(sp[j] == sp[i] + &&o[j] == )
                     b = j;
                 if(sp[j] == sp[i] + &&o[j] == )
                 {
                     c = j;
                     break;
                 }
             }
             if(b != -&&c != -)
             {
                 o[a] = ;
                 o[b] = ;
                 o[c] = ;
                 if(dfs(n,x+,step))
                     return ;
                 o[a] = ;
                 o[b] = ;
                 o[c] = ;
             }
             break;
         }
     }
     return ;
 }
 int main()
 {
     int t,i,num,j,k,u;
     scanf("%d",&t);
     while(t--)
     {
         memset(flag,,sizeof(flag));
         memset(ans,,sizeof(ans));
         for(i = ; i < ; i ++)
         {
             scanf("%s",str[i]);
             num = str[i][] - '';
             if(str[i][] == 'm')
                 que[i] = num;
             else if(str[i][] == 's')
                 que[i] = num + ;
             else if(str[i][] == 'p')
                 que[i] = num + ;
             else
                 que[i] = num* + ;
             flag[que[i]] ++;
         }
         sort(que,que+);
         judge13();
         judge7d();
         for(i = ; i < ; i ++)
         {
             if(que[i] == que[i+])
             {
                 num = ;
                 for(j = ; j < ; j ++)
                 {
                     if(j == i||j == i+) continue;
                     p[num++] = que[j];
                 }
                 for(j = ; j < ; j ++)
                 {
                     for(k = j+; k < ; k ++)
                     {
                         if(p[j] == p[k])
                         {
                             if(flag[p[j]] == ) continue;//特判
                             num = ;
                             for(u = ; u < ; u ++)
                             {
                                 if(u == j||u == k) continue;
                                 sp[num++] = p[u];
                             }
                             memset(o,,sizeof(o));
                             if(dfs(,,))
                             {
                                 ans[p[j]] = ;
                             }
                         }
                         else if(p[j] +  == p[k])
                         {
                             num = ;
                             for(u = ; u < ; u ++)
                             {
                                 if(u == j||u == k) continue;
                                 sp[num++] = p[u];
                             }
                             memset(o,,sizeof(o));
                             if(dfs(,,))
                             {
                                 if(flag[p[j]-] != )
                                 ans[p[j]-] = ;
                                 if(flag[p[k]+] != )
                                 ans[p[k]+] = ;
                             }
                         }
                         else if(p[j] +  == p[k])
                         {
                             num = ;
                             for(u = ; u < ; u ++)
                             {
                                 if(u == j||u == k) continue;
                                 sp[num++] = p[u];
                             }
                             memset(o,,sizeof(o));
                             if(dfs(,,))
                             {
                                 if(flag[p[j]+] != )
                                 ans[p[j]+] = ;
                             }
                         }
                     }
                 }
             }
             if(flag[que[i]] == ) continue;
             num = ;
             for(j = ; j < ; j ++)
             {
                 if(j == i) continue;
                 sp[num++] = que[j];
             }
             memset(o,,sizeof(o));
             if(dfs(,,))
             {
                 ans[que[i]] = ;
             }
         }
         int fi = ;
         for(i = ; i <= ; i ++)
             if(ans[i])fi ++;
         for(i = ; i <= ; i ++)
             if(ans[i])fi ++;
         for(i = ; i <= ; i ++)
             if(ans[i])fi ++;
         for(i = ; i <= ; i ++)
             if(ans[i]) fi ++;
         if(fi == )
             printf("Nooten\n");
         else
         {
             printf("%d",fi);
             for(i = ; i <= ; i ++)
                 if(ans[i])printf(" %dm",i);
             for(i = ; i <= ; i ++)
                 if(ans[i])printf(" %ds",i-);
             for(i = ; i <= ; i ++)
                 if(ans[i])printf(" %dp",i-);
             for(i = ; i <= ; i ++)
                 if(ans[i])printf(" %dc",(i-)/);
             printf("\n");
         }
     }
     return ;
 }
 /*
 4
 1s 1s 1s 1s 2s 2s 2s 2s 3s 3s 3s 3s 4s
 */