hdu5836, 2016CCPC网络赛

题目大意：给你一个纯白色的魔方，给其中n<=5个格子涂上黑色，然后随便扭，问有多少种可达状态（去掉旋转后可得到的重复情况）

傻逼一样的题目，暴力直接做就行，赛场上想去重时想乱了。其实给魔方加上一个旋转中间层就好处理了。我这里贴一下代码当做是模板了。

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>

using namespace std;

#define LL long long
#define MAXN 54
#define hash MY_HASH
#define MOD 999997
#define FMZ 0
#define BMZ 5
#define UMZ 2
#define DMZ 3
#define LMZ 4
#define RMZ 1

int a[MAXN], ans, n;
queue <LL > q;
vector <LL > hash[MOD];

struct MagicCube{
    typedef char Elem;
    #define f c[0]
    #define b c[5]
    #define u c[2]
    #define d c[3]
    #define l c[4]
    #define r c[1]

//    Elem f[9], b[9], u[9], d[9], l[9], r[9], tmp[9], ch;
    Elem ch, tmp[9], c[6][9];

    void init() {
        for (int i = 0; i < 9; ++i) u[i] = a[i];
        for (int i = 0; i < 9; ++i) l[i] = a[i+9];
        for (int i = 0; i < 9; ++i) f[i] = a[i+18];
        for (int i = 0; i < 9; ++i) r[i] = a[i+27];
        for (int i = 0; i < 9; ++i) b[i] = a[i+36];
        for (int i = 0; i < 9; ++i) d[i] = a[i+45];
    }
    void decode(LL code) {
        for (int i = 0; i < 9; ++i) {u[i] = code & 1; code >>= 1;}
        for (int i = 0; i < 9; ++i) {l[i] = code & 1; code >>= 1;}
        for (int i = 0; i < 9; ++i) {f[i] = code & 1; code >>= 1;}
        for (int i = 0; i < 9; ++i) {r[i] = code & 1; code >>= 1;}
        for (int i = 0; i < 9; ++i) {b[i] = code & 1; code >>= 1;}
        for (int i = 0; i < 9; ++i) {d[i] = code & 1; code >>= 1;}
    }

    LL encode() {
        LL res = 0;
        for (int i = 0; i < 9; ++i) if (u[i]) res = res + (1LL << (i + 0));
        for (int i = 0; i < 9; ++i) if (l[i]) res = res + (1LL << (i + 9));
        for (int i = 0; i < 9; ++i) if (f[i]) res = res + (1LL << (i + 18));
        for (int i = 0; i < 9; ++i) if (r[i]) res = res + (1LL << (i + 27));
        for (int i = 0; i < 9; ++i) if (b[i]) res = res + (1LL << (i + 36));
        for (int i = 0; i < 9; ++i) if (d[i]) res = res + (1LL << (i + 45));
        return res;
    }

    int right_rotate(Elem a[9]) {
        for (int i = 0; i < 9; ++i) tmp[i] = a[i];
        for (int i = 0; i < 3; ++i)
            for (int j = 0; j < 3; ++j) 
                a[i*3+j] = tmp[3*(2 - j) + i];
    }

