1013. Battle Over Cities (25) 连通图

原创 2016年06月01日 10:48:48

1013. Battle Over Cities (25)

时间限制
400 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
CHEN, Yue

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 Input
3 2 3
1 2
1 3
1 2 3
Sample Output
1
0
0

提交代

题意:

(1)题目给出一张图,以及几条边。要求当去掉其中的一个顶点后为了使剩下的顶点可以连通需要增加多少条边。
(2)其实只要考虑去掉这个顶点后,剩余的顶点可以组成几个独立的区域,假设该区域数为t,则需要增加的边即为t-1

#include<iostream>   
#include<string.h>   
#include<cstdio>   
#include<iomanip>   
using namespace std; 
int n,m,k;
int edge[1001][1001];
int visited[1001];
int x,y;
void dfs(int t)
{
	visited[t]=1;
	for(int i=1;i<=n;i++)
	{
		if(visited[i]==0&&edge[i][t]==1)
		dfs(i);
	}
}
int main()
{
	scanf("%d%d%d",&n,&m,&k);
	for(int i=0;i<m;i++)
	{
		scanf("%d%d",&x,&y);
		edge[x][y]=1;
		edge[y][x]=1;
	}
	int c;
	for(int i=0;i<k;i++)
	{
		int cnt=0;
		scanf("%d",&c);
		memset(visited,0,sizeof(visited));
		visited[c]=1;
		for(int i=1;i<=n;i++)
		{
			if(visited[i]==0)
			{
				cnt++;
				dfs(i);
			}
		}
		printf("%d\n",cnt-1);
	}
	return 0;
}


PAT 1013. Battle Over Cities (25)

http://pat.zju.edu.cn/contests/pat-a-practise/1013

1001. Battle Over Cities - Hard Version (35)

It is vitally important to have all the cities connected by highways in a war. If a city is conquere...

Battle over Cities

Battle over Cities Time Limit : 10000/5000ms (Java/Other)   Memory Limit : 65536/65536K (Java/Othe...

1013. Battle Over Cities (25)

考察并查集 #include #include #include #include #include #include #include #include using namespace std; ...

九度OJ 1325:Battle Over Cities(城市间的战争) (并查集)

时间限制:1 秒 内存限制:32 兆 特殊判题:否 提交:376 解决:132 题目描述: It is vitally important to hav...

1013. Battle Over Cities

考察并查集,注意:边数可能很大,利用动态数组自动管理。// 1013. Battle Over Cities.cpp: 主项目文件。 #include "stdafx.h" #include #i...
  • newner
  • newner
  • 2013年03月11日 19:25
  • 535

PAT (Top Level) Practise 1001 Battle Over Cities - Hard Version (35)

1001. Battle Over Cities - Hard Version (35) 时间限制 800 ms 内存限制 65536 kB 代码长度限制 8000 B ...

【最小生成树】Battle Over Cities - Hard Version (35)

Think: 1知识点:最小生成树 2题意: (1):输入含有n(n

1001. Battle Over Cities - Hard Version (35)解题报告

并查集、枚举、Kruskal最小生成树算法
  • chr1991
  • chr1991
  • 2017年01月11日 22:01
  • 577

pat-top 1001. Battle Over Cities - Hard Version (35)

https://www.patest.cn/contests/pat-t-practise/1001 参考了:http://www.meetqun.net/thread-9069-1-1.h...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:1013. Battle Over Cities (25) 连通图
举报原因:
原因补充:

(最多只允许输入30个字)