题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=3498
很裸的重复覆盖题目,不过不知道别人为什么能够优化到500+ms.
Code:
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define N 64
const int V=N*N;
int U[V],D[V],R[V],L[V],C[V];
int S[N],H[N];
int size,ak;
int mark[N][N];
int hash[N];
void Remove(int c)
{
int i;
for(i=D[c];i!=c;i=D[i])
L[R[i]]=L[i],R[L[i]]=R[i];
}
void Resume(int c)
{
int i;
for(i=U[c];i!=c;i=U[i])
L[R[i]]=R[L[i]]=i;
}
int h()
{
int i,j,k,r=0;
memset(hash,0,sizeof(hash));
for(i=R[0];i;i=R[i]){
if(!hash[i]){
hash[i]=1;r++;
for(j=D[i];j!=i;j=D[j]){
for(k=R[j];k!=j;k=R[k])
hash[C[k]]=1;
}
}
}
return r;
}
void Dance(int k)
{
int min,c,i,j;
if(k+h()>=ak) return;
if(!R[0]){
if(k<ak) ak=k;
return;
}
for(min=N,i=R[0];i;i=R[i]){
if(S[i]<=min) min=S[i],c=i;
}
for(i=D[c];i!=c;i=D[i]){
Remove(i);
for(j=R[i];j!=i;j=R[j])
Remove(j);
Dance(k+1);
for(j=L[i];j!=i;j=L[j])
Resume(j);
Resume(i);
}
}
void Link(int r,int c)
{
S[c]++;C[size]=c;
U[size]=U[c];D[U[c]]=size;
D[size]=c;U[c]=size;
if(H[r]==-1)
H[r]=R[size]=L[size]=size;
else{
L[size]=L[H[r]];R[L[H[r]]]=size;
R[size]=H[r];L[H[r]]=size;
}size++;
}
int main()
{
int n,m;
int u,v;
int i,j;
while(~scanf("%d%d",&n,&m)){
for(i=0;i<=n;i++){
S[i]=0;U[i]=D[i]=i;
L[i+1]=i;R[i]=i+1;
}R[n]=0;
size=n+1;
memset(H,-1,sizeof(H));
memset(mark,0,sizeof(mark));
while(m--){
scanf("%d%d",&u,&v);
mark[u][v]=1;
mark[v][u]=1;
}
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(mark[i][j]||i==j)
Link(i,j);
}
}ak=N;Dance(0);
printf("%d\n",ak);
}
return 0;
}