04-树5. File Transfer (25)
来源:互联网 发布:g900 鼠标垫 知乎 编辑:程序博客网 时间:2024/06/16 23:43
04-树5. File Transfer (25)
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 N (2<=N<=104), the total number of computers in a network. Each computer in the network is then represented by a positive integer between 1 and N. 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 5SSample 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 5SSample Output 2:
nonoyesyesThe network is connected.
#include <stdio.h>#include <stdlib.h>int findSet(int *set, int val) {//返回所在树的根节点while (set[val] >= 0) {val = set[val];}return val;}void unionSet(int *set, int c1, int c2) {//按大小求并int root1 = findSet(set, c1);int root2 = findSet(set, c2);if (set[root1] < set[root2]) {//树1更大,将树2连接到树1根节点set[root1] += set[root2];set[root2] = root1;}else {set[root2] += set[root1];set[root1] = root2;}}int main() {//freopen("test.txt", "r", stdin);int n;scanf("%d", &n);int *set = (int *)malloc(sizeof(int) * (n + 1));for (int i = 0; i <= n; ++i) {//初始化树大小,根节点负值,其绝对值表示树大小set[i] = -1;}char ch;scanf("\n%c", &ch);while (ch != 'S') {int c1, c2;scanf("%d%d", &c1, &c2);if (ch == 'I') {unionSet(set, c1, c2);//c1,c2所在集合求并}else if(ch == 'C') {if (findSet(set, c1) == findSet(set, c2)) {printf("yes\n");}else {printf("no\n");}}scanf("\n%c", &ch);}int cnt = 0;for (int i = 1; i <= n; ++i) {//计算根节点个数if (set[i] < 0) {++cnt;}}if (cnt == 1) {printf("The network is connected.\n");}else {printf("There are %d components.\n", cnt);}free(set);return 0;}
- 04-树5. File Transfer (25)
- 04-树5. File Transfer (25)
- 04-树5. File Transfer (25)
- 04-树5. File Transfer
- PAT 数据结构 04-树5. File Transfer (25)
- 05-树7. File Transfer (25)
- 05-树7. File Transfer (25)
- PAT 05-树7. File Transfer (25)
- 05-树8 File Transfer (25分)
- 05-树8 File Transfer (25分)
- 05-树9 File Transfer (25分)
- 05-树9 File Transfer (25分)
- 05-树9 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分)
- Android Asynchronous Http Client 中文教程
- ios7关于图片资源使用需要注意的问题
- 数组指针和指针数组的区别
- java学习笔记(三) FileStream
- hdojHPU-ACM大一暑期培训练习题1-2 1005月之数
- 04-树5. File Transfer (25)
- xcode使用
- 安卓照相加水印
- shell脚本:shell的基本元素-1 命令与参数
- 黑马程序员—— 7,内部类
- UI5的语言问题
- Android开发之SoundPool使用详解
- U-BOOT的两个阶段启动过程与第二阶段的board_init_f和board_init_r
- 在cmd中运行java程序