HbFS-

模板#include <iostream>#include <cstdio>#include <cstring>#include <vector>#define N 2500using namespace std;int fa[N],t,n,m;bool g[N][N];int gf(int x) { return fa[x] == x ? x : fa[x] = gf(fa[x]); }

诶解法真巧 将一个篮子拆成三个点，且互相联通 对于所有的球x能放到篮子y，把球x向三个篮子拆的点连边若一个篮子里放进来的球数小于等于1，那么篮内部也会有一条匹配边#include <iostream>#include <cstdio>#include <cstring>#include <vector>#define N 2500using namespace std;int fa[N],