    void L(int cnt = 1) {
        for (; cnt>0; --cnt) {
            right_rotate(l);
            ch=u[0];u[0]=b[8];b[8]=d[0];d[0]=f[0];f[0]=ch;
            ch=u[3];u[3]=b[5];b[5]=d[3];d[3]=f[3];f[3]=ch;
            ch=u[6];u[6]=b[2];b[2]=d[6];d[6]=f[6];f[6]=ch;
        }
    }
    void R(int cnt = 1) {
        for (; cnt>0; --cnt) {
            right_rotate(r);
            ch=u[2];u[2]=f[2];f[2]=d[2];d[2]=b[6];b[6]=ch;
            ch=u[5];u[5]=f[5];f[5]=d[5];d[5]=b[3];b[3]=ch;
            ch=u[8];u[8]=f[8];f[8]=d[8];d[8]=b[0];b[0]=ch;
        }
    }
    void U(int cnt = 1) {
        for (; cnt>0; --cnt) {
            right_rotate(u);
            ch=f[0];f[0]=r[0];r[0]=b[0];b[0]=l[0];l[0]=ch;
            ch=f[1];f[1]=r[1];r[1]=b[1];b[1]=l[1];l[1]=ch;
            ch=f[2];f[2]=r[2];r[2]=b[2];b[2]=l[2];l[2]=ch;    
        }
    }
    void D(int cnt = 1) {
        for (; cnt>0; --cnt) {
            right_rotate(d);
            ch=f[6];f[6]=l[6];l[6]=b[6];b[6]=r[6];r[6]=ch;
            ch=f[7];f[7]=l[7];l[7]=b[7];b[7]=r[7];r[7]=ch;
            ch=f[8];f[8]=l[8];l[8]=b[8];b[8]=r[8];r[8]=ch;
        }
    }
    void F(int cnt = 1) {
        for (; cnt > 0; --cnt) {
            right_rotate(f);
            ch=u[6];u[6]=l[8];l[8]=d[2];d[2]=r[0];r[0]=ch;
            ch=u[7];u[7]=l[5];l[5]=d[1];d[1]=r[3];r[3]=ch;
            ch=u[8];u[8]=l[2];l[2]=d[0];d[0]=r[6];r[6]=ch;
        }
    }
    void B(int cnt = 1) {
        for (; cnt > 0; --cnt) {
            right_rotate(b);
            ch=u[0];u[0]=r[2];r[2]=d[8];d[8]=l[6];l[6]=ch;
            ch=u[1];u[1]=r[5];r[5]=d[7];d[7]=l[3];l[3]=ch;
            ch=u[2];u[2]=r[8];r[8]=d[6];d[6]=l[0];l[0]=ch;
        }
    }
    void MI() {
        //ch=f[3],f[3]=l[5],l[5]=l[4],l[4]=l[3],l[3]=b[5],b[5]=b[4],b[4]=b[3],b[3]=r[5],r[5]=r[4],r[4]=r[3],r[3]=f[5],f[5]=f[4],f[4]=ch;
        ch=f[3]; f[3]=r[3]; r[3]=b[3]; b[3]=l[3]; l[3]=ch;
        ch=f[4]; f[4]=r[4]; r[4]=b[4]; b[4]=l[4]; l[4]=ch;
        ch=f[5]; f[5]=r[5]; r[5]=b[5]; b[5]=l[5]; l[5]=ch;
    //follow U
    }
    void MJ() {
//        ch=u[5],u[5]=r[1],r[1]=r[4],r[4]=r[7],r[7]=d[5],d[5]=d[4],d[4]=d[3],d[3]=l[7],l[7]=l[4],l[4]=l[1],l[1]=u[3],u[3]=u[4],u[4]=ch;
        ch=u[3]; u[3]=l[7]; l[7]=d[5]; d[5]=r[1]; r[1]=ch;
        ch=u[4]; u[4]=l[4]; l[4]=d[4]; d[4]=r[4]; r[4]=ch;
        ch=u[5]; u[5]=l[1]; l[1]=d[3]; d[3]=r[7]; r[7]=ch;
    //follow F
    }
    void MK() {
//        ch=u[1],u[1]=u[4],u[4]=u[7],u[7]=f[1],f[1]=f[4],f[4]=f[7],f[7]=d[1],d[1]=d[4],d[4]=d[7],d[7]=b[7],b[7]=b[4],b[4]=b[1],b[1]=ch;

        ch=u[1]; u[1]=b[7]; b[7]=d[1]; d[1]=f[1]; f[1]=ch;
        ch=u[4]; u[4]=b[4]; b[4]=d[4]; d[4]=f[4]; f[4]=ch;
        ch=u[7]; u[7]=b[1]; b[1]=d[7]; d[7]=f[7]; f[7]=ch;
    //follow L
    }
    void print() {
        for (int i = 0; i < 9; ++i) cout << (int)f[i]; cout << endl;
        for (int i = 0; i < 9; ++i) cout << (int)d[i]; cout << endl;
        for (int i = 0; i < 9; ++i) cout << (int)l[i]; cout << endl;
        for (int i = 0; i < 9; ++i) cout << (int)r[i]; cout << endl;
        for (int i = 0; i < 9; ++i) cout << (int)u[i]; cout << endl;
        for (int i = 0; i < 9; ++i) cout << (int)b[i]; cout << endl;
    }
    #undef f 
    #undef b
    #undef u
    #undef d
    #undef l
    #undef r

} mc;

