Code Forces 796D Police Station

Code Forces 796D Police Station

• 题目描述

Inzane finally found Zane with a lot of money to spare, so they together decided to establish a country of their own.



Ruling a country is not an easy job. Thieves and terrorists are always ready to ruin the country’s peace. To fight back, Zane and Inzane have enacted a very effective law: from each city it must be possible to reach a police station by traveling at most d kilometers along the roads.



There are n cities in the country, numbered from 1 to n, connected only by exactly n?-?1 roads. All roads are 1 kilometer long. It is initially possible to travel from a city to any other city using these roads. The country also has k police stations located in some cities. In particular, the city’s structure satisfies the requirement enforced by the previously mentioned law. Also note that there can be multiple police stations in one city.



However, Zane feels like having as many as n?-?1 roads is unnecessary. The country is having financial issues, so it wants to minimize the road maintenance cost by shutting down as many roads as possible.



Help Zane find the maximum number of roads that can be shut down without breaking the law. Also, help him determine such roads.

• Input

The first line contains three integers n, k, and d (2?≤?n?≤?3·105, 1?≤?k?≤?3·105, 0?≤?d?≤?n?-?1) — the number of cities, the number of police stations, and the distance limitation in kilometers, respectively.



The second line contains k integers p1,?p2,?..,?pk (1?≤?pi?≤?n) — each denoting the city each police station is located in.



The i-th of the following n?-?1 lines contains two integers ui and vi (1?≤?ui,?vi?≤?n, ui?≠?vi) — the cities directly connected by the road with index i.



It is guaranteed that it is possible to travel from one city to any other city using only the roads. Also, it is possible from any city to reach a police station within d kilometers.

• Output

In the first line, print one integer s that denotes the maximum number of roads that can be shut down.



In the second line, print s distinct integers, the indices of such roads, in any order.



If there are multiple answers, print any of them.

• Examples

Input

6 2 4
1 6
1 2
2 3
3 4
4 5
5 6

Output

1
5

Input

6 3 2
1 5 6
1 2
1 3
1 4
1 5
5 6

Output

2
4 5 

• Note

In the first sample, if you shut down road 5, all cities can still reach a police station within k?=?4 kilometers.



In the second sample, although this is the only largest valid set of roads that can be shut down, you can print either 4 5 or 5 4 in the second line.

• Tips:

题意：有n个特殊点，它们之间有n-1条长度为1的边相连，现要使得任何点都能在距离d内到达这个特殊点，求最多能去掉多少边和它们的下标。



只需要bfs每个特殊点的周围距离d之内的点，若某个点已经被bfs过一次，那么它旁边没有走过的边就可以被删掉了

• Answer:

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<vector>
#include<map>
#define INF 100000000
#include<queue>
using namespace std;
const int SIZE = 3e5 + 5;
int n, k, d;// 城市数， 警察局数， 距离限制
vector<int> a[SIZE]; 
map<pair<int, int>, int> mp;
int ans[SIZE];
int cnt = 0;
int vis[SIZE];
typedef pair<int, int> P;
queue<P> police;
int main(void){
	cin >> n >> k >> d;
	for(int i = 0; i < k; i++){
		int temp;
		scanf("%d", &temp);
		police.push(P(temp, 0));
		vis[temp] = 1;
	} 
	for(int i = 1; i <= n-1; i++){
		int t1, t2;
		scanf("%d %d", &t1, &t2);
		a[t1].push_back(t2);
		a[t2].push_back(t1);  
		mp[{t1, t2}] = i;
		mp[{t2, t1}] = i;
	}
	
	while(!police.empty()){
		P p = police.front();
		police.pop();
		if(p.second > d) 	continue;
		for(int i = 0; i < a[p.first].size(); i++){
		
			if(vis[a[p.first][i]]){
				if(mp[{p.first,a[p.first][i]}] || mp[{a[p.first][i], p.first}]){
					ans[cnt++] = mp[{p.first, a[p.first][i]}];
					mp[{p.first, a[p.first][i]}] = mp[{a[p.first][i], p.first}] = 0;
				}
				continue; 
			}
			police.push(P(a[p.first][i], p.second + 1));
			mp[{p.first, a[p.first][i]}] = mp[{a[p.first][i], p.first}] = 0;
			vis[a[p.first][i]] = 1;
	}
	
}
	printf("%d\n", cnt);
	for(int i = 0; i < cnt; i++){
		printf("%d ", ans[i]);
	}
	return 0;
	
}