PAT-Advanced-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.


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.


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

Sample Output

用图储存路径,记录被占领的城市,再通过其他城市间的路径建立剩余的相互连通的城市的集合(用Disjoint Set),需要修建的公路数量为 剩余集合数-1




电子邮件地址不会被公开。 必填项已用*标注