舞蹈链有两种模型,精确覆盖,多重覆盖。
精确覆盖
HUST 1017
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <queue>
//#include <tr1/unordered_set>
#include <tr1/unordered_map>
#include <bitset>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define inf 1e9
#define debug(a) cout << #a" = " << (a) << endl;
#define debugarry(a, n) for (int i = 0; i < (n); i++) { cout << #a"[" << i << "] = " << (a)[i] << endl; }
#define clr(x, y) memset(x, y, sizeof x)
#define ll long long
#define ull unsigned long long
#define FOR(i,a,b) \
for(i=a;a<b?i<=b:i>=b;a<b?i++:i--)
const int maxn = 1000*100*2+30;
struct sad{
int L[maxn],R[maxn],U[maxn],D[maxn];
int Row[maxn],Col[maxn];
int h[maxn],s[maxn];
int si;
vector<int>ans;
void init(int m)
{
for(int i=0;i<=m;i++)
{
U[i] = D[i] = i;
L[i] = i-1;
R[i] = i+1;
s[i] = 0;
}
L[0] = m;
R[m] = 0;
clr(h,-1);
si = m;
ans.clear();
}
void link(int row,int col)
{
si++;
Col[si] = col; Row[si] = row;
s[col]++;
U[si] = U[col]; D[si] = col;
D[U[col]] = si;
U[col] = si;
if(h[row] != -1)
{
R[si] = h[row];
L[si] = L[h[row]];
R[L[si]] = si;
L[R[si]] = si;
}
else
h[row] = L[si] = R[si] = si;
}
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]){
U[D[j]] = j;
D[U[j]] = j;
s[Col[j]]++;
}
}
R[L[c]] = c;
L[R[c]] = c;
}
bool dfs(){
if( R[0] == 0 )
return true;
int c = 0;
for(int i=R[0];i!=0;i=R[i])
{
if(!c||s[c]>s[i])
c=i;
}
Remove(c);
for(int i=D[c];i!=c;i=D[i])
{
ans.push_back(Row[i]);
for(int j=R[i];j!=i;j=R[j])
Remove(Col[j]);
if(dfs()) return true;
for(int j=L[i];j!=i;j=L[j])
Resume(Col[j]);
ans.pop_back();
}
Resume(c);
return false;
}
}dlx;
int main()
{
// freopen("input.txt","r",stdin);
int n,m;
while(~scanf("%d%d",&n,&m))
{
dlx.init(m);
int a,b;
for(int i=1;i<=n;i++)
{
scanf("%d",&a);
while(a--)
{
scanf("%d",&b);
dlx.link(i,b);
}
}
if( dlx.dfs() )
{
vector<int> ans = dlx.ans;
sort(ans.begin(),ans.end());
printf("%d",ans.size());
for(int i=0;i<ans.size();i++)
printf(" %d",ans[i]);
printf("\n");
}
else printf("NO\n");
}
return 0;
}
ZOJ 3209
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <queue>
//#include <tr1/unordered_set>
#include <tr1/unordered_map>
#include <bitset>
//#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define inf 1e9
#define debug(a) cout << #a" = " << (a) << endl;
#define debugarry(a, n) for (int i = 0; i < (n); i++) { cout << #a"[" << i << "] = " << (a)[i] << endl; }
#define clr(x, y) memset(x, y, sizeof x)
#define ll long long
#define ull unsigned long long
#define FOR(i,a,b) \
for(i=a;a<b?i<=b:i>=b;a<b?i++:i--)
const int maxn = 30*30*500*2+30;
struct sad
{
int L[maxn] , R[maxn] , U[maxn] , D[maxn];
int Row[maxn] , Col[maxn];
int h[maxn] , s[maxn];
int si;
int ans;
void init(int m)
{
for(int i=0;i<=m;i++)
{
U[i] = D[i] = i;
L[i] = i-1;
R[i] = i+1;
s[i] = 0;
}
L[0] = m;
R[m] = 0;
clr(h,-1);
si=m;
ans=inf;
}
void link(int row,int col)
{
si++;
if( si >= maxn ) while(1);
Col[si] = col;
Row[si] = row;
s[col]++;
U[si] = U[col];
D[si] = col;
D[U[col]] = si;
U[col] = si;
if(h[row]!=-1)
{
R[si] = h[row];
L[si] = L[h[row]];
R[L[si]] = si;
L[R[si]] = si;
}else
h[row] = L[si] = R[si] = si;
}
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]){
U[D[j]] = j;
D[U[j]] = j;
s[Col[j]]++;
}
}
R[L[c]] = c;
L[R[c]] = c;
}
void dfs(int cnt)
{
if(cnt >= ans) return ;
if( R[0] == 0 )
{
ans = min(ans,cnt);
return ;
}
int c=R[0];
for(int i=R[0];i!=0;i=R[i])
if(s[c]>s[i])
c=i;
Remove(c);
for(int i=D[c];i!=c;i=D[i]){
for(int j=R[i];j!=i;j=R[j])
Remove(Col[j]);
dfs(cnt+1);
for(int j=L[i];j!=i;j=L[j])
Resume(Col[j]);
}
Resume(c);
}
}dlx;
///#define FOR(i,c,R) for(int i=c;i!=c;i=R[i])
int id[100][100];
int main()
{
// freopen("input.txt","r",stdin);
int T;
scanf("%d",&T);
while(T--)
{
int n,m,p;
scanf("%d%d%d",&n,&m,&p);
int si=0;
for(int i=0;i<n;i++)
for(int j=0;j<m;j++)
id[i][j]=++si;
dlx.init(si);
// debug(si);
int a,b,c,d;
for(int x=1;x<=p;x++)
{
scanf("%d%d%d%d",&a,&b,&c,&d);
for(int i=a;i<c;i++)
for(int j=b;j<d;j++)
dlx.link(x,id[i][j]);
}
dlx.dfs(0);
if( dlx.ans == inf )
printf("-1\n");
else printf("%d\n",dlx.ans);
}
return 0;
}
POJ 3074
数独问题有一点需要注意,限制条件有四个,不是三个。分别是行,列,块,还有就是每个点只能放一个颜色。
#include <cstdio>
#include <cstring>
#include <iostream>