5-8 File Transfer (25分) (简单的并查集, 注意getchar())
来源:互联网 发布:无线蓝牙耳机推荐 知乎 编辑:程序博客网 时间:2024/05/18 19:45
题目地址:
https://pta.patest.cn/pta/test/16/exam/4/question/670
题目描述
We have a network of computers and a list of bi-directional connections. Each of these connections allows a file transfer from one computer to another. Is it possible to send a file from any computer on the network to any other?
Input Specification:
Each input file contains one test case. For each test case, the first line contains NN (2\le N\le 10^42≤N≤10
4
), the total number of computers in a network. Each computer in the network is then represented by a positive integer between 1 and NN. Then in the following lines, the input is given in the format:
I c1 c2
where I stands for inputting a connection between c1 and c2; or
C c1 c2
where C stands for checking if it is possible to transfer files between c1 and c2; or
S
where S stands for stopping this case.
Output Specification:
For each C case, print in one line the word “yes” or “no” if it is possible or impossible to transfer files between c1 and c2, respectively. At the end of each case, print in one line “The network is connected.” if there is a path between any pair of computers; or “There are k components.” where k is the number of connected components in this network.
Sample Input 1:
5C 3 2I 3 2C 1 5I 4 5I 2 4C 3 5S
Sample Output 1:
nonoyesThere are 2 components.
Sample Input 2:
5C 3 2I 3 2C 1 5I 4 5I 2 4C 3 5I 1 3C 1 5S
Sample Output 2:
nonoyesyesThe network is connected.
ac注意
主要是并查集 find和 merge函数
int find(int x){ if (x == father[x]) return x; // 这里是 find(father[x]) 而不是 find(x) return father[x] = find(father[x]); }void merge(int x ,int y){ father[find(y)] = find(x);}
/*并查集 和 set<>*/#include <cstdio> #include <sstream> #include <cstring> #include <iostream>#include <string>#include <vector>#include <queue>#include <algorithm>#include <sstream>#include <cmath>#include <set>#include <stack>using namespace std;#define N 10001int n;int father[N];int find(int x){ if (x == father[x]) return x; return father[x] = find(father[x]);}void merge(int x ,int y){ father[find(y)] = find(x);}int main(){ //freopen("in", "r", stdin); scanf("%d\n", &n); char c ='C'; int tmp1, tmp2; int i; for (i = 1; i <= n; i++) { father[i] = i; } while (c != 'S') { scanf("%c", &c); if (c == 'I') { scanf("%d%d\n", &tmp1, &tmp2); if (find(tmp1) != find(tmp2)) merge(tmp1, tmp2); } else if (c == 'C') { scanf("%d%d\n", &tmp1, &tmp2); if (find(tmp1) != find(tmp2)) { printf("no"); } else{ printf("yes"); } printf("\n"); } else { break; } } set<int> sset; for (i = 1; i <= n; i++) { sset.insert(find(i)); } int len = sset.size(); if (len == 1) { printf("The network is connected.\n"); } else{ printf("There are %d components.\n",len); } return 0;}
- 5-8 File Transfer (25分) (简单的并查集, 注意getchar())
- 05-树8 File Transfer (25分)---并查集
- 并查集 File Transfer
- 5-8 File Transfer (25分)
- file transfer(文档传送程序)-并查集的应用
- 04-2. File Transfer (25)并查集
- PAT 04-2. File Transfer (25) (并查集)
- 05-树8 File Transfer【并查集】
- 并查集-05-树8 File Transfer
- PAT File Transfer(并查集)
- 05-树8 File Transfer (25分)
- 05-树8 File Transfer (25分)
- 05-树8 File Transfer (25分)
- 05-树8 File Transfer (25分)
- 05-树8 File Transfer (25分)
- 05-树8 File Transfer (25分)
- 05-树8 File Transfer (25分)
- 5-1 File Transfer (25分)
- Unity3d NGUI Button 简单地动态修改颜色
- Permission denied: user=Administrator, access=WRITE
- navigationItem.rightBarButtonItem 设置背景图片,颜色更改解决办法
- UITextField详解
- ios 应用 跳转App Store 评论 评分
- 5-8 File Transfer (25分) (简单的并查集, 注意getchar())
- php中 自己写的各种实用正则表达式-实时更新 2015-08-21 15:30:43
- Constructor injection type ambiguities in Spring
- 转载:epoll经验谈
- swift string extension
- js new一个函数和直接调用函数的区别
- Android SDK在线更新镜像服务器无需翻墙
- ImageLoader配置详解
- 严重: Exception loading sessions from persistent storage