洛谷P1330封锁阳光大学

一道非常好的二分图染色模板题

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#define For(i,j,k) for(int i=j;i<=k;i++)
using namespace std;
const int N=200000+5;
struct node{
	int next;
	int to;
	}a[N];
int cnt,h[N];
void addvage(int x,int y){
	cnt++;a[cnt].to=y;a[cnt].next=h[x];h[x]=cnt;
}
inline int read(){
	char c=getchar();
	while(c<'0'||c>'9')c=getchar();
	int x=c-'0';
	c=getchar();
	while(c<='9'&&c>='0'){x=x*10+c-'0';c=getchar();}
	return x;
	}
int n,m;
int v[N],colour[N],sum[2];
void dfs(int x){
	for(int i=h[x];i;i=a[i].next){
		int y=a[i].to;
		if(!v[y]){v[y]=1;colour[y]=!colour[x];sum[!colour[x]]++;dfs(y);}
		else if(colour[x]==colour[y]){puts("Impossible");exit(0);}
		}
	}
int ans=0;
int main(){
	n=read();m=read();
	int x,y;
	For(i,1,m){
		x=read();y=read();
		addvage(x,y);
		addvage(y,x);
	}
	memset(colour,-1,sizeof(colour));
    For(i,1,n)
	if(!v[i]){
		colour[i]=0;
		sum[0]=1;sum[1]=0;
		v[i]=1;
		dfs(i);
		ans+=min(sum[0],sum[1]);
	}
	cout<<ans;
	return 0;
}