bnu 4289 Theta Puzzle[bfs, 打表]

题目链接：http://www.bnuoj.com/v3/problem_show.php?pid=4289

题意很是简单，状态也很简单。 直接bfs会TLE。

为什么？我们可以看到 case <= 1000，也就说我们的组数最多有1000组。毫无疑问，出题人肯定出够了1000组数据。就是为了卡直接bfs的。

但是，后来我们可以发现。题目的可能组数要小于测试case，也就是说，有些状态我们是重复搜的。

那么，我们就有机会直接把所有的状态打个表出来，然后直接离线查找就ok了。

但是，当我用map把表打出来的时候，然后很奇妙的又TLE，估计是每种情况bfs也是比较消费时间的。

然后，有想到了，直接把所有的情况，直观的打出来。 堆到代码上，就ok了。

不过对于能够这样做的情况比较狭隘，因为，有一些提交系统是对代码的长度有限制的。。

对于一些特殊的题目，我们是可以考虑用这种方法的。。

code：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <queue>
#include <algorithm>
#include <stack>
#include <map>
using namespace std;

string en = "ABCDEF#";
struct Node
{
    string rode;
    string str;
    int step;
    Node() { }
    Node(string _rode, string _str, int _step){
        rode = _rode; str = _str; step = _step;
    }
};
int kk;

int re_index(string str)
{
    for(int i = 0; i < 7; i ++){
        if(str[i] == '#') return i;
    }
}

string swaps(string str, int index1, int index2)
{
    swap(str[index1], str[index2]);
    return str;
}

