1013 Battle Over Cities (25 分)

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 city​1​​-city​2​​ and city​1​​-city​3​​. Then if city​1​​ is occupied by the enemy, we must have 1 highway repaired, that is the highway city​2​​-city​3​​.

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:

3 2 3
1 2
1 3
1 2 3

Sample Output:

1
0
0

1.最后一个测试点一直超时，删除了vector的头文件申明就好了...这点要记一下

2.此题就是求去掉某个顶点后，剩下的连通分量数；两个连通分量之间一条边就能连通，n个连通分量要n-1条边；

#include<iostream>
#include <algorithm>
#include <math.h>
using namespace std;
int n,m,k;
int g[1000][1000];
int visited[1000];
void dfs(int t){
    visited[t]=1;
    for(int i=0;i<n;i++){
        if(!visited[i]&&g[t][i]==1)
            dfs(i);
    }
}
int main(){
    cin>>n>>m>>k;
    for(int i=0;i<m;++i){
        int r,c;
        cin>>r>>c;
        g[r-1][c-1]=g[c-1][r-1]=1;
    }
    for(int i=0;i<k;i++){
        int city;
        cin>>city;
        fill(visited,visited+1000,0);
        int count=0;
        visited[city-1]=1;
        for(int j=0;j<n;j++)
            if(!visited[j]){
                dfs(j);
                count++;
            }
        cout<<count-1<<endl;
    }
    return 0;
}