题意:
题意就是让你选最少的步数是的每个点至少被覆盖一次,多重覆盖模板题。
蛋疼的是,我把评估函数的辅助数组开大了,结果T的我不要不要的。
看懂只好还是比较好做的。
多重覆盖和精确覆盖的区别就是多重覆盖在删除的时候只删除列。
因为行是决策,列是条件,当你选择一个决策时,其他的也会覆盖住这个。
代码:
//
// Created by CQU_CST_WuErli
// Copyright (c) 2016 CQU_CST_WuErli. All rights reserved.
//
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <algorithm>
#include <sstream>
#include <assert.h>
#define CLR(x) memset(x,0,sizeof(x))
#define OFF(x) memset(x,-1,sizeof(x))
#define MEM(x,a) memset((x),(a),sizeof(x))
#define BUG cout << "I am here" << endl
#define lookln(x) cout << #x << "=" << x << endl
#define SI(a) scanf("%d",&a)
#define SII(a,b) scanf("%d%d",&a,&b)
#define SIII(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define rep(flag,start,end) for(int flag=start;flag<=end;flag++)
#define Rep(flag,start,end) for(int flag=start;flag>=end;flag--)
#define Lson l,mid,rt<<1
#define Rson mid+1,r,rt<<1|1
#define Root 1,n,1
#define BigInteger bign
const int MAX_L=2005;// For BigInteger
const int INF_INT=0x3f3f3f3f;
const long long INF_LL=0x7fffffff;
const int MOD=1e9+7;
const double eps=1e-9;
const double pi=acos(-1);
typedef long long ll;
using namespace std;
const int N=100;
int n,m;
int mp[N][N];
struct P {
int right,left,down,up;
int size;
int x,y;
};
struct DLX {
const static int maxn=10000; // 节点总数
P p[maxn];
int size; // 节点标记
int head[100]; // 行标指针
int vis[100];
stack<int> Ans;
int ans;
void init(int m) {
for (int i=0;i<=m;i++) {
p[i].up=p[i].down=i;
p[i].left=i-1;p[i].right=i+1;
p[i].size=0;
}
p[0].left=m;p[m].right=0;
OFF(head);
size=m+1;
ans=-1;
while (Ans.size()) Ans.pop();
}
void link(int row,int col) {
p[size].x=row;p[size].y=col;p[col].size++;
p[size].up=p[col].up;p[size].down=col;
p[p[col].up].down=size;p[col].up=size;
if (head[row]<0) head[row]=p[size].left=p[size].right=size;
else {
p[size].right=head[row];p[size].left=p[head[row]].left;
p[p[size].left].right=size;p[p[size].right].left=size;
}
size++;
}
void del(int c) {
for (int i=p[c].down;i!=c;i=p[i].down) {
p[p[i].right].left=p[i].left;
p[p[i].left].right=p[i].right;
}
}
void rec(int c) {
for (int i=p[c].up;i!=c;i=p[i].up) {
p[p[i].right].left=i;
p[p[i].left].right=i;
}
}
int h() {
int ret=0;
CLR(vis);
for (int i=p[0].right;i!=0;i=p[i].right) if (!vis[i]) {
ret++;vis[i]=1;
for (int j=p[i].down;j!=i;j=p[j].down)
for (int k=p[j].right;k!=j;k=p[k].right)
vis[p[k].y]=1;
}
return ret;
}
void DFS(int cnt) {
if (p[0].right==0) ans=min(ans,cnt);
else if (h()+cnt<ans) {
int c=0;
int Min=INF_INT;
for (int i=p[0].right;i!=0;i=p[i].right){
if (p[i].size<Min) Min=p[i].size,c=i;
}
// lookln(c);
for (int i=p[c].down;i!=c;i=p[i].down) {
del(i);
for (int j=p[i].right;j!=i;j=p[j].right) del(j);
DFS(cnt+1);
// BUG;
for (int j=p[i].left;j!=i;j=p[j].left) rec(j);
rec(i);
}
}
return;
}
}dlx;
/*
0 1 2 3 4 5 6
1 1 1 1 0 0
1 1 0 0 0 0
1 0 1 0 0 0
1 0 0 1 1 0
0 0 0 1 1 0
0 0 0 0 0 1
*/
int main(int argc, char const *argv[]) {
#ifdef LOCAL
freopen("C:\\Users\\john\\Desktop\\in.txt","r",stdin);
// freopen("C:\\Users\\john\\Desktop\\out.txt","w",stdout);
#endif
while(SII(n,m)==2) {
dlx.init(n);
CLR(mp);
rep(i,1,m) {
int u,v;
scanf("%d%d",&u,&v);
mp[u][v]=mp[v][u]=1;
}
rep(i,1,n) {
mp[i][i]=1;
rep(j,1,n) if (mp[i][j]) dlx.link(i,j);
}
dlx.ans=INF_INT;
dlx.DFS(0);
cout << dlx.ans << endl;
}
return 0;
}