pair<string, int> bfs(string st)
{
    st += "#";
    map<string, bool> map;
    map[st] = true;
    queue<Node> q;
    q.push(Node("", st, 0));
    while(!q.empty()){
        string tmp = q.front().str, ans_rode = q.front().rode;
        int steps = q.front().step;
        string tmp1;
        q.pop();

        if(tmp == en){
        	return make_pair(ans_rode, steps);
        }
        int index = re_index(tmp);
        if(index == 0){
            tmp1 = swaps(tmp, 0, 1);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[1], tmp1, steps + 1));
                map[tmp1] = true;
            }
            tmp1 = swaps(tmp, 0, 5);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[5], tmp1, steps + 1));
                map[tmp1] = true;
            }
        }
        if(index == 1){
            tmp1 = swaps(tmp, 1, 0);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[0], tmp1, steps + 1));
                map[tmp1] = true;
            }
            tmp1 = swaps(tmp, 1, 2);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[2], tmp1, steps + 1));
                map[tmp1] = true;
            }
            tmp1 = swaps(tmp, 1, 6);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[6], tmp1, steps + 1));
                map[tmp1] = true;
            }
        }
        if(index == 2){
            tmp1 = swaps(tmp, 2, 1);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[1], tmp1, steps + 1));
                map[tmp1] = true;
            }
            tmp1 = swaps(tmp, 2, 3);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[3], tmp1, steps + 1));
                map[tmp1] = true;
            }
        }
        if(index == 3){
            tmp1 = swaps(tmp, 3, 2);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[2], tmp1, steps + 1));
                map[tmp1] = true;
            }
            tmp1 = swaps(tmp, 3, 4);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[4], tmp1, steps + 1));
                map[tmp1] = true;
            }
        }
        if(index == 4){
            tmp1 = swaps(tmp, 4, 3);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[3], tmp1, steps + 1));
                map[tmp1] = true;
            }
            tmp1 = swaps(tmp, 4, 6);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[6], tmp1, steps + 1));
                map[tmp1] = true;
            }
            tmp1 = swaps(tmp, 4, 5);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[5], tmp1, steps + 1));
                map[tmp1] = true;
            }
        }
        if(index == 5){
            tmp1 = swaps(tmp, 5, 0);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[0], tmp1, steps + 1));
                map[tmp1] = true;
            }
            tmp1 = swaps(tmp, 5, 4);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[4], tmp1, steps + 1));
                map[tmp1] = true;
            }
        }
        if(index == 6){
            tmp1 = swaps(tmp, 6, 1);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[1], tmp1, steps + 1));
                map[tmp1] = true;
            }
            tmp1 = swaps(tmp, 6, 4);
            if(!map[tmp1]){
                q.push(Node(ans_rode + tmp[4], tmp1, steps + 1));
                map[tmp1] = true;
            }
        }
    }
    return make_pair("NO SOLUTION", -1);
}
map<string, pair<string, int> > ans;
void Init()
{
ans["ABCDEF"] = make_pair("",0);
ans["ABDFCE"] = make_pair("CEABCEFDCBAFE",13);
ans["ABECFD"] = make_pair("FDABECDFEBAFE",13);
ans["ABFEDC"] = make_pair("DCABFECDFECDFEBAFE",18);
ans["ACBDFE"] = make_pair("CBDFEABCEFDCBAFE",16);
ans["ACDEBF"] = make_pair("BEDCB",5);
ans["ACEFDB"] = make_pair("DBACDBFEDCAFEDCB",16);
ans["ACFBED"] = make_pair("CADECAFBCEDFAEDFABCDE",21);
ans["ADBFEC"] = make_pair("DBFECABFECDFECDFEBAFE",21);
ans["ADCEFB"] = make_pair("DABFECABFEDBACDEFAB",19);
ans["ADEBCF"] = make_pair("DEBCDEBCDE",10);
ans["ADFCBE"] = make_pair("DAEBDAFCDBEFABEFAB",18);
ans["AEBCDF"] = make_pair("EBCDE",5);
ans["AECFBD"] = make_pair("BFCEBFDABECDFEBAFE",18);
ans["AEDBFC"] = make_pair("EACFEACFEBDCABEFAB",18);
ans["AEFDCB"] = make_pair("CDFECDBACDBFEDCAFEDCB",21);
ans["AFBECD"] = make_pair("FBECDABECDFEBAFE",16);
ans["AFCBDE"] = make_pair("FAEDBCAFBDEFACDEFAB",19);
ans["AFDCEB"] = make_pair("FABECDAFCEBFADEBFACBEDCB",24);
ans["AFEDBC"] = make_pair("FACBFAEDFAECBAFDCBAFE",21);
ans["BACEDF"] = make_pair("ABFDECBAEDFABCDE",16);
ans["BADCFE"] = make_pair("ADCFADBEAFCBEAFDEBCDE",21);
ans["BAEFCD"] = make_pair("ABDCABDCAFEDCAFEDCB",19);
ans["BAFDEC"] = make_pair("AFDEAFBCAFBCAFEDCB",18);
ans["BCAEFD"] = make_pair("CBDFEABDFEABDCABDCABEFAB",24);
ans["BCDFEA"] = make_pair("EFDCBAFE",8);
ans["BCEDAF"] = make_pair("ADECBFDECBAEDFABCDE",19);
ans["BCFADE"] = make_pair("CBEDCBFACDEFACDEFAB",19);
ans["BDACEF"] = make_pair("DBFEDBACDEFAB",13);
ans["BDCFAE"] = make_pair("DBEAFCBEAFDEBCDE",16);
ans["BDEAFC"] = make_pair("FAEDBCAFBCAFEDCB",16);
ans["BDFECA"] = make_pair("CEFDCEFDCBAFE",13);
ans["BEAFDC"] = make_pair("DFAEDFAEDBCAFBCAFEDCB",21);
ans["BECDFA"] = make_pair("EBAFE",5);
ans["BEDACF"] = make_pair("EDACEDBFEDBACDEFAB",18);
ans["BEFCAD"] = make_pair("ADBEFCDBEFABEFAB",16);
ans["BFADCE"] = make_pair("CEBFADEBFACBEDCB",16);
ans["BFCAED"] = make_pair("FBDEACBDEAFDEAFDEBCDE",21);
ans["BFDEAC"] = make_pair("FBCAFBCAFEDCB",13);
ans["BFECDA"] = make_pair("FECDFEBAFE",10);
ans["CABFDE"] = make_pair("ACEDFBCAFBCAFBDEFACDEFAB",24);
ans["CADBEF"] = make_pair("ACFEBDCABEFAB",13);
ans["CAEDFB"] = make_pair("AEDFAECBAFDCBAFE",16);
ans["CAFEBD"] = make_pair("ACDBACDBAEFDCEFDCBAFE",21);
ans["CBAFED"] = make_pair("BCDEFACBFACBDEAFDEAFDEBCDE",26);
ans["CBDEFA"] = make_pair("BCAFEDCB",8);
ans["CBEADF"] = make_pair("BCFDAECBAECBAEDFABCDE",21);
ans["CBFDAE"] = make_pair("BCEADFCBDFCBEAFDEBCDE",21);
ans["CDABFE"] = make_pair("FBADCEBADCEBAFEBAFE",19);
ans["CDBEAF"] = make_pair("AEBDCFEBDCABEFAB",16);
ans["CDEFBA"] = make_pair("BFEDCAFEDCB",11);
ans["CDFAEB"] = make_pair("EAFDCBAFDCBAFE",14);
ans["CEADBF"] = make_pair("ECFBECADEBFACBEDCB",18);
ans["CEBAFD"] = make_pair("FABECDAFCDAFBEDCBEDCB",21);
ans["CEDFAB"] = make_pair("ECBAFDCBAFE",11);
ans["CEFBDA"] = make_pair("DBFEDBFEDCAFEDCB",16);
ans["CFAEDB"] = make_pair("DEAFDEAFDCBAFDCBAFE",19);
ans["CFBDEA"] = make_pair("FBDEFBCAFEDCB",13);
ans["CFDABE"] = make_pair("FCEBADCEBAFEBAFE",16);
ans["CFEBAD"] = make_pair("FCDAFCDAFBEDCBEDCB",18);
ans["DABEFC"] = make_pair("ADCFEBDCFEBDCABEFAB",19);
ans["DACFEB"] = make_pair("ADBEADBEAFCBEAFDEBCDE",21);
ans["DAECBF"] = make_pair("ADFBCEDACBFACBEDCB",18);
ans["DAFBCE"] = make_pair("AFBCEDFAEDFABCDE",16);
ans["DBAECF"] = make_pair("BDFCBDAEBCFAEBCDEBCDE",21);
ans["DBCAFE"] = make_pair("FACBDEAFDEAFDEBCDE",18);
ans["DBEFAC"] = make_pair("BDCAFEDCAFEDCB",14);
ans["DBFCEA"] = make_pair("BDAECFDBCEABCEFDCBAFE",21);
ans["DCAFBE"] = make_pair("CDEBFADCFADCEBAFEBAFE",21);
ans["DCBAEF"] = make_pair("CDFEABDCABDCABEFAB",18);
ans["DCEBFA"] = make_pair("CDAFBEDCBEDCB",13);
ans["DCFEAB"] = make_pair("CDBAEFDCEFDCBAFE",16);
ans["DEACFB"] = make_pair("FBDEFBDEFACDEFAB",16);
ans["DEBFCA"] = make_pair("CFBEDAFBEDCBEDCB",16);
ans["DECBAF"] = make_pair("ABCEDFBCEDACBFACBEDCB",21);
ans["DEFABC"] = make_pair("EDCBAFDCBAFDCBAFE",17);
ans["DFABEC"] = make_pair("ECDFABCDFABCDE",14);
ans["DFBCAE"] = make_pair("AEDFAEDFABCDE",13);
ans["DFCEBA"] = make_pair("FCEBFCDAFBEDCBEDCB",18);
ans["DFEACB"] = make_pair("FDBCAEDBCAFBCAFEDCB",19);
ans["EABDCF"] = make_pair("CDBAEFDCEABCDFABCDE",19);
ans["EACBFD"] = make_pair("FBCAFBDEFACDEFAB",16);
ans["EADFBC"] = make_pair("AECBAECBAFDCBAFE",16);
ans["EAFCDB"] = make_pair("AFCDBEFABEFAB",13);
ans["EBADFC"] = make_pair("BADFBAECBAECBAFDCBAFE",21);
ans["EBCFDA"] = make_pair("DFCBEAFDEBCDE",13);
ans["EBDCAF"] = make_pair("ACDBEFCDBEADCFAEBCDEBCDE",24);
ans["EBFACD"] = make_pair("BFACDEFACDEFAB",14);
ans["ECABDF"] = make_pair("CEFDCEABCDFABCDE",16);
ans["ECBFAD"] = make_pair("CEDAFBEDAFBEDCBEDCB",19);
ans["ECDAFB"] = make_pair("FADCEBAFEBAFE",13);
ans["ECFDBA"] = make_pair("CFDBAEFCABDCABEFAB",18);
ans["EDAFCB"] = make_pair("DAFCDAFCDBEFABEFAB",18);
ans["EDBCFA"] = make_pair("DEAFDEBCDE",10);
ans["EDCABF"] = make_pair("DEFBACEFBADFECDFEBAFE",21);
ans["EDFBAC"] = make_pair("DECABFEDBFEDCAFEDCB",19);
ans["EFACBD"] = make_pair("BDEFACDEFAB",11);
ans["EFBADC"] = make_pair("DCEFBACDBACDEFAB",16);
ans["EFCDAB"] = make_pair("FEBAFEBAFE",10);
ans["EFDBCA"] = make_pair("FDBCFDEAFDEBCDE",15);
ans["FABCED"] = make_pair("EDFABCDE",8);
ans["FACDBE"] = make_pair("BEFAB",5);
ans["FADECB"] = make_pair("CBFACBEDCB",10);
ans["FAEBDC"] = make_pair("DCFAEBCDEBCDE",13);
ans["FBACDE"] = make_pair("BACDEFAB",8);
ans["FBCEAD"] = make_pair("AECBAEDFABCDE",13);
ans["FBDAEC"] = make_pair("BFCEBFCEBADCEBAFEBAFE",21);
ans["FBEDCA"] = make_pair("CDEBFADCFBECDABECDFEBAFE",24);
ans["FCADEB"] = make_pair("CADEBFACBEDCB",13);
ans["FCBEDA"] = make_pair("CFADCFBECDABECDFEBAFE",21);
ans["FCDBAE"] = make_pair("ABDCABEFAB",10);
ans["FCEABD"] = make_pair("CEABCEABCDFABCDE",16);
ans["FDAEBC"] = make_pair("DAEBCFAEBCDEBCDE",16);
ans["FDBACE"] = make_pair("DBACDBACDEFAB",13);
ans["FDCBEA"] = make_pair("DFAEBCFAEBDAFCDBEFABEFAB",24);
ans["FDECAB"] = make_pair("DFBADFECDFEBAFE",15);
ans["FEABCD"] = make_pair("EABCDFABCDE",11);
ans["FEBDAC"] = make_pair("EFCAEFBDEFBCAFEDCB",18);
ans["FECADB"] = make_pair("ECADECADEBFACBEDCB",18);
ans["FEDCBA"] = make_pair("EFABCDFABCEAFDEAFBCAFBCAFEDCB",29);

}
int main()
{
    Init();
    //打表痕迹留下。
    /*freopen("2.txt", "w", stdout);
	string b = "ABCDEF";
	do{
		ans[b] = bfs(b);
		if(ans[b].second != -1)
        cout << "ans[\"" << b << "\"] = make_pair(\"" << ans[b].first <<"\"," <<ans[b].second << ");" << endl;
	}while(next_permutation(b.begin(), b.begin() + 6));*/
    int T, k = 1;
    cin >> T;
    while(T --){
        cin >> kk;
        string st;
        cin >> st;
        if(st == "ABCDEF"){
            cout << k << " " << 0 << endl;
        }
        else if(ans[st].second > 0) cout << k << " " << ans[st].second << " " << ans[st].first << endl;
        else cout << k << " " << "NO SOLUTION" << endl;
        k ++;
    }
    return 0;
}