[codeforces796D]Police Stations

最新推荐文章于 2019-11-11 19:10:44 发布

dxyinme

最新推荐文章于 2019-11-11 19:10:44 发布

阅读量197

点赞数

分类专栏： -----------------图论图的遍历

本文链接：https://blog.csdn.net/dxyinme/article/details/98208558

版权

-----------------图论同时被 2 个专栏收录

78 篇文章 0 订阅

订阅专栏

图的遍历

20 篇文章 0 订阅

订阅专栏

time limit per test : 2 seconds
memory limit per test : 256 megabytes
分数：2100

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·10^5, 1 ≤ k ≤ 3·10^5, 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_1, p_2, ..., 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$ and $v_i (1 ≤ u_i, v_i ≤ n, u_i ≠ v_i)$ — 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

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

题意：
有一个n个节点的树，有k个关键节点，问最多删去多少条边可以使得每个点到离自己最近的关键节点的距离小于等于d，要求输出一种删边方案。
题解：
很显然我们可以让删掉之后的每个联通块内只有一个关键节点。这样是最优的，那么我们从所有关键节点开始同时bfs，遇上连接两个不同关键节点控制区域的边就将这个边删去，显然可以得到最好的答案。

#include<bits/stdc++.h>
#define ll long long
#define INF 1999122700
using namespace std;
int ne,h[300004];
struct edge{
    int to,nt,w;
}e[600004];
void add(int u,int v,int w){
    e[++ne].to=v;e[ne].w=w;
    e[ne].nt=h[u];h[u]=ne;
}
int dis[300004],pit[300004];
int n,k,d,p[300004];
void dfs(int x,int fa){
    for(int i=h[x];i;i=e[i].nt){
        if(e[i].to==fa)continue;
        if(dis[x]+1<=d&&dis[e[i].to]>dis[x]+1){
            dis[e[i].to]=dis[x]+1;
            pit[e[i].w]=1;
            dfs(e[i].to,x);
        }
        else{
            pit[e[i].w]=0;
        }
    }
}
queue<int>q;
vector<int>ans;
int main(){
    ne=0;
    while(!q.empty())q.pop();
    memset(pit,0,sizeof(pit));
    memset(h,0,sizeof(h));
    scanf("%d%d%d",&n,&k,&d);
    for(int i=1;i<=n;i++)dis[i]=INF;
    for(int i=1;i<=k;i++){
        scanf("%d",&p[i]);
        q.push(p[i]);
        dis[p[i]]=0;
    }
    for(int i=1;i<n;i++){
        int u,v;scanf("%d%d",&u,&v);
        add(u,v,i);add(v,u,i);
    }
    while(!q.empty()){
        int x=q.front();q.pop();
        for(int i=h[x];i;i=e[i].nt){
            if(dis[e[i].to]==INF){
                dis[e[i].to]=dis[x]+1;
                pit[e[i].w]=1;
                q.push(e[i].to);
            }
        }
    }
    ans.clear();
    for(int i=1;i<n;i++){
        if(!pit[i]){
            ans.push_back(i);
        }
    }
    printf("%d\n",ans.size());
    for(int i=0;i<ans.size();i++)printf("%d ",ans[i]);
    if(ans.size())puts("");
    return 0;
}