zoukankan      html  css  js  c++  java
  • pat04-树5. File Transfer (25)

    04-树5. File Transfer (25)

    时间限制
    150 ms
    内存限制
    65536 kB
    代码长度限制
    8000 B
    判题程序
    Standard
    作者
    CHEN, Yue

    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:
    5
    C 3 2
    I 3 2
    C 1 5
    I 4 5
    I 2 4
    C 3 5
    S
    
    Sample Output 1:
    no
    no
    yes
    There are 2 components.
    
    Sample Input 2:
    5
    C 3 2
    I 3 2
    C 1 5
    I 4 5
    I 2 4
    C 3 5
    I 1 3
    C 1 5
    S
    
    Sample Output 2:
    no
    no
    yes
    yes
    The network is connected.
    

    提交代码

    并查集

     1 #include<cstdio>
     2 #include<algorithm>
     3 #include<iostream>
     4 #include<cstring>
     5 #include<queue>
     6 #include<vector>
     7 using namespace std;
     8 int f[10005];
     9 int findfa(int a){
    10     if(f[a]!=a){
    11         f[a]=findfa(f[a]);
    12     }
    13     return f[a];
    14 }
    15 int main(){
    16     //freopen("D:\INPUT.txt","r",stdin);
    17     int n;
    18     //memset(l,-1,sizeof(l));
    19     int i,a,b,fa,fb;
    20     char c;
    21     scanf("%d",&n);
    22     for(i=1;i<=n;i++){
    23         f[i]=i;
    24     }
    25     for(i=1;;i++){
    26         cin>>c;
    27         if(c=='S'){
    28             break;
    29         }
    30         cin>>a>>b;
    31         fa=findfa(a);
    32         fb=findfa(b);
    33         if(c=='I'){
    34             if(fa!=fb){
    35                 if(fa>fb){
    36                     f[fb]=fa;
    37                 }
    38                 else{
    39                     f[fa]=fb;
    40                 }
    41             }
    42         }
    43         else{
    44             if(fa==fb){
    45                 printf("yes
    ");
    46             }
    47             else{
    48                 printf("no
    ");
    49             }
    50         }
    51     }
    52     int num=0;
    53     for(i=1;i<=n;i++){
    54         if(f[i]==i){
    55             num++;
    56         }
    57     }
    58     if(num==1){
    59         printf("The network is connected.
    ");
    60     }
    61     else{
    62         printf("There are %d components.
    ",num);
    63     }
    64     return 0;
    65 }
  • 相关阅读:
    IE window对象跨域的一些特性
    杭州归来
    网上流行的JS HTMLDecode不安全
    看到的一点进步
    开春第一趟单骑上妙峰
    把JS函数转URL形式
    firebug也支持debugger关键字了
    发现一篇关于flash垃圾回收机制的文章
    Java 内存分析图
    继承中多态的灵活使用及其分析图 第一个程序的升级版
  • 原文地址:https://www.cnblogs.com/Deribs4/p/4733506.html
Copyright © 2011-2022 走看看