![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
并查集
123~mutouren
这个作者很懒,什么都没留下…
展开
-
hdu 1272 小希的迷宫
链接#include<bits/stdc++.h>using namespace std;#define MXN 100010int n,m,fa[MXN], flag;int find(int r){ if(r != fa[r]) fa[r] = find(fa[r]); return fa[r];}void merge(int x, int y){ int t1 = find(x); int t2 = find(y); if(t1!=t2) fa[t1] = t2;转载 2021-05-13 20:18:43 · 60 阅读 · 0 评论 -
hdu 1879 继续畅通工程
#include<bits/stdc++.h>using namespace std;#define MXN 110#define MXM 5050struct T{ int a,b,c,d;}t[MXM];int fa[MXN],ans = 0;bool cmp(T t1,T t2){ return t1.c<t2.c;}int find(int r) { if(r!=fa[r]) fa[r] = find(fa[r]); return fa[r];原创 2021-05-11 20:46:10 · 73 阅读 · 0 评论 -
hdu 1863 畅通工程
#include<bits/stdc++.h>using namespace std;#define MXN 110#define MXM 5050struct T{ int x,y,c;}t[MXM];int f[MXN],n,m,ans;bool cmp (T t1,T t2){ return t1.c<t2.c;}int find(int r){ if(r!=f[r]) f[r] = find(f[r]); return f[r];}void mer原创 2021-05-11 19:50:03 · 64 阅读 · 0 评论 -
hdu 1233 还是畅通工程
#include<bits/stdc++.h>using namespace std;#define MXN 110#define MXM 110*55int N, fa[MXN], ans;struct T{ int a, b, c;}t[MXM];bool cmp(T t1,T t2){ return t1.c<t2.c;}int find(int r){ if(r != fa[r]) fa[r] = find(fa[r]); return fa[r];}原创 2021-05-10 22:40:05 · 60 阅读 · 0 评论 -
hdu 1232 畅通工程
#include<bits/stdc++.h>using namespace std;#define MXN 1010int fa[MXN];int find(int r){ if(r!=fa[r]) fa[r] = find(fa[r]); return fa[r];}void merge(int a,int b){ int t1 = find(a); int t2 = find(b); if(t1!=t2) fa[t1]=t2;}int main (){ i原创 2021-05-10 19:18:57 · 60 阅读 · 0 评论