NOIP 模拟赛 染色

MZOJ

先跑一遍$Krusal$，得出最小值，在考虑将矩形染色

而由于矩形的个数很小，我们可以考虑用状压的方式$0/1$枚举当前这个矩形染还是不染色，然后再来跑$Krusal$或者$Prime$

直接上代码：

#include<bits/stdc++.h>
#define rep(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
using namespace std;
const int maxn=6e6+10;
const int maxm=3e3+10;
int m,n,ans=INT_MAX;
int x[maxn],y[maxn];
vector<int> v[maxm];

template <class t> inline void read(t &x) {
	x=0;char ch=getchar();int f=1;
	while(!isdigit(ch)){if(ch=='-') f=-1;ch=getchar();}
	while(isdigit(ch)){x=10*x+ch-'0';ch=getchar();}
	x*=f;
}

int sum=0,cnt=0,fa[maxn],c[maxn],k[maxn];

struct node{
	int v,u,w;
	bool friend operator < (const node &A,const node &B) {
		return A.w<B.w;
	}
}e[maxn];
	
int get_dis(int i,int j) {
	return (x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
}
	
inline int find(int x) {
	if(fa[x]==x) return x;
	else return fa[x]=find(fa[x]);
}
	
int Krusal(int flag,int sum,int k) {
	rep(i,1,cnt) {
		int fx=find(e[i].u),fy=find(e[i].v),w=e[i].w;
		if(k==n-1) break;
		if(fx==fy) continue;
		fa[fx]=fy;
		k++;
		if(flag) e[k].u=e[i].u,e[k].v=e[i].v,e[k].w=e[i].w;
		sum+=w;
	}
	return sum;
}

void readdata() {
	read(n);read(m);
	rep(i,1,n) {
		read(x[i]);
		read(y[i]);
	}
	rep(i,1,m) {
		read(k[i]),read(c[i]);
		rep(j,1,k[i]) {int x;read(x);v[i].push_back(x);}
	}
}
	
void work() {
	rep(i,1,n) fa[i]=i;
	rep(i,1,n)
	 rep(j,1,n) {
	 	if(i==j) continue;
	 	e[++cnt].u=i;
	 	e[cnt].v=j;
	 	e[cnt].w=get_dis(i,j);
	}
	sort(e+1,e+1+cnt);
	ans=min(ans,Krusal(true,0,0));cnt=n-1;
	/*printf("%d\n",sum);
	system("pause\n");*/
	rep(s,0,(1<<m)) {
		rep(i,1,n) fa[i]=i;
		int cost=0,tot=0;
		rep(i,1,m)
		 if(s&(1<<(i-1))) {
		 	cost+=c[i];
		 	rep(j,0,k[i]-2) {
		 		int a1=v[i][j],a2=v[i][j+1];
		 		int x=find(v[i][j]),y=find(v[i][j+1]);
		 		if(x!=y) fa[x]=y,++tot;
			}
		 }
		ans=min(ans,Krusal(false,cost,tot));
	}
	printf("%d\n",ans);
}

int main() {
	//freopen("input.txt","r",stdin);
	//freopen("graph.out","w",stdout);
	readdata();
	work();
	return 0;
}