CodeForces 369C. Valera and Elections

C. Valera and Elections

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

The city Valera lives in is going to hold elections to the city Parliament.

The city hasndistricts andn - 1bidirectional roads. We know that from any district there is a path along the roads to any other district. Let's enumerate all districts in some way by integers from1ton, inclusive. Furthermore, for each road the residents decided if it is the problem road or not.A problem roadis a road that needs to be repaired.

There arencandidates running the elections. Let's enumerate all candidates in some way by integers from1ton, inclusive. If the candidate numberiwill be elected in the city Parliament, he will perform exactly one promise — to repair all problem roads on the way from thei-th district to the district1, where the city Parliament is located.

Help Valera and determine the subset of candidates such that if all candidates from the subset will be elected to the city Parliament, all problem roads in the city will be repaired. If there are several such subsets, you should choose the subset consisting of the minimum number of candidates.

Input

The first line contains a single integern(2 ≤ n ≤ 105) — the number of districts in the city.

Thenn - 1lines follow. Each line contains the description of a city road as three positive integersxi,yi,ti(1 ≤ xi, yi ≤ n,1 ≤ ti ≤ 2) — the districts connected by thei-th bidirectional road and the road type. Iftiequals to one, then thei-th road isn't the problem road; iftiequals to two, then thei-th road is the problem road.

It's guaranteed that the graph structure of the city is a tree.

Output

In the first line print a single non-negative numberk— the minimum size of the required subset of candidates. Then on the second line printkspace-separated integersa1, a2, ...ak— the numbers of the candidates that form the required subset. If there are multiple solutions, you are allowed to print any of them.

Sample test(s)

input

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

output

1
5 

input

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

output

1
3 

input

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

output

4
5 4 3 2 

深搜更新节点。。。。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>

using namespace std;

const int maxn=320000;

int Adj[maxn],Size,n,repair[maxn];
bool vis[maxn],rep[maxn];

typedef struct node
{
    int to,next,rp;
}Edge;

Edge E[maxn];

void init()
{
    Size=0;
    memset(Adj,-1,sizeof(Adj));
}

void Add_Edge(int u,int v,int r)
{
    E[Size].to=v; E[Size].rp=r;
    E[Size].next=Adj[u];
    Adj[u]=Size++;
}

void dfs(int x)
{
    vis[x]=true;
    for(int j=Adj[x];~j;j=E[j].next)
    {
        int TO=E[j].to;
        if(vis[TO]) continue;
        if(E[j].rp==1)///不要修路
        {
            repair[TO]=repair[x];
            dfs(TO);
        }
        else if(E[j].rp==2)///要修路
        {
            rep[TO]=true;
            rep[repair[x]]=false;
            repair[TO]=TO;
            dfs(TO);
        }
    }
}

int main()
{
    cin>>n;
    init();
    for(int i=0;i<n-1;i++)
    {
        int a,b,c;
        cin>>a>>b>>c;
        Add_Edge(a,b,c);
        Add_Edge(b,a,c);
    }
    dfs(1);
    int ans=0;
    for(int i=1;i<=n;i++) if(rep[i]) ans++;
    cout<<ans<<endl;
    for(int i=1;i<=n;i++) if(rep[i]) cout<<i<<" ";
 return 0;
}