1501: [NOI2005]智慧珠游戏
Time Limit: 5 Sec Memory Limit: 64 MB
Submit: 297 Solved: 184
[Submit][Status][Discuss]
Description
Input
文件中包含初始的盘件描述,一共有10行,第i行有i个字符。如果第i行的第j个字符是字母”A”至”L”中的一个,则表示第i行第j列的格子上已经放了零件,零件的编号为对应的字母。如果第i行的第j个字符是”.”,则表示第i行第j列的格子上没有放零件。输入保证预放的零件已摆放在盘件中。
Output
如果能找到解,向输出文件打印10行,为放完全部12个零件后的布局。其中,第i行应包含i个字符,第i行的第j个字符表示第i行第j列的格子上放的是哪个零件。如果无解,输出单独的一个字符串‘No solution’(不要引号,请注意大小写)。所有的数据保证最多只有一组解。
Sample Input
.
..
…
….
…..
…..C
…CCC.
EEEHH…
E.HHH….
E………
Sample Output
B
BK
BKK
BJKK
JJJDD
GJGDDC
GGGCCCI
EEEHHIIA
ELHHHIAAF
ELLLLIFFFF
虐心搜索,使劲搜~~哈哈 至于 会吗??? 呵呵
#include<bits/stdc++.h>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define INF (2139062143)
#define F (100000007)
#define SI(a) ((a).size())
typedef long long ll;
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],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;
memset(S,0,sizeof S );
}
void addRow(int r,vector<int> 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(vector<int> &v) {
v.clear();
if (!dfs(0)) return 0;
Rep(i,ansd) v.push_back(ans[i]);
return 1;
}
}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< pair<int,int> > save_xy[100000];
int Col[100000];
int main(){
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]) {
vector<int> columns;
Rep(i,10)
Rep(j,i+1)
if (puzzle[i][j]=='A'+k) columns.push_back(pos[i][j]);
columns.push_back(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;
vector<int> 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.push_back(pos[x][y]);
save_xy[rn+1].push_back(make_pair(x,y) );
}
columns.push_back(tc+1+k);
solver.addRow(++rn,columns);
Col[rn]=k;
}
}
}
}
}
int ans=INF;
vector<int> 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) {
pair<int,int> p=save_xy[v[i]][j];
puzzle[p.first][p.second]=Col[v[i]]+'A';
}
}
Rep(i,10) puts(puzzle[i]);
return 0;
}