bettle_king的博客

https://www.acwing.com/problem/content/1148/ #include<bits/stdc++.h> using namespace std; struct node{int a,b,c;}; bool cmp(node a,node b) {return a.c<b.c;} const int N=1e3+10; int a[N],p[N],n,c; vector<node>ve; int find(int x) { if(x!=.

https://www.acwing.com/problem/content/description/1146/ #include<bits/stdc++.h> using namespace std; const int N=1e6+10; int p[N],n,m; int x,y,xx,yy; struct node{int a,b,c;}; bool cmp(node a,node b) {return a.c<b.c;} vector<node>ve; int fi.

https://www.acwing.com/problem/content/1145/ #include<bits/stdc++.h> using namespace std; const int N=1e5+10; struct node{int a,b,c;}; bool cmp(node a,node b) {return a.c<b.c;} vector<node>ve1,ve2; int p[N],n,m; int find(int x) { if(x!=.

https://www.acwing.com/problem/content/1144/ #include<bits/stdc++.h> using namespace std; const int N=1e3+10; struct node{int a,b,c;}; bool cmp(node a,node b) {return a.c<b.c;} int p[N],n,m,cnt,ans; vector<node>ve; int find(int x) { if(.

https://www.luogu.com.cn/problem/P3366 #include<bits/stdc++.h> using namespace std; const int N=1e4+10; int p[N],n,m; struct node{int a,b,c;}; bool cmp(node a,node b){return a.c<b.c;} vector<node>ve; int find(int x) { if(x!=p[x]) p[x]=fin.

https://www.acwing.com/problem/content/description/1143/ 求这个图的每个联通块内，求一颗最小生成树，相当于求原图的"最小生成深林" #include<bits/stdc++.h> using namespace std; const int N=210; int n,m,sum; int p[N]; struct node{int a,b,c;}; bool cmp(node a,node b) {return a.c<b.c;} .

https://www.acwing.com/problem/content/1142/ 克鲁斯卡尔算法 #include<bits/stdc++.h> using namespace std; const int N=110; int a[N][N],n,p[N]; struct node{int a,b,c;}; bool cmp(node a,node b) {return a.c<b.c;} vector<node>ve; int find(int x) { .