Choosing Capital for Treeland codeforce 219-D

The country Treeland consists of n cities, some pairs of them are connected with unidirectional roads. Overall there are n - 1 roads in the country. We know that if we don't take the direction of the roads into consideration, we can get from any city to any other one.

The council of the elders has recently decided to choose the capital of Treeland. Of course it should be a city of this country. The council is supposed to meet in the capital and regularly move from the capital to other cities (at this stage nobody is thinking about getting back to the capital from these cities). For that reason if city a is chosen a capital, then all roads must be oriented so that if we move along them, we can get from city a to any other city. For that some roads may have to be inversed.

Help the elders to choose the capital so that they have to inverse the minimum number of roads in the country.

Input

The first input line contains integer n (2 ≤ n ≤ 2·10⁵) — the number of cities in Treeland. Next n - 1 lines contain the descriptions of the roads, one road per line. A road is described by a pair of integers s_i, t_i (1 ≤ s_i, t_i ≤ n; s_i ≠ t_i) — the numbers of cities, connected by that road. The i-th road is oriented from city s_i to city t_i. You can consider cities in Treeland indexed from 1 to n.

Output

In the first line print the minimum number of roads to be inversed if the capital is chosen optimally. In the second line print all possible ways to choose the capital — a sequence of indexes of cities in the increasing order.

Examples

Input

32 12 3

Output

Input

41 42 43 4

Output

21 2 3

题解：将方向转化为边的权值，正向边权值为0，反向边权值为1.以1为根DFS，得到1到其它所有点的总花费。重点是第二次DFS：

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3
 4 const int maxn=2e5+5;
 5
 6 struct node{
 7     int to,next,va;
 8 }e[2*maxn];
 9
10 int n,tot;
11 int dp[maxn],head[maxn];
12
13 void Inite(){
14     tot=0;
15     memset(head,-1,sizeof(head));
16 }
17
18 void addedge(int u,int v,int w){
19     e[tot].to=v;
20     e[tot].va=w;
21     e[tot].next=head[u];
22     head[u]=tot++;
23 }
24
25 void DFS1(int pa,int u){
26     for(int i=head[u];i!=-1;i=e[i].next){
27         int v=e[i].to;
28         if(pa==v) continue;
29         DFS1(u,v);
30         dp[u]+=dp[v]+e[i].va;
31     }
32 }
33
34 void DFS2(int pa,int u){
35     for(int i=head[u];i!=-1;i=e[i].next){
36         int v=e[i].to;
37         if(pa==v) continue;
38         dp[v]+=(dp[u]-dp[v])+((e[i].va)?-1:1);
39         DFS2(u,v);
40     }
41 }
42
43 int main()
44 {   Inite();
45     memset(dp,0,sizeof(dp));
46
47     scanf("%d",&n);
48     for(int i=2;i<=n;i++){
49         int u,v;
50         scanf("%d%d",&u,&v);
51         addedge(u,v,0);
52         addedge(v,u,1);
53     }
54
55     DFS1(0,1);
56     DFS2(0,1);
57
58     int temp=1e9;
59     vector<int> q;
60     for(int i=1;i<=n;i++) if(dp[i]<temp) temp=dp[i];
61     for(int i=1;i<=n;i++) if(dp[i]==temp) q.push_back(i);
62     printf("%d\n",temp);
63     for(int i=0;i<q.size();i++) printf("%d%c",q[i],(i==(q.size()-1))?'\n':' ');
64
65 }

转载于:https://www.cnblogs.com/zgglj-com/p/7765972.html

Choosing Capital for Treeland codeforce 219-D相关推荐

Codeforces - Choosing Capital for Treeland
题目链接:Codeforces - Choosing Capital for Treeland 显然,如果确定首都之后,我们可以O(n)计算出这个点的答案. 然后这个东西可以换根吗?显然是可以的.换根 ...
【CodeForces - 219D 】Choosing Capital for Treeland （树形dp）
题干: The country Treeland consists of n cities, some pairs of them are connected with unidirectional ...
树形DP——Codeforces Choosing Capital for Treeland
http://codeforces.com/problemset/problem/219/D 题意:给一个n节点的有向无环图,要找一个这样的点:该点到其它n-1要逆转的道路最少,(边<u,v&g ...
oracle中having作用,oracle中having与where的区别
1.where 不能放在group by 的后面 2.HAVING 是跟GROUP BY 连在一起用的,放在GROUP BY 后面,此时的作用相当于WHERE 3.WHERE 后面的条件中不能有聚集函 ...
2019 HZNU Winter Training Day 14 Comprehensive Training
A - Choosing Capital for Treeland CodeForces - 219D 题意:有一颗单向边的树,要选取一个结点作为首都.要求是这个结点到其它结点,总共需要翻转的路径数量 ...
【缄*默】 #DP# 各种DP的实现方法（更新ing）
DP =「状态」+「阶段」+「决策」基本原理 = 「有向无环图」+「最优子结构」+「无后效性」目录一. 线性DP { 1.概念引入 } { 2.例题详解 } [例题1]caioj 1064 最长 ...
HTML 中的字符实体集
================== 数字与特殊图形实体 ================== < < 左尖括号 > > 右尖括号 & & 连接符 " ...
markdown、html转义特殊字符代码大全
markdown.html转义特殊字符代码大全注意: 使用数字代码或英文代码需要在代码后面加一个英文的分号「;」第二列转义符号为使用数字代码或英文代码后得的的符号原符号转义符号数字代码英文 ...
HTML转义特殊字符字符
学习内容:HTML转义字符大全 java过滤器过滤危险字符转义:% & @ ! ^ & * ( ) _ + ISO Latin-1字符集 //制表符Horizontal tab // ...
Codeforce 106B Choosing Laptop
题意: V想买电脑,花最小的钱,且不是从性能的三个方面都被其他任意一个电脑全部压制的电脑的编号. 代码: #include<bits/stdc++.h> using namespace s ...

Choosing Capital for Treeland codeforce 219-D

Choosing Capital for Treeland codeforce 219-D相关推荐

最新文章

热门文章