zoukankan      html  css  js  c++  java
  • 7-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 <stdio.h>
    int n,f[10010],c1,c2;
    char op[2];
    void init() {
        for(int i = 1;i <= n;i ++) {
            f[i] = i;
        }
    }
    int getf(int k) {
        if(f[k] == k) return f[k];
        return f[k] = getf(f[k]);
    }
    void merge(int a,int b) {
        int aa = getf(a),bb = getf(b);
        f[aa] = bb;
    }
    int main() {
        scanf("%d",&n);
        init();
        while(scanf("%s",op) && op[0] != 'S') {
            scanf("%d%d",&c1,&c2);
            if(op[0] == 'I') merge(c1,c2);
            else printf("%s
    ",getf(c1) == getf(c2) ? "yes" : "no");
        }
        int c = 0;
        for(int i = 1;i <= n;i ++) {
            if(getf(i) == i) c ++;
        }
        if(c == 1) printf("The network is connected.");
        else printf("There are %d components.",c);
    }
  • 相关阅读:
    (4)路由器和交换机区别
    (3)arp协议
    (2)OSi模型
    (1)网络基础概念
    探索JVM底层奥秘ClassLoader源码分析
    数据库类型对应Java语言类型表
    JSON空值处理与 StringUtils工具类使用
    props、state、forms
    React官方中文文档【安装】
    搭建React项目环境【1】
  • 原文地址:https://www.cnblogs.com/8023spz/p/12259626.html
Copyright © 2011-2022 走看看