🎥【雨辰工作室】见见 屈辱满满 海老缚 白衬衫 肉丝 丁字裤

#include #include #include #include #include #include #include #include #include #include #include #include //q.front 访问第一个 #include #include #include using namespace std; typedef double dl; typedef long long ll; typedef long double ld;//小根堆：priority_queue<int,vector,greater> a; typedef unsigned long long ull;//大根堆：priority_queue a; const int N = 5e5+10; int du[N],n,m; int fa[N]; int findd(int x) { return fa[x]==x ? x : fa[x]=findd(fa[x]); } void mer(int x,int y) { x=findd(x),y=findd(y); if(x!=y) fa[x]=y; } void solve() { cin >> n >> m; for(int i = 1;i > x >> y; du[x]++; du[y]++; mer(x,y); } int f= 0,pre; for(int i = 1;i > T; while(T--)solve(); //fclose(stdin); //fclose(stdout); return 0; }