inline void addHash(const LL &x) {
    hash[x%MOD].push_back(x);    
}

inline bool inHash(const LL &x) {
    int t = x % MOD;
    for (int i = 0; i <    hash[t].size(); ++i) {
        if (hash[t][i] == x) return true;
    }
    return false;
}

inline void rotateI(MagicCube &t) {
    t.U();
    t.MI();
    t.D(3);
}

inline void rotateJ(MagicCube &t) {
    t.L();
    t.MK();
    t.R(3);
}

inline void rotateK(MagicCube &t) {
    t.F();
    t.MJ();
    t.B(3);
}

inline bool check(const MagicCube &tmp) {
    MagicCube t = tmp;    
    /*

    for (int i = 0; i < 4; ++i) {
        for (int j = 0; j < 4; ++j) {
            for (int k = 0; k < 4; ++k) {
                if (inHash(t.encode())) return false;
                rotateK(t);
            }
            rotateJ(t);
        }
        rotateI(t);
    }
    return true;
*/
    for (int j = 0; j < 4; ++j) {    
        for (int i = 0; i < 4; ++i) {
            if (inHash(t.encode())) return false;
            rotateI(t);
        }
        rotateK(t);
    }
    rotateJ(t);
    for (int i = 0; i < 4; ++i) {
        if (inHash(t.encode())) return false;
        rotateI(t);
    }
    rotateJ(t); rotateJ(t);
    for (int i = 0; i < 4; ++i) {
        if (inHash(t.encode())) return false;
        rotateI(t);
    }

    return true;
}


void solve() {
    ans = 0;
    while (q.size()) q.pop();
    LL u = mc.encode();
    for (int i = 0; i < MOD; ++i) hash[i].clear(); 
    addHash(u); q.push(u);
    MagicCube tmp;
    LL key;
    while (q.size()) {
        u = q.front(); ++ans; q.pop();
        tmp.decode(u);
        for (int i = 1; i <= 4; ++i) {
            tmp.L();
            if (i == 4) break;
            if (check(tmp)) {
            key = tmp.encode();    
                addHash(key);
                q.push(key);
            }
        }
        for (int i = 1; i <= 4; ++i) {
            tmp.F();
            if (i == 4) break;
            if (check(tmp)) {
            key = tmp.encode();    
                addHash(key);
                q.push(key);
            }
        }
        for (int i = 1; i <= 4; ++i) {
            tmp.U();
            if (i == 4) break;
            if (check(tmp)) {
            key = tmp.encode();    
                addHash(key);
                q.push(key);
            }
        }
        for (int i = 1; i <= 4; ++i) {
            tmp.D();
            if (i == 4) break;
            if (check(tmp)) {
            key = tmp.encode();    
                addHash(key);
                q.push(key);
            }
        }
        for (int i = 1; i <= 4; ++i) {
            tmp.R();
            if (i == 4) break;
            if (check(tmp)) {
            key = tmp.encode();    
                addHash(key);
                q.push(key);
            }
        }
        for (int i = 1; i <= 4; ++i) {
            tmp.B();
            if (i == 4) break;
            if (check(tmp)) {
            key = tmp.encode();    
                addHash(key);
                q.push(key);
            }
        }
    }
}

int main() {

    int cas; scanf("%d", &cas);
    for (int tt = 1; tt <= cas; ++tt) {
        memset(a, 0, sizeof(a));
        scanf("%d", &n);
        for (int i = 0; i < n; ++i) {
            int x; scanf("%d",&x); a[x] = 1;
        }
        mc.init();
        solve();
        printf("Case #%d: %d
", tt, ans);
    }
    return 0;
}