UVA - 1343 The Rotation Game

来源：互联网发布：模具设计软件编辑：程序博客网时间：2024/05/21 22:57

下面链接是ac代码

点击打开链接

PS：已AC，代码为第二套；

#include<cstdio>#include<iostream>#include<string.h>#include<algorithm>using namespace std;const int maxn = 1000;#define SYMBOL 100int kk[10][10];int kkk[4];int res[maxn];int maxd;int symbol;int ok(){    kkk[kk[3][3]]++;    kkk[kk[3][4]]++;    kkk[kk[3][5]]++;    kkk[kk[4][3]]++;    kkk[kk[4][5]]++;    kkk[kk[5][3]]++;    kkk[kk[5][4]]++;    kkk[kk[5][5]]++;    if(kkk[1]==8) {symbol = 1; return SYMBOL;}    else if(kkk[2] == 8) {symbol = 2; return SYMBOL;}    else if(kkk[3] == 8) {symbol = 3; return SYMBOL;}    sort(kkk + 1, kkk+4);    return kkk[2];}int dfs(int d){    memset(kkk,0,sizeof(kkk));    int k = ok();    if(k == SYMBOL) return true;    if(k + d > maxd) return false;    for(int i = 1; i <= 8; ++i)    {        int tmp;        if(i==1)        {            tmp = kk[1][3];            for(int j = 1; j < 7; ++j) kk[j][3] = kk[j+1][3];            kk[7][3] = tmp;            res[d] = 0;            if(dfs(d+1)) return true;            tmp = kk[7][3];            for(int j = 7; j > 1; --j) kk[j][3] = kk[j-1][3];            kk[1][3] = tmp;        }        else if(i==2)        {            tmp = kk[1][5];            for(int j = 1; j < 7; ++j) kk[j][5] = kk[j+1][5];            kk[7][5] = tmp;            res[d] = 1;            if(dfs(d+1)) return true;            tmp = kk[7][5];            for(int j = 7; j > 1; --j) kk[j][5] = kk[j-1][5];            kk[1][5] = tmp;        }        else if(i==3)        {            tmp = kk[3][7];            for(int j = 7; j > 1; --j) kk[3][j] = kk[3][j-1];            kk[3][1] = tmp;            res[d] = 2;            if(dfs(d+1)) return true;            tmp = kk[3][1];            for(int j = 1; j < 7; ++j) kk[3][j] = kk[3][j+1];            kk[3][7] = tmp;        }        else if(i==4)        {            tmp = kk[5][7];            for(int j = 7; j > 1; --j) kk[5][j] = kk[5][j-1];            kk[5][1] = tmp;            res[d] = 3;            if(dfs(d+1)) return true;            tmp = kk[5][1];            for(int j = 1; j < 7; ++j) kk[5][j] = kk[5][j+1];            kk[5][7] = tmp;        }        else if(i==5)        {            tmp = kk[7][5];            for(int j = 7; j > 1; --j) kk[j][5] = kk[j-1][5];            kk[1][5] = tmp;            res[d] = 4;            if(dfs(d+1)) return true;            tmp = kk[1][5];            for(int j = 1; j < 7; ++j) kk[j][5] = kk[j+1][5];            kk[7][5] = tmp;        }        else if(i==6)        {            tmp = kk[7][3];            for(int j = 7; j > 1; --j) kk[j][3] = kk[j-1][3];            kk[1][3] = tmp;            res[d] = 5;            if(dfs(d+1)) return true;            tmp = kk[1][3];            for(int j = 1; j < 7; ++j) kk[j][3] = kk[j+1][3];            kk[7][3] = tmp;        }        else if(i==7)        {            tmp = kk[5][1];            for(int j = 1; j < 7; ++j) kk[5][j] = kk[5][j+1];            kk[5][7] = tmp;            res[d] = 6;            if(dfs(d+1)) return true;            tmp = kk[5][7];            for(int j = 7; j > 1; --j) kk[5][j] = kk[5][j-1];            kk[5][1] = tmp;        }        else if(i==8)        {            tmp = kk[3][1];            for(int j = 1; j < 7; ++j) kk[3][j] = kk[3][j+1];            kk[3][7] = tmp;            res[d] = 7;            if(dfs(d+1)) return true;            tmp = kk[3][7];            for(int j = 7; j > 1; --j) kk[3][j] = kk[3][j-1];            kk[3][1] = tmp;        }    }    return false;}int main(){    while(scanf("%d", &kk[1][3]), kk[1][3])    {        scanf("%d%d%d", &kk[1][5], &kk[2][3], &kk[2][5]);        for(int i = 1; i <= 7; ++i) scanf("%d", &kk[3][i]);        scanf("%d%d", &kk[4][3], &kk[4][5]);        for(int i = 1; i <= 7; ++i) scanf("%d", &kk[5][i]);        scanf("%d%d%d%d", &kk[6][3], &kk[6][5], &kk[7][3], &kk[7][5]);        for(maxd = 0; ; ++maxd)        {            if(dfs(0))            {                if(maxd == 0) { printf("No moves needed\n");printf("%d\n", symbol);}                else                {                    for(int i = 0; i < maxd; ++i) printf("%c", res[i]+'A');                    printf("\n");                    printf("%d\n", symbol);                }                break;            }        }    }    return 0;}

//我觉得现在这个评估函数并不正确，但它却是AC了，只能说明评估函数--差之毫厘谬以千里。。为了学状态压缩又来学习这个题，先用加深法A了再说吧。。

