HDU 4431 Mahjong(模拟题)

题目链接

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

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
int p[21],flag[60],o[21],ans[60];
int sp[21];
int que[21];
char str[15][3];
int hu13[13] = {1,11,21,9,19,29,33,36,39,42,45,48,51};
void judge13()
{
    int i;
    int s1,s0,s2,key;
    s1 = s2 = s0 = 0;
    for(i = 0; i < 13; i ++)
    {
        if(flag[hu13[i]] == 0)
        {
            s0 ++;
            key = hu13[i];
        }
        else if(flag[hu13[i]] == 1)
            s1 ++;
        else if(flag[hu13[i]] == 2)
            s2 ++;
    }
    if(s1 == 13)
    {
        for(i = 0; i < 13; i ++)
            ans[hu13[i]] = 1;
    }
    else if(s1 == 11&&s2 == 1&&s0 == 1)
    {
        ans[key] = 1;
    }
    return ;
}
void judge7d()
{
    int i,num = 0,key;
    for(i = 1; i < 60; i ++)
    {
        if(flag[i] == 2)
            num ++;
        else if(flag[i] == 1)
            key = i;
    }
    if(num == 6)
        ans[key] = 1;
    return ;
}
int dfs(int n,int x,int step)
{
    int i,j,a,b,c;
    if(x == step)
        return 1;
    for(i = 0; i < n; i ++)
    {
        if(o[i] == 0)
        {
            if(sp[i+1] == sp[i]&&sp[i+2] == sp[i]&&o[i+1] == 0&&o[i+2] == 0)
            {
                o[i] = 1;
                o[i+1] = 1;
                o[i+2] = 1;
                if(dfs(n,x+1,step))
                    return 1;
                o[i] = 0;
                o[i+1] = 0;
                o[i+2] = 0;
            }
            a = b = c = -1;
            a = i;
            for(j = i+1; j < n; j ++)
            {
                if(sp[j] > sp[i] + 2) break;
                if(sp[j] == sp[i] + 1&&o[j] == 0)
                    b = j;
                if(sp[j] == sp[i] + 2&&o[j] == 0)
                {
                    c = j;
                    break;
                }
            }
            if(b != -1&&c != -1)
            {
                o[a] = 1;
                o[b] = 1;
                o[c] = 1;
                if(dfs(n,x+1,step))
                    return 1;
                o[a] = 0;
                o[b] = 0;
                o[c] = 0;
            }
            break;
        }
    }
    return 0;
}
int main()
{
    int t,i,num,j,k,u;
    scanf("%d",&t);
    while(t--)
    {
        memset(flag,0,sizeof(flag));
        memset(ans,0,sizeof(ans));
        for(i = 0; i < 13; i ++)
        {
            scanf("%s",str[i]);
            num = str[i][0] - '0';
            if(str[i][1] == 'm')
                que[i] = num;
            else if(str[i][1] == 's')
                que[i] = num + 10;
            else if(str[i][1] == 'p')
                que[i] = num + 20;
            else
                que[i] = num*3 + 30;
            flag[que[i]] ++;
        }
        sort(que,que+13);
        judge13();
        judge7d();
        for(i = 0; i < 13; i ++)
        {
            if(que[i] == que[i+1])
            {
                num = 0;
                for(j = 0; j < 13; j ++)
                {
                    if(j == i||j == i+1) continue;
                    p[num++] = que[j];
                }
                for(j = 0; j < 11; j ++)
                {
                    for(k = j+1; k < 11; k ++)
                    {
                        if(p[j] == p[k])
                        {
                            if(flag[p[j]] == 4) continue;//特判
                            num = 0;
                            for(u = 0; u < 11; u ++)
                            {
                                if(u == j||u == k) continue;
                                sp[num++] = p[u];
                            }
                            memset(o,0,sizeof(o));
                            if(dfs(9,0,3))
                            {
                                ans[p[j]] = 1;
                            }
                        }
                        else if(p[j] + 1 == p[k])
                        {
                            num = 0;
                            for(u = 0; u < 11; u ++)
                            {
                                if(u == j||u == k) continue;
                                sp[num++] = p[u];
                            }
                            memset(o,0,sizeof(o));
                            if(dfs(9,0,3))
                            {
                                if(flag[p[j]-1] != 4)
                                ans[p[j]-1] = 1;
                                if(flag[p[k]+1] != 4)
                                ans[p[k]+1] = 1;
                            }
                        }
                        else if(p[j] + 2 == p[k])
                        {
                            num = 0;
                            for(u = 0; u < 11; u ++)
                            {
                                if(u == j||u == k) continue;
                                sp[num++] = p[u];
                            }
                            memset(o,0,sizeof(o));
                            if(dfs(9,0,3))
                            {
                                if(flag[p[j]+1] != 4)
                                ans[p[j]+1] = 1;
                            }
                        }
                    }
                }
            }
            if(flag[que[i]] == 4) continue;
            num = 0;
            for(j = 0; j < 13; j ++)
            {
                if(j == i) continue;
                sp[num++] = que[j];
            }
            memset(o,0,sizeof(o));
            if(dfs(12,0,4))
            {
                ans[que[i]] = 1;
            }
        }
        int fi = 0;
        for(i = 1; i <= 9; i ++)
            if(ans[i])fi ++;
        for(i = 11; i <= 19; i ++)
            if(ans[i])fi ++;
        for(i = 21; i <= 29; i ++)
            if(ans[i])fi ++;
        for(i = 33; i <= 51; i ++)
            if(ans[i]) fi ++;
        if(fi == 0)
            printf("Nooten
");
        else
        {
            printf("%d",fi);
            for(i = 1; i <= 9; i ++)
                if(ans[i])printf(" %dm",i);
            for(i = 11; i <= 19; i ++)
                if(ans[i])printf(" %ds",i-10);
            for(i = 21; i <= 29; i ++)
                if(ans[i])printf(" %dp",i-20);
            for(i = 33; i <= 51; i ++)
                if(ans[i])printf(" %dc",(i-30)/3);
            printf("
");
        }
    }
    return 0;
}
/*
4
1s 1s 1s 1s 2s 2s 2s 2s 3s 3s 3s 3s 4s
*/