zoukankan      html  css  js  c++  java
  • 1013 Battle Over Cities 可以说是求连通量的模板了

    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 <algorithm>
    #include<cstring> 
    #include<iostream>
    #include<queue>
    #define inf 1005
    #include<stdio.h>
    using namespace std; 
    int n,m,k,a[inf][inf],u,v,s,cnt=0;
    bool  book[inf];
    void dfs(int c)
    {
        book[c]=true;
         for(int i=1;i<=n;i++)
         {
             if(a[c][i]==1&&book[i]==false)
             {
                 dfs(i);
             }
         }
    }
    int main()
    {
        fill(a[0],a[0]+inf*inf,0);
        cin>>n>>m>>k;
        while(m--)
        {
            cin>>u>>v;
            a[v][u]=a[u][v]=1;
        }
        while(k--)
        {
            cnt=0;
            fill(book,book+inf,false);
            cin>>s;
            book[s]=true;
            for(int i=1;i<=n;i++)
            {
                if(book[i]==false)
                {
                dfs(i);
                cnt++;
                }
            }
            cout<<cnt-1<<endl;
        } 
        return 0;
    }
     
    如果你够坚强够勇敢,你就能驾驭他们
  • 相关阅读:
    PHP操作二进制字节数据
    Linux端口转发-rinted工具部署、配置、使用
    Netty学习(八)-Netty的心跳机制
    Navicat Premium 12破解方法
    App界面设计规范-字体规范
    PHP 扩展开发之Zephir
    rinetd 一个linux下的端口转发工具
    windows node版本管理工具nvm
    vue cli 常见问题汇总
    监听微信返回
  • 原文地址:https://www.cnblogs.com/liuzhaojun/p/11143053.html
Copyright © 2011-2022 走看看