本文主要是介绍1013. Battle Over Cities (25) DFs，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
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 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
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
For each of the K cities, output in a line the number of highways need to be repaired if that city is lost.
Sample Input3 2 3 1 2 1 3 1 2 3Sample Output
1 0 0
提交代码
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<stack>
using namespace std;
typedef long long ll;
const int maxn=1005;
const int inf=9999;
int n,m,k;
int map[maxn][maxn];//每次搜索使用的
bool vis[maxn];
void dfs(int s,int t)
{for(int i=1;i<=n;i++){if(map[s][i]==1&&!vis[i]&&i!=t){vis[i]=1;dfs(i,t);}}
}
int main()
{int i,j,t;cin>>n>>m>>k;for(i=0;i<m;i++){int s,e;cin>>s>>e;map[s][e]=map[e][s]=1;}for(i=0;i<k;i++){scanf("%d",&t);int ans=0;memset(vis,0,sizeof(vis));for(j=1;j<=n;j++)if(j!=t&&!vis[j]){ans++;dfs(j,t);}printf("%d\n",ans-1);}return 0;
}这篇关于1013. Battle Over Cities (25) DFs的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
