xxayt的博客

图的遍历P2661 信息传递//查找有向图最小环#include<bits/stdc++.h>#define rep(i, a, b) for(int i = (a); i <= (b); i++)#define per(i, a, b) for(int i = (a); i >= (b); i--)#define ll long long#define db double#define PII pair<int, int>#define pi acos

并查集普通并查集查找+路径压缩int find(int x){ if(pre[x] == x) return x; return pre[x] = find(pre[x]);}合并void Union(int x, int y){ int fx = find(x), fy = find(y); if(fx != fy) pre[fx] = fy;}例题：P3367【模板】并查集#include<bits/stdc++.h>#defin