Submission #34365045

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue> 

using namespace std;

#define mp make_pair
#define pb push_back
#define ll long long

const int maxN = 200011;

int n, x, y;
vector<int> adj[maxN];
bool white[maxN];
string s;

vector<int> aft[maxN];
int deg[maxN];
priority_queue<int, vector<int>, greater<int>> ready;

void dfs(int node, int root) {
  for (int to: adj[node]) {
    if (to == root) continue;
    dfs(to, node);

    if (white[to]) {
      aft[to].pb(node);
      white[node] ^= true;
    } else {
      aft[node].pb(to);
    }
  }
}


int main()
{
  cin >> n;
  for (int i = 1; i < n; i++) {
    cin >> x >> y;
    adj[x].pb(y);
    adj[y].pb(x);
  }

  cin >> s;
  for (int i = 1; i <= n; i++)
    white[i] = s[i - 1] == 'W';

  dfs(1, 0);
  if (!white[1]) {
    cout << -1;
    exit(0);
  }

  for (int node = 1; node <= n; node++)
    for (int to: aft[node])
      deg[to]++;

  for (int node = 1; node <= n; node++)
    if (deg[node] == 0)
      ready.push(node);

  while (!ready.empty()) {
    int node = ready.top();
    ready.pop();

    cout << node << ' ';
    for (int to: aft[node]) 
      if (--deg[to] == 0) 
        ready.push(to);
  }


  return 0;
}

Submission Info

Judge Result