uoj 79 一般图最大匹配 苏凯树

http://www.elijahqi.win/archives/3257
都奶我不会退役 说着说着竟然就要退役了
趁还有机会写代码 可能是最后的代码了吧
感谢gzez sukai sjzez xzy

#include<cstdio>
#include<cctype>
#include<vector>
#include<cstring>
#include<algorithm>
#define uint unsigned int
using namespace std;
inline char gc(){
    static char now[1<<16],*S,*T;
    if (T==S){T=(S=now)+fread(now,1,1<<16,stdin);if (T==S) return EOF;}
    return *S++;
}
inline int read(){
    int x=0,f=1;char ch=gc();
    while(!isdigit(ch)) {if (ch=='-') f=-1;ch=gc();}
    while(isdigit(ch)) x=x*10+ch-'0',ch=gc();
    return x*f;
}
const int N=600;
vector<int> son[N];int fa[N],n,m; 
bool used[N],visit[N];
inline bool dfs(int x){
    visit[x]=1;random_shuffle(son[x].begin(),son[x].end());
    for (uint i=0;i<son[x].size();++i){
        if (!used[son[x][i]]){
            fa[son[x][i]]=x;fa[x]=son[x][i];used[x]=used[son[x][i]]=1;
            return 1;
        }
    }
    for (uint i=0;i<son[x].size();++i){
        const int tar=son[x][i],match=fa[tar];
        if (visit[match]) continue;
        fa[x]=tar;fa[tar]=x;used[x]=1;used[match]=fa[match]=0;
        if (dfs(match)) return 1;
        fa[x]=used[x]=0;fa[tar]=match;fa[match]=tar;used[match]=1;
    }return 0;
}
int main(){
    freopen("uoj79.in","r",stdin);
    n=read();m=read();
    for (int i=1;i<=m;++i){
        int x=read(),y=read();
        son[x].push_back(y);son[y].push_back(x);
    }
    for(int owo=1;owo<=10;++owo){
        for (int i=1;i<=n;++i){
            if (!used[i]) memset(visit,0,sizeof(visit)),dfs(i);
        }
    }int ans=0;
    for (int i=1;i<=n;++i) ans+=used[i];
    printf("%d\n",ans>>1);
    for (int i=1;i<=n;++i) printf("%d ",fa[i]);
    return 0;
}