带花树模板

背下来就好了。。。。

#include <queue>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define rep(i,a) for(int i=lst[a];i;i=nxt[i])
using namespace std;

const int N=505,M=N*N;

int t[M],nxt[M],lst[N],l;
void add(int x,int y) {t[++l]=y;nxt[l]=lst[x];lst[x]=l;}

int n,m,fa[N],match[N],vis[N],pre[N],mark[N],id;
queue<int> q;

int get(int x) {return fa[x]!=x?fa[x]=get(fa[x]):x;}

int lca(int x,int y) {
	id++;x=get(x);y=get(y);
	while (vis[x]!=id) {
		vis[x]=id;
		x=get(pre[match[x]]);
		if (y) swap(x,y);
	}
	return x;
}

void merge(int x,int y) {fa[get(x)]=get(y);}

void flower(int x,int r) {
	for(;x!=r;) {
		int y=match[x],z=pre[y];
		if (get(z)!=r) pre[z]=y;
		if (mark[y]==2) q.push(y);mark[y]=1;
		if (mark[z]==2) q.push(z);mark[z]=1;
		merge(x,y);merge(y,z);
		x=z;
	}
}

bool find(int S) {
	fo(i,1,n) fa[i]=i,pre[i]=mark[i]=0;
	while (!q.empty()) q.pop();
	q.push(S);mark[S]=1;
	while (!q.empty()) {
		int x=q.front();q.pop();
		rep(i,x) {
			int y=t[i];
			if (get(y)==get(x)) continue;
			if (mark[y]==2) continue;
			if (!mark[y]) {
				mark[y]=2;pre[y]=x;
				if (!match[y]) {
					for(int z=y,tmp;z;z=tmp) tmp=match[pre[z]],match[z]=pre[z],match[pre[z]]=z;
					return 1;
				}
				mark[match[y]]=1;
				q.push(match[y]);
			} else {
				int z=lca(x,y);
				if (get(x)!=z) pre[x]=y;
				if (get(y)!=z) pre[y]=x;
				flower(x,z);
				flower(y,z);
			}
		}
	}
	return 0;
}

int main() {
	scanf("%d%d",&n,&m);
	fo(i,1,m) {
		int x,y;
		scanf("%d%d",&x,&y);
		add(x,y);add(y,x);
	}
	int ans=0;
	fo(i,1,n) if (!match[i]) ans+=find(i);
	printf("%d\n",ans);
	fo(i,1,n) printf("%d ",match[i]);
	return 0;
}