zoukankan      html  css  js  c++  java
  • PAT 甲级 1013 Battle Over Cities

    https://pintia.cn/problem-sets/994805342720868352/problems/994805500414115840

    It is vitally important to have all the cities connected by highways in a war. If a city is occupied by the enemy, all the highways from/toward that city are closed. We must know immediately if we need to repair any other highways to keep the rest of the cities connected. Given the map of cities which have all the remaining highways marked, you are supposed to tell the number of highways need to be repaired, quickly.

    For example, if we have 3 cities and 2 highways connecting city1​​-city2​​ and city1​​-city3​​. Then if city1​​ is occupied by the enemy, we must have 1 highway repaired, that is the highway city2​​-city3​​.

    Input Specification:

    Each input file contains one test case. Each case starts with a line containing 3 numbers N (<), M and K, which are the total number of cities, the number of remaining highways, and the number of cities to be checked, respectively. Then M lines follow, each describes a highway by 2 integers, which are the numbers of the cities the highway connects. The cities are numbered from 1 to N. Finally there is a line containing K numbers, which represent the cities we concern.

    Output Specification:

    For each of the K cities, output in a line the number of highways need to be repaired if that city is lost.

    Sample Input:

    3 2 3
    1 2
    1 3
    1 2 3
    

    Sample Output:

    1
    0
    0

    代码:

    #include <bits/stdc++.h>
    using namespace std;
    
    int N, M, K;
    int mp[1010][1010];
    int vis[1010];
    
    void dfs(int t) {
        vis[t] = 1;
        for(int i = 1; i <= N; i ++) {
            if(vis[i] == 0 && mp[i][t] == 1)
                dfs(i);
        }
    }
    
    int main() {
        memset(mp, 0, sizeof(mp));
        scanf("%d%d%d", &N, &M, &K);
        for(int i = 1; i <= M; i ++) {
            int st, en;
            scanf("%d%d", &st, &en);
            mp[en][st] = mp[st][en] = 1;
        }
    
        int ans = 0;
        for(int i = 1; i <= K; i ++) {
            int x;
            int num = 0;
            scanf("%d", &x);
            memset(vis, 0, sizeof(vis));
            vis[x] = 1;
            for(int j = 1; j <= N; j ++) {
                if(vis[j] == 0) {
                    dfs(j);
                    num ++;
                }
            }
            printf("%d
    ", num - 1);
        }
        return 0;
    }
    

      

  • 相关阅读:
    黑盒测试和白盒测试的区别
    alpha测试和beta测试的区别
    selenium退出语句区别
    QTP8.2--安装流程
    Xshell无法连接Linux虚拟机问题
    Linux-----centos6.2---安装Linux的流程
    MySql错误处理--错误代码和消息
    基于Linux系统--web环境搭建
    前端底层-作用域 this 原型笔试题练习
    前端底层-冒泡与捕获
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9841829.html
Copyright © 2011-2022 走看看