题目:
http://acm.hdu.edu.cn/showproblem.php?pid=3498
题意:
有
n
个敌人,其中有
思路:
DLX
重复覆盖,题很裸,很容易建图,对于第
i
个敌人,如果它和
另外重复覆盖每次删除的行变少了,意味着速度变慢了,因此需要强剪枝,用一个估价函数计算在当前状况下至少还需要多少次才能完全覆盖,加上已用的次数,和答案对比,大于等于答案就可以剪枝了
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int X = 10000 + 10, N = 100 + 10, M = 100 + 10, INF = 0x3f3f3f3f;
bool g[N][M];
int ans;
struct DLX
{
int U[X], D[X], L[X], R[X], row[X], col[X];
int H[N], S[M];
int head, sz, tot, n, m;
bool vis[M];
void init(int _n, int _m)
{
n = _n, m = _m;
for(int i = 0; i <= m; i++)
L[i] = i-1, R[i] = i+1, U[i] = D[i] = i, S[i] = 0;
head = 0, tot = 0, sz = m;
L[head] = m, R[m] = head;
for(int i = 1; i <= n; i++) H[i] = -1;
}
void link(int r, int c)
{
++S[col[++sz]=c];
row[sz] = r;
D[sz] = D[c], U[D[c]] = sz;
U[sz] = c, D[c] = sz;
if(H[r] < 0) H[r] = L[sz] = R[sz] = sz;
else R[sz] = R[H[r]], L[R[H[r]]] = sz, L[sz] = H[r], R[H[r]] = sz;
}
void del(int x)//这里的x是点编号,精确覆盖中这里是列号
{
for(int i = D[x]; i != x; i = D[i])
R[L[i]] = R[i], L[R[i]] = L[i];
}
void recover(int x)//同上
{
for(int i = U[x]; i != x; i = U[i])
R[L[i]] = L[R[i]] = i;
}
int fun_f() //估价函数,估计当前情况下最少还需要多少次才能完成覆盖,只是估计值,只会比真实次数少,从代码中可以明显看出
{
memset(vis, 0, sizeof vis);
int num = 0;
for(int i = R[head]; i != head; i = R[i])
if(! vis[i])
{
vis[i] = true;
num++;
for(int j = D[i]; j != i; j = D[j])
for(int k = R[j]; k != j; k = R[k])
vis[col[k]] = true;
}
return num;
}
void dance(int dep)
{
if(R[head] == head)
{
ans = min(ans, dep-1); return;
}
if(dep-1 + fun_f() >= ans) return ;//剪枝
int c = R[head];
for(int i = R[head]; i != head; i = R[i])
if(S[i] < S[c]) c = i;
for(int i = D[c]; i != c; i = D[i])
{
del(i);
for(int j = R[i]; j != i; j = R[j]) del(j);
dance(dep + 1);
for(int j = L[i]; j != i; j = L[j]) recover(j);
recover(i);
}
}
}dlx;
int main()
{
int n, m;
while(~ scanf("%d%d", &n, &m))
{
memset(g, 0, sizeof g);
int a, b;
for(int i = 1; i <= m; i++)
{
scanf("%d%d", &a, &b);
g[a][b] = g[b][a] = true;
}
dlx.init(n, n);
for(int i = 1; i <= n; i++) g[i][i] = true;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= n; j++)
if(g[i][j]) dlx.link(i, j);
ans = INF;
dlx.dance(1);
printf("%d\n", ans);
}
return 0;
}