05-树8 File Transfer【并查集】
2017-04-02 21:57
531 查看
题目:File Transfer
题意:输入形式有3种:“I a b"代表:a,b可连通 ;“C a b”代表:查询a,b是否连通 ;“S”代表结束。输出查询是否连通即可。
思路:基本的并查集操作!
代码:
#include <cstdio>
#include <cstring>
const int maxn = 10005;
int f[maxn];
void init(int n){
for(int i=0;i<=n;i++) f[i] = i;
}
inline int find(int v){
if(f[v] != v) f[v] = find(f[v]);
return f[v];
}
inline void merge(int u,int v){
int tu = find(u);
int tv = find(v);
if(tu != tv) f[tv] = tu;
}
int main(){
int n,u,v;
char s[5];
while(scanf("%d",&n)!=EOF){
init(n);
while(scanf("%s",s) && s[0] != 'S'){
scanf("%d%d",&u,&v);
if(s[0] == 'I') merge(u,v);
else{
if(find(u) == find(v)) printf("yes\n");
else printf("no\n");
}
}
int cnt = 0;
for(int i=1;i<=n;i++){
if(f[i] == i) cnt++;
}
if(cnt > 1) printf("There are %d components.\n",cnt);
else printf("The network is connected.\n");
}
}
题意:输入形式有3种:“I a b"代表:a,b可连通 ;“C a b”代表:查询a,b是否连通 ;“S”代表结束。输出查询是否连通即可。
思路:基本的并查集操作!
代码:
#include <cstdio>
#include <cstring>
const int maxn = 10005;
int f[maxn];
void init(int n){
for(int i=0;i<=n;i++) f[i] = i;
}
inline int find(int v){
if(f[v] != v) f[v] = find(f[v]);
return f[v];
}
inline void merge(int u,int v){
int tu = find(u);
int tv = find(v);
if(tu != tv) f[tv] = tu;
}
int main(){
int n,u,v;
char s[5];
while(scanf("%d",&n)!=EOF){
init(n);
while(scanf("%s",s) && s[0] != 'S'){
scanf("%d%d",&u,&v);
if(s[0] == 'I') merge(u,v);
else{
if(find(u) == find(v)) printf("yes\n");
else printf("no\n");
}
}
int cnt = 0;
for(int i=1;i<=n;i++){
if(f[i] == i) cnt++;
}
if(cnt > 1) printf("There are %d components.\n",cnt);
else printf("The network is connected.\n");
}
}
相关文章推荐
- 05-树9 File Transfer
- PAT 04-2. File Transfer (25) (并查集)
- 05-树8 File Transfer(25 分)
- 05-树7. File Transfer (25)
- 05-树8 File Transfer(25 point(s))
- 05-树8 File Transfer(25 分)
- 05-树7. File Transfer (25)
- PAT : 05-树7. File Transfer (25)
- 05-树9 File Transfer (25分)
- PAT File Transfer(并查集)
- file transfer(文档传送程序)-并查集的应用
- 04-2. File Transfer (25)并查集
- 05-树8 File Transfer(25 分)
- 05-树8 File Transfer
- 05-树8 File Transfer
- 05-树8 File Transfer (25分)
- PAT 05-树7. File Transfer (25)
- PAT 04-2. File Transfer (并查集) (Java实现)
- 05-树8 File Transfer(25 分)
- Android File Transfer – 在 Mac 上也能读取 Android 设备文件