Police Stations

最新推荐文章于 2020-12-19 13:49:51 发布

轩辕狗蛋_Goudan

最新推荐文章于 2020-12-19 13:49:51 发布

阅读量310

点赞数

文章标签：搜索 BFS

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 mostd kilometers along the roads.

$\text{[math]}$

There are n cities in the country, numbered from1 to n, connected only by exactlyn - 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 hask 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·10⁵,1 ≤ k ≤ 3·10⁵,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 p₁, p₂, ..., p_k (1 ≤ p_i ≤ n) — each denoting the city each police station is located in.

The i-th of the following n - 1 lines contains two integers u_i andv_i (1 ≤ u_i, v_i ≤ n,u_i ≠ v_i) — the cities directly connected by the road with indexi.

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 withind 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.

Example

Input

Output

1
5

Input

Output

2
4 5

Note

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

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

题意：告诉你哪些点是警察局，由于资金原因需要删除一些道路，不过需要满足其他点到警察局的距离小于d

解法：BFS，其实d是无关的，因为每次向下一层搜索，如果在某一部搜到了已经访问过的点，那么肯定这条边是二者最中间的边

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<vector>
using namespace std;
const int maxn=3e6+10;
bool vis[maxn];
bool flag[maxn];
queue<int> q;
vector< pair<int,int> >p[maxn];
int n,k,d;
int main()
{
    cin>>n>>k>>d;
    for(int i=1;i<=k;i++){
        int x;
        scanf("%d",&x);
        vis[x]=1;
        q.push(x);
    }


    for(int i=1;i<n;i++){
        int x,y;
        scanf("%d%d",&x,&y);

        p[x].push_back(make_pair(y,i));
        p[y].push_back(make_pair(x,i));
    }
    while(!q.empty()){
        int x=q.front();
        q.pop();
        for(int i=0;i<p[x].size();i++){
            int ans=p[x][i].first;
            int cnt=p[x][i].second;
            if(vis[ans]==1)
                continue;
            vis[ans]=1;
            flag[cnt]=1;
            q.push(ans);
        }
    }

    int cot=0;
    for(int i=1;i<n;i++)
    {
        if(!flag[i])
        {
            cot++;
        }
    }
    printf("%d\n",cot);
     for(int i=1;i<n;i++)
    {
        if(!flag[i])
        {
            printf("%d ",i);
        }
    }
    return 0;
}

原文：http://www.cnblogs.com/yinghualuowu/p/6701889.html