Description:
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-city2and city1-city3. Then if city1is occupied by the enemy, we must have 1 highwayrepaired, 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:
3 2 3
1 2
1 3
1 2 3
Sample Output:
1
0
0
题目大意:给定一个无向连通图和k个询问。每个询问给出一个点编号,求删除该编号后至少需要再连多少条边才能使图连通。
思路:对于每个询问,在忽略该编号的情况下对图dfs。则答案为连通分量数-1。
代码如下:
#include <iostream>
#include <cstring>
#include <cstdio>
#define maxn 1001
using namespace std;
int n, m, k, ans;
int e[maxn][maxn], book[maxn];
void dfs(int i, int q)
{
int j;
book[i] = 1;
for(j=1; j<=n; j++)
{
if(!book[j] && j!=q)
{
if(e[i][j] == 1)
dfs(j, q);
}
}
}
int main()
{
scanf("%d%d%d", &n, &m, &k);
int i;
for(i=1; i<=m; i++)
{
int a, b;
scanf("%d%d", &a, &b);
e[a][b] = e[b][a] = 1;
}
while(k--)
{
int q;
scanf("%d", &q);
memset(book, 0, sizeof(book));
ans = 0;
for(i=1; i<=n; i++)
{
if(i!=q && !book[i])
{
dfs(i, q);
ans++;
}
}
printf("%d\n", ans-1);
}
return 0;
}
总结
好久不做题,求连通分量还找半天错。。。下面把模板再敲一遍:
#include <iostream>
#include <cstring>
using namespace std;
int e[maxn][maxn], book[maxn]
int n, ans;
void dfs(int i)
{
book[i] = 1;
int j;
for(j=1; j<=n; j++)
{
if(!book[j] && e[i][j])
dfs(j);
}
}
int main()
{
int i;
ans = 0;
memset(book, 0, sizeof(book));
for(i=1; i<=n; i++)
{
if(!book[i])
{
dfs(i);
ans++;// dfs结束,则连通分量+1
}
}
printf("连通分量数:%d\n", ans);
return 0;
}