PTA 甲级 1013 Battle Over Cities (25 分) 【图的强连通分量的个数】【DFS】

最新推荐文章于 2022-04-14 16:01:23 发布

117瓶果粒橙

最新推荐文章于 2022-04-14 16:01:23 发布

阅读量285

点赞数

分类专栏： # 图论

本文链接：https://blog.csdn.net/weixin_41513917/article/details/100084088

版权

图论专栏收录该内容

14 篇文章 0 订阅

订阅专栏

题目

大意：给出n个城市之间有相互连接的m条道路，当删除一个城市和其连接的道路的时候。有K个询问，至少要添加多少个路线才能让它们重新变为连通图

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

分析

这道题，能看的出来是让你求强连通分量的，

（有向图强连通分量：在有向图G中，如果两个顶点vi,vj间（vi>vj）有一条从vi到vj的有向路径，同时还有一条从vj到vi的有向路径，则称两个顶点强连通(strongly connected)。如果有向图G的每两个顶点都强连通，称G是一个强连通图）

强连通分量的个数用dfs来求。设置一个vis[ ] , 记录该城市是不是已经走过了（是不是已经算在某个强连通分量里面）。

被占领的城市的vis要置为1 ，对于每一个被占领的城市，去除这个城市结点，就是把它标记为已经访问过（相当于是一个独立的连通分量），这样在深度优先遍历的时候，对于所有未访问的结点进行遍历，就能求到所有的连通分量的个数～

最后，要修的路的个数 = 强连通分量的个数 - 1.（毕竟三块的话，其实只要2条路来修就已经连上去了）。。。

参考博客 https://www.liuchuo.net/archives/2346

代码

int N, M , K;
int mp[1005][1005];
int vis[1005];

int dfs(int start)
{
    vis[start] = 1;
    for(int i = 1 ; i <= N ; i++)
    {
        if(vis[i] == 0 && mp[start][i])
            dfs(i);
    }
}


int main()
{
    cin >> N >> M >> K;
    for(int i = 0 ; i < M ; i++)
    {
        int a , b;
        scanf("%d%d" , &a , &b);
        mp[a][b] = mp[b][a] = 1;
    }

    for(int i = 0 ; i < K ; i++)
    {
        int ans = 0;
        int check;
        //cin >> check;
        scanf("%d" , &check);

        memset(vis , 0 , sizeof(vis));
        vis[check] = 1;

        for(int j = 1 ; j <= N ; j++)
        {
            if(vis[j] == 0)
            {
                dfs(j);
                ans ++;
            }
        }
        //cout << ans - 1 << endl;
        printf("%d\n" , ans - 1);
    }
}