BZOJ 1501([NOI2005]智慧珠游戏-DLX)

DLX，但是要考虑12个模型4种旋转是否镜像12*4*2种情况放在55个位置的情况，还有剪枝删除一些没用的
MLE卡了半天……考场上要哭晕

#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])  
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (100000007)
#define pb push_back
#define mp make_pair 
#define fi first
#define se second
#define vi vector<int> 
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %lld\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
                        For(j,m-1) cout<<a[i][j]<<' ';\
                        cout<<a[i][m]<<endl; \
                        } 
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return (a-b+llabs(a-b)/F*F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
    int x=0,f=1; char ch=getchar();
    while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
    while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
    return x*f;
} 

struct DLX {
    #define maxn (100+10)
    #define MAXNode (10000+10)
    #define maxr (100)
    int n, sz;
    int S[maxn];
    int row[MAXNode],col[MAXNode];
    int L[MAXNode],R[MAXNode],U[MAXNode],D[MAXNode];
    int ansd, ans[maxr];

    void init(int n) {
        this->n = n;
        Rep(i,n+1) {
            U[i] = D[i] = i ; L[i]=i-1; R[i]=i+1;
        }
        R[n]=0; L[0]=n;
        sz=n+1;
        MEM(S)
    }

    void addRow(int r, vi columns) {
        int fir = sz;
        int cSz=columns.size();
        Rep(i,cSz) {
            int c=columns[i];
            L[sz] = sz-1; R[sz] = sz+1; D[sz] = c; U[sz] = U[c];
            D[ U[c] ] =sz; U[c]=sz;
            row[sz] = r; col[sz] = c;
            S[c]++; sz++;
        }
        R[sz-1]=fir; L[fir] = sz-1;
    }
    #define FOR(i,A,s) for(int i=A[s];i!=s;i=A[i])
    void remove(int c) {
        L[R[c]] = L[c];
        R[L[c]] = R[c];
        FOR(i,D,c) 
            FOR(j,R,i) {
                U[D[j]] = U[j]; D[U[j]] = D[j]; --S[col[j]];
            }
    } 
    void restore(int c) {
        FOR(i,U,c) 
            FOR(j,L,i) {
                ++S[col[j]];
                U[D[j]] = j;
                D[U[j]] = j;
            } 
        L[R[c]]=c;
        R[L[c]]=c;
    } 
    bool dfs(int d) {
        if ( R[0] == 0) {
            ansd = d;
            return 1;
        } 
        int c = R[0];
        FOR(i,R,0) if (S[i] < S[c]) c = i;
        remove(c);
        FOR(i,D,c) {
            ans[d] = row[i];
            FOR(j,R,i) remove(col[j]);
            if (dfs(d+1)) return 1;
            FOR(j,L,i) restore(col[j]);
        } 
        restore(c);
        return 0;
    }   
    bool solve(vi &v) {
        v.clear();
        if (!dfs(0)) return 0;
        Rep(i,ansd) v.pb(ans[i]);
        return 1;
    }   
};
DLX solver;
int siz[50]={3,4,4,4,5,5,5,5,5,5,5,5};
const int n=12;
bool b_nomir[50]={1,1,0,1,1,0,1,0,0,1,0,0};
int tabl[50][8][5][2] ={
{
{{0,0},{0,1},{1,0},{0,0},{0,0}},
{{0,0},{0,1},{1,1},{0,0},{0,0}},
{{0,0},{1,0},{1,1},{0,0},{0,0}},
{{1,1},{0,1},{1,0},{0,0},{0,0}},
},
{
{{0,0},{0,1},{0,2},{0,3}},
{{0,0},{1,0},{2,0},{3,0}},
},
{
{{0,0},{0,1},{0,2},{1,0}},
{{0,0},{0,1},{0,2},{1,2}},
{{1,0},{1,1},{1,2},{0,2}},
{{1,0},{1,1},{1,2},{0,0}},
},
{
{{0,0},{0,1},{1,0},{1,1}},
},
{
{{0,0},{1,0},{2,0},{2,1},{2,2}},
},
{
{{0,0},{1,0},{2,0},{3,0},{1,1}},
},
{
{{0,0},{1,0},{2,0},{0,1},{2,1}},
},
{
{{0,0},{1,0},{2,0},{0,1},{1,1}},
},
{
{{0,0},{1,0},{2,0},{2,1},{3,1}},
},
{
{{0,1},{1,0},{1,1},{1,2},{2,1}},
},
{
{{0,0},{1,0},{1,1},{2,1},{2,2}},
},
{
{{0,0},{1,0},{0,1},{0,2},{0,3}},
}

};
void rot(int x,int y,int &x2,int &y2) {
    x2=-y;
    y2=x; 
}
void mir(int &x,int y) {
    x=-x;
}

char puzzle[10][10];
bool avi[100]={0};
bool b[100][100]={0};
int pos[100][100];
inline bool check(int i,int j) {
    if (0<=i&&i<=9 && 0<=j && j<=i&&'.'==puzzle[i][j]) return 1;
    return 0;
} 
vector<pi> save_xy[100000];
int Col[100000];
int main()
{
//  freopen("bzoj1501.in","r",stdin);
//  freopen("bzoj1501.out","w",stdout);

    Rep(i,10) cin>>puzzle[i];
    int sz=0;
    Rep(i,10) Rep(j,i+1) {
        if (puzzle[i][j]!='.') avi[puzzle[i][j]-'A']=1;
        pos[i][j]=++sz;
    }
    Rep(i,12) {
        Rep(l,siz[i])
            For(j,7) {
                rot(tabl[i][j-1][l][0],tabl[i][j-1][l][1],tabl[i][j][l][0],tabl[i][j][l][1]); 
                if (j==4) mir(tabl[i][j][l][0],tabl[i][j][l][1]);
            }
    }   

    int tc=55;
    solver.init(tc+12);
    int rn=0;
    Rep(k,12) {
        if (avi[k]) {
            vi columns;
            Rep(i,10) 
                Rep(j,i+1)
                    if (puzzle[i][j]=='A'+k) columns.pb(pos[i][j]);
            columns.pb(tc+1+k);
            solver.addRow(++rn,columns);
        }
        else {
            Rep(i,10) {
                Rep(j,i+1) {
                  Rep(t,8) {
                        if (t>=4&&b_nomir[k]) continue;
                        vi columns;
                        bool fl=0;
                        Rep(l,siz[k]) {
                            int x=tabl[k][t][l][0]+i;
                            int y=tabl[k][t][l][1]+j;

                            if (!check(x,y)) {fl=1;break;} 
                        }

                        if (fl) continue; 

                        Rep(l,siz[k]) {
                            int x=tabl[k][t][l][0]+i;
                            int y=tabl[k][t][l][1]+j;
                            columns.pb(pos[x][y]); 
                            save_xy[rn+1].pb(mp(x,y) );
                        }
                        columns.pb(tc+1+k);
                        solver.addRow(++rn,columns);
                        Col[rn]=k;
                    }
                }
            }

        }
    }

    int ans=INF;
    vi v;
    bool fl=solver.solve(v);
    if(!fl) {
        puts("No solution"); return 0;
    }
    int ssz=SI(v);
    Rep(i,ssz) {
        int sssz=SI(save_xy[v[i]]);
        Rep(j,sssz) {
            pi p=save_xy[v[i]][j];
            puzzle[p.fi][p.se]=Col[v[i]]+'A';
        }
    }
    Rep(i,10) puts(puzzle[i]);
    return 0;
}