qq_33106167的博客

带花树博弈 #include<bits/stdc++.h> using namespace std;const int N=6e2+7,M=N*N;char s[N]; struct data{int to,next;}e[M<<1];int head[N],cnt,ban[N],pre[N],match[N],fa[N],q[N],t,w,x,y,z,vis[N],tim,dfn[N],n,m,i,j,ans; int find(int x){return x==fa[x]?x:f