PAT--1013 Battle Over Cities (25 分)

最新推荐文章于 2022-03-09 22:05:31 发布

jackson_j

最新推荐文章于 2022-03-09 22:05:31 发布

阅读量137

点赞数

分类专栏：练习--PAT

本文链接：https://blog.csdn.net/jackson_j/article/details/100149001

版权

练习--PAT 专栏收录该内容

38 篇文章 0 订阅

订阅专栏

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 (<1000), 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:

Sample Output:

1
0
0

#include <iostream>
#include <bits/stdc++.h>
#include <cstdio>
using namespace std;
const int maxn = 1100;

int G[maxn][maxn];
int n,m,k;
bool visit[maxn];

void DFS(int u)
{
    visit[u] = true;
    for(int v=1; v<=n; v++)
    {
        if(visit[v]==false && G[u][v]==1)
        {
            DFS(v);
        }
    }
}
int main()
{
    scanf("%d %d %d",&n,&m,&k);

    //memset(G,0,sizeof(G));
    //fill(G[0],G[0]+maxn*maxn,0);
    int a,b;
    for(int i=1; i<=m; i++)
    {
        scanf("%d %d",&a,&b);
        G[a][b] = 1;
        G[b][a] = 1;
    }

    int vode;
    for(int i=0; i<k; i++)
    {
        fill(visit,visit+1000,false);
        scanf("%d",&vode);

        visit[vode]= true;
        int counts = 0;
        for(int j=1; j<=n; j++)
        {
            if(visit[j]==false)
            {
                DFS(j);
                counts++;
            }

        }

        printf("%d\n",counts-1);

    }
    //cout << "Hello world!" << endl;
    return 0;
}
思路：

本题就是分析其原有图删除一个结点之后，判断其联通分量的数目，其需要的路数就是连通分量数-1；

其题目中“被敌人占有的城市”，就是在DFS之外将其设为已访问（visit置1），然后在DFS剩下的结点，判断其连通分量数。例如：1 2 3城市中，1被设为已访问，则剩下的联通分量数就变为2，需添加一条路来连通它们