- 地表最强DLX(必要时需对dancing进行修改)
const int maxnode = 262500;
const int maxn = 750;
const int maxm = 350;
const int inf = 0x3f3f3f;
struct DLX
{
int n, m, size;
int U[maxnode], D[maxnode], R[maxnode], L[maxnode], Row[maxnode], Col[maxnode];
int H[maxn];
int S[maxm];
int ansd, ans[maxn];
int ansnum;
int theans[maxn];
void init(int _n, int _m)
{
n = _n, m = _m;
ansnum = 0;
ansd = inf;
for (int i = 0;i <= m;i++)
{
S[i] = 0;
U[i] = D[i] = i;
L[i] = i - 1;
R[i] = i + 1;
}
R[m] = 0, L[0] = m;
size = m;
for (int i = 1;i <= n;i++)
H[i] = -1;
}
void link(int r, int c)
{
++S[Col[++size] = c];
Row[size] = r;
D[size] = D[c];
U[D[c]] = size;
U[size] = c;
D[c] = size;
if (H[r] < 0)
H[r] = L[size] = R[size] = size;
else
{
R[size] = R[H[r]];
L[R[H[r]]] = size;
L[size] = H[r];
R[H[r]] = size;
}
}
void exact_remove(int c)
{
L[R[c]] = L[c];
R[L[c]] = R[c];
for(int i=D[c];i!=c;i=D[i])
for (int j = R[i];j != i;j = R[j])
{
U[D[j]] = U[j];
D[U[j]] = D[j];
--S[Col[j]];
}
}
void repeat_remove(int c)
{
for (int i = D[c];i != c;i = D[i])
L[R[i]] = L[i], R[L[i]] = R[i];
}
void exact_resume(int c)
{
for (int i = U[c];i != c;i = U[i])
for (int j = L[i];j != i;j = L[j])
++S[Col[U[D[j]] = D[U[j]] = j]];
L[R[c]] = R[L[c]] = c;
}
void repeat_resume(int c)
{
for (int i = U[c];i != c;i = U[i])
L[R[i]] = R[L[i]] = i;
}
void exact_dance(int d)
{
if (R[0] == 0)
{
ansnum++;
memcpy(theans, ans, sizeof(ans));
ansd = d;
return;
}
int c = R[0];
for (int i = R[0];i != 0;i = R[i])
if (S[i] < S[c])
c = i;
exact_remove(c);
for (int i = D[c];i != c;i = D[i])
{
ans[d] = Row[i];
for (int j = R[i];j != i;j = R[j])
exact_remove(Col[j]);
exact_dance(d + 1);
for (int j = L[i];j != i;j = L[j])
exact_resume(Col[j]);
}
exact_resume(c);
}
int f()
{
bool vv[maxm];
int ret = 0, c, i, j;
for (c = R[0];c != 0;c = R[c])vv[c] = 1;
for(c=R[0];c!=0;c=R[c])
if (vv[c])
{
ret++, vv[c] = 0;
for (i = D[c];i != c;i = D[i])
for (j = R[i];j != i;j = R[j])
vv[Col[j]] = 0;
}
return ret;
}
void repeat_dance(int d)
{
if (d + f() >= ansd)return;
if (R[0] == 0)
{
if (d < ansd)ansd = d;
return;
}
int c = R[0], i, j;
for (i = R[0];i;i = R[i])
if (S[i] < S[c])c = i;
for (i = D[c];i != c;i = D[i])
{
repeat_remove(i);
for (j = R[i];j != i;j = R[j])repeat_remove(j);
repeat_dance(d + 1);
for (j = L[i];j != i;j = L[j])repeat_resume(j);
repeat_resume(i);
}
}
};
DLX x;
#include<iostream>
#include<stdio.h>
#include<cstring>
using namespace std;
const int maxnode = 60000;
const int maxn = 20;
const int maxm = 305;
struct DLX
{
int n, m, size;
int U[maxnode], D[maxnode], R[maxnode], L[maxnode], Row[maxnode], Col[maxnode];
int H[maxn];
int S[maxm];
int ansd, ans[maxn];
void init(int _n, int _m)
{
n = _n, m = _m;
for (int i = 0;i <= m;i++)
{
S[i] = 0;
U[i] = D[i] = i;
L[i] = i - 1;
R[i] = i + 1;
}
R[m] = 0, L[0] = m;
size = m;
for (int i = 1;i <= n;i++)
H[i] = -1;
}
void link(int r, int c)
{
++S[Col[++size] = c];
Row[size] = r;
D[size] = D[c];
U[D[c]] = size;
U[size] = c;
D[c] = size;
if (H[r] < 0)
H[r] = L[size] = R[size] = size;
else
{
R[size] = R[H[r]];
L[R[H[r]]] = size;
L[size] = H[r];
R[H[r]] = size;
}
}
void remove(int c)
{
L[R[c]] = L[c];
R[L[c]] = R[c];
for(int i=D[c];i!=c;i=D[i])
for (int j = R[i];j != i;j = R[j])
{
U[D[j]] = U[j];
D[U[j]] = D[j];
--S[Col[j]];
}
}
void resume(int c)
{
for (int i = U[c];i != c;i = U[i])
for (int j = L[i];j != i;j = L[j])
++S[Col[U[D[j]] = D[U[j]] = j]];
L[R[c]] = R[L[c]] = c;
}
bool dance(int d)
{
if (R[0] == 0)
{
ansd = d;
return true;
}
int c = R[0];
for (int i = R[0];i != 0;i = R[i])
if (S[i] < S[c])
c = i;
remove(c);
for (int i = D[c];i != c;i = D[i])
{
ans[d] = Row[i];
for (int j = R[i];j != i;j = R[j])
remove(Col[j]);
if (dance(d + 1))return true;
for (int j = L[i];j != i;j = L[j])
resume(Col[j]);
}
resume(c);
return false;
}
};
DLX x;
int main()
{
int M, N;
while (~scanf("%d %d",&M,&N))
{
x.init(M, N);
int num;
for(int i=1;i<=M;i++)
for (int j = 1;j <= N;j++)
{
scanf("%d", &num);
if(num)x.link(i, j);
}
if (!x.dance(0))
puts("It is impossible");
else
puts("Yes, I found it");
}
return 0;
}
#include<iostream>
#include<stdio.h>
#include<cstring>
using namespace std;
const int maxnode = 60000;
const int maxn = 800;
const int maxm = 350;
struct DLX
{
int n, m, size;
int U[maxnode], D[maxnode], R[maxnode], L[maxnode], Row[maxnode], Col[maxnode];
int H[maxn];
int S[maxm];
int ansd, ans[maxn];
char cans[9 * 9 + 10];
void init(int _n, int _m)
{
n = _n, m = _m;
memset(cans, '\0', sizeof(cans));
for (int i = 0;i <= m;i++)
{
S[i] = 0;
U[i] = D[i] = i;
L[i] = i - 1;
R[i] = i + 1;
}
R[m] = 0, L[0] = m;
size = m;
for (int i = 1;i <= n;i++)
H[i] = -1;
}
void link(int r, int c)
{
++S[Col[++size] = c];
Row[size] = r;
D[size] = D[c];
U[D[c]] = size;
U[size] = c;
D[c] = size;
if (H[r] < 0)
H[r] = L[size] = R[size] = size;
else
{
R[size] = R[H[r]];
L[R[H[r]]] = size;
L[size] = H[r];
R[H[r]] = size;
}
}
void remove(int c)
{
L[R[c]] = L[c];
R[L[c]] = R[c];
for(int i=D[c];i!=c;i=D[i])
for (int j = R[i];j != i;j = R[j])
{
U[D[j]] = U[j];
D[U[j]] = D[j];
--S[Col[j]];
}
}
void resume(int c)
{
for (int i = U[c];i != c;i = U[i])
for (int j = L[i];j != i;j = L[j])
++S[Col[U[D[j]] = D[U[j]] = j]];
L[R[c]] = R[L[c]] = c;
}
bool dance(int d)
{
if (R[0] == 0)
{
ansd = d;
return true;
}
int c = R[0];
for (int i = R[0];i != 0;i = R[i])
if (S[i] < S[c])
c = i;
remove(c);
for (int i = D[c];i != c;i = D[i])
{
ans[d] = Row[i];
for (int j = R[i];j != i;j = R[j])
remove(Col[j]);
if (dance(d + 1))return true;
for (int j = L[i];j != i;j = L[j])
resume(Col[j]);
}
resume(c);
return false;
}
void out()
{
int kinds, num;
for (int i = 0;i < ansd;i++)
{
kinds = (ans[i]-1) % 9+1;
num = (ans[i]-1) / 9+1;
cans[num] = kinds + '0';
}
printf("%s\n", cans+1);
}
};
DLX x;
int main()
{
char s[9 * 9 + 10];
while (~scanf("%s",s+1))
{
if (s[1] == 'e')break;
x.init(9 * 9 * 9, 324);
int Size = strlen(s + 1);
for (int i = 1;i <= Size;i++)
{
int row = (i - 1) / 9 + 1;
int col = (i - 1) % 9 + 1;
int grid = ((row - 1) / 3) * 3 + (col - 1) / 3 + 1;
if (s[i] == '.')
{
for (int k = 1;k <= 9;k++)
{
x.link((i - 1) * 9 + k, i);
x.link((i - 1) * 9 + k, 81 + (row - 1) * 9+k);
x.link((i - 1) * 9 + k, 81 * 2 + (col - 1) * 9+k);
x.link((i - 1) * 9 + k, 81 * 3 + (grid - 1) * 9 + k);
}
}
else
{
int temp = s[i] - '0';
x.link((i - 1) * 9 + temp, i);
x.link((i - 1) * 9 + temp, 81+(row - 1) * 9 + temp);
x.link((i - 1) * 9 + temp, 81 * 2 + (col - 1) * 9 + temp);
x.link((i - 1) * 9 + temp, 81 * 3 + (grid - 1) * 9 + temp);
}
}
x.dance(0);
x.out();
}
}