zoukankan      html  css  js  c++  java
  • 05-树8 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), 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.
    #include<cstdio>
    const int maxn = 10010;
    typedef int ElementType;
    typedef int setName;
    typedef int setType[maxn];
    
    void Initialization(setType s,int n);
    int Find(setType s,ElementType x);
    void Input_connection(setType s);
    void Check_connection(setType s);
    void Check_network(setType s,int n);
    
    int main(){
        int n;
        char in;
        setType s;
        scanf("%d
    ",&n);    
        Initialization(s,n);
        do{
            scanf("%c",&in);
            switch(in){
                case 'I':Input_connection(s);break;
                case 'C':Check_connection(s);break;
                case 'S':Check_network(s,n);break;
            }
        }while(in != 'S');
        return 0;
    }
    
    void Input_connection(setType s){
        ElementType u,v;
        scanf("%d%d",&u,&v);
        setName root1,root2;
        root1 = Find(s,u-1);
        root2 = Find(s,v-1);
        if(root1 != root2) s[root1] = root2;
    }
    
    void Initialization(setType s,int n){
        for(int i = 0; i < n; i++){
            s[i] = -1;
        }
    }
    
    void Check_connection(setType s){
        ElementType u,v;
        scanf("%d%d",&u,&v);
        setName root1 = Find(s,u-1);
        setName root2 = Find(s,v-1);
        if(root1 != root2) printf("no
    ");
        else printf("yes
    ");
    }
    
    void Check_network(setType s,int n){
        int cnt = 0;
        for(int i = 0; i < n; i++){
            if(s[i] < 0) cnt++;
        }
        if(cnt == 1) printf("The network is connected.
    ");
        else printf("There are %d components.",cnt);
    }
    
    int Find(setType s,ElementType x){
        if(s[x] < 0) return x;
        else return s[x] = Find(s,s[x]);
    }
  • 相关阅读:
    java 动态代理
    android中几个很有用的的api
    android 静态和动态设置 Receiver的 android:enabled值
    一个文件查看你选择 Run as Android applications 都干了啥
    ViewStub 的使用
    Linux 常用命令速查
    android自定义View&&简单布局&&回调方法
    西厢记 随笔
    git 命令使用速查手册( 个人版)
    Arraylist源码分析:
  • 原文地址:https://www.cnblogs.com/wanghao-boke/p/10740648.html
Copyright © 2011-2022 走看看