#include<cstdio>#include<iostream>#include<string.h>#include<algorithm>using namespace std;const int maxn = 1000;#define SYMBOL 100int kk[10][10];int kkk[4];int res[maxn];int maxd;int symbol;bool ok(){    if(kk[3][3] != kk[3][4] || kk[3][3] != kk[3][5] || kk[3][3] != kk[4][3] || kk[3][3] != kk[4][5] || kk[3][3] != kk[5][3] || kk[3][3]       != kk[5][4] || kk[3][3] != kk[5][5]) return false;    return true;}int get_min(){    int tmp[8] = {0};    tmp[0] = kk[3][3];    tmp[1] = kk[3][4];    tmp[2] = kk[3][5];    tmp[3] = kk[4][3];    tmp[4] = kk[4][5];    tmp[5] = kk[5][3];    tmp[6] = kk[5][4];    tmp[7] = kk[5][5];    int a = 0, b = 0, c = 0;    for(int i = 0; i <8;++i)    {        if(tmp[i] == 1) ++a;        else if(tmp[i] == 2) ++b;        else if(tmp[i] == 3) ++c;    }    return 8 - max(a, max(b, c));}int dfs(int d){    int k = ok();    if(k == true) return true;    if(get_min() + d > maxd ) return false;    for(int i = 1; i <= 8; ++i)    {        int tmp;        if(i==1)        {            tmp = kk[1][3];            for(int j = 1; j < 7; ++j) kk[j][3] = kk[j+1][3];            kk[7][3] = tmp;            res[d] = 0;            if(dfs(d+1)) return true;            tmp = kk[7][3];            for(int j = 7; j > 1; --j) kk[j][3] = kk[j-1][3];            kk[1][3] = tmp;        }        else if(i==2)        {            tmp = kk[1][5];            for(int j = 1; j < 7; ++j) kk[j][5] = kk[j+1][5];            kk[7][5] = tmp;            res[d] = 1;            if(dfs(d+1)) return true;            tmp = kk[7][5];            for(int j = 7; j > 1; --j) kk[j][5] = kk[j-1][5];            kk[1][5] = tmp;        }        else if(i==3)        {            tmp = kk[3][7];            for(int j = 7; j > 1; --j) kk[3][j] = kk[3][j-1];            kk[3][1] = tmp;            res[d] = 2;            if(dfs(d+1)) return true;            tmp = kk[3][1];            for(int j = 1; j < 7; ++j) kk[3][j] = kk[3][j+1];            kk[3][7] = tmp;        }        else if(i==4)        {            tmp = kk[5][7];            for(int j = 7; j > 1; --j) kk[5][j] = kk[5][j-1];            kk[5][1] = tmp;            res[d] = 3;            if(dfs(d+1)) return true;            tmp = kk[5][1];            for(int j = 1; j < 7; ++j) kk[5][j] = kk[5][j+1];            kk[5][7] = tmp;        }        else if(i==5)        {            tmp = kk[7][5];            for(int j = 7; j > 1; --j) kk[j][5] = kk[j-1][5];            kk[1][5] = tmp;            res[d] = 4;            if(dfs(d+1)) return true;            tmp = kk[1][5];            for(int j = 1; j < 7; ++j) kk[j][5] = kk[j+1][5];            kk[7][5] = tmp;        }        else if(i==6)        {            tmp = kk[7][3];            for(int j = 7; j > 1; --j) kk[j][3] = kk[j-1][3];            kk[1][3] = tmp;            res[d] = 5;            if(dfs(d+1)) return true;            tmp = kk[1][3];            for(int j = 1; j < 7; ++j) kk[j][3] = kk[j+1][3];            kk[7][3] = tmp;        }        else if(i==7)        {            tmp = kk[5][1];            for(int j = 1; j < 7; ++j) kk[5][j] = kk[5][j+1];            kk[5][7] = tmp;            res[d] = 6;            if(dfs(d+1)) return true;            tmp = kk[5][7];            for(int j = 7; j > 1; --j) kk[5][j] = kk[5][j-1];            kk[5][1] = tmp;        }        else if(i==8)        {            tmp = kk[3][1];            for(int j = 1; j < 7; ++j) kk[3][j] = kk[3][j+1];            kk[3][7] = tmp;            res[d] = 7;            if(dfs(d+1)) return true;            tmp = kk[3][7];            for(int j = 7; j > 1; --j) kk[3][j] = kk[3][j-1];            kk[3][1] = tmp;        }    }    return false;}int main(){    while(scanf("%d", &kk[1][3]), kk[1][3])    {        scanf("%d%d%d", &kk[1][5], &kk[2][3], &kk[2][5]);        for(int i = 1; i <= 7; ++i) scanf("%d", &kk[3][i]);        scanf("%d%d", &kk[4][3], &kk[4][5]);        for(int i = 1; i <= 7; ++i) scanf("%d", &kk[5][i]);        scanf("%d%d%d%d", &kk[6][3], &kk[6][5], &kk[7][3], &kk[7][5]);        for(maxd = 0; ; ++maxd)        {            if(dfs(0))            {                if(maxd == 0) { printf("No moves needed\n");printf("%d\n", kk[3][3]);}                else                {                    for(int i = 0; i < maxd; ++i) printf("%c", res[i]+'A');                    printf("\n");                    printf("%d\n", kk[3][3]);                }                break;            }        }    }    return 0;}

0 0