Problem p03204 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : (b))
#define all(v) (v).begin(), (v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define cmx(x, y) x = max(x, y)
#define cmn(x, y) x = min(x, y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout << #x << " = " << (x) << endl
#define spair(p) cout << #p << ": " << p.fi << " " << p.se << endl
#define sar(a, n)                                                              \
  cout << #a << ":";                                                           \
  rep(pachico, n) cout << " " << a[pachico];                                   \
  cout << endl
#define svec(v)                                                                \
  cout << #v << ":";                                                           \
  rep(pachico, v.size()) cout << " " << v[pachico];                            \
  cout << endl
#define svecp(v)                                                               \
  cout << #v << ":";                                                           \
  each(pachico, v) cout << " {" << pachico.first << ":" << pachico.second      \
                        << "}";                                                \
  cout << endl
#define sset(s)                                                                \
  cout << #s << ":";                                                           \
  each(pachico, s) cout << " " << pachico;                                     \
  cout << endl
#define smap(m)                                                                \
  cout << #m << ":";                                                           \
  each(pachico, m) cout << " {" << pachico.first << ":" << pachico.second      \
                        << "}";                                                \
  cout << endl

using namespace std;

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 200005;

vector<int> G[MAX_N], cnt[MAX_N];
int ans[MAX_N], mx[MAX_N];

void dfs(int u, int p, int val) {
  mx[u] = val;
  each(v, G[u]) {
    if (v != p) {
      cnt[u].pb(0);
      dfs(v, u, max(val, u));
    }
  }
}

void redfs(int u, int p, const int val, int &num) {
  num++;
  int id = 0, prv = 0;
  each(v, G[u]) {
    if (v != p) {
      prv = num;
      if (v < val)
        redfs(v, u, val, num);
      cnt[u][id++] = num - prv;
    }
  }
}

void dfs(int u, int p) {
  if (p >= 0) {
    if (mx[p] != mx[u] || u > p) {
      int num = 0;
      redfs(u, p, mx[u], num);
    }
  }
  each(v, G[u]) {
    if (v != p) {
      dfs(v, u);
    }
  }
}

void redfs(int u, int p, int val) {
  int id = 0, sm = accumulate(all(cnt[u]), 0);
  ans[u] = val + sm;
  each(v, G[u]) {
    if (v != p) {
      redfs(v, u, val + sm - cnt[u][id++] + 1);
    }
  }
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  rep(i, n - 1) {
    int a, b;
    cin >> a >> b;
    G[a - 1].pb(b - 1), G[b - 1].pb(a - 1);
  }
  dfs(0, -1, -1);
  dfs(0, -1);
  redfs(0, -1, 0);
  srep(i, 1, n) { cout << ans[i] << " "; }
  cout << "\n";
  return 0;
}

Fixed submission:
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto &(a) : (b))
#define all(v) (v).begin(), (v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)), v.erase(unique(all(v)), v.end())
#define cmx(x, y) x = max(x, y)
#define cmn(x, y) x = min(x, y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout << #x << " = " << (x) << endl
#define spair(p) cout << #p << ": " << p.fi << " " << p.se << endl
#define sar(a, n)                                                              \
  cout << #a << ":";                                                           \
  rep(pachico, n) cout << " " << a[pachico];                                   \
  cout << endl
#define svec(v)                                                                \
  cout << #v << ":";                                                           \
  rep(pachico, v.size()) cout << " " << v[pachico];                            \
  cout << endl
#define svecp(v)                                                               \
  cout << #v << ":";                                                           \
  each(pachico, v) cout << " {" << pachico.first << ":" << pachico.second      \
                        << "}";                                                \
  cout << endl
#define sset(s)                                                                \
  cout << #s << ":";                                                           \
  each(pachico, s) cout << " " << pachico;                                     \
  cout << endl
#define smap(m)                                                                \
  cout << #m << ":";                                                           \
  each(pachico, m) cout << " {" << pachico.first << ":" << pachico.second      \
                        << "}";                                                \
  cout << endl

using namespace std;

typedef pair<int, int> P;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 200005;

vector<int> G[MAX_N], cnt[MAX_N];
int ans[MAX_N], mx[MAX_N];

void dfs(int u, int p, int val) {
  mx[u] = val;
  each(v, G[u]) {
    if (v != p) {
      cnt[u].pb(0);
      dfs(v, u, max(val, u));
    }
  }
}

void redfs(int u, int p, const int val, int &num) {
  num++;
  int id = 0, prv = 0;
  each(v, G[u]) {
    if (v != p) {
      prv = num;
      if (v < val)
        redfs(v, u, val, num);
      cnt[u][id++] = num - prv;
    }
  }
}

void dfs(int u, int p) {
  if (p >= 0) {
    if (mx[p] != mx[u] || u > mx[u]) {
      int num = 0;
      redfs(u, p, mx[u], num);
    }
  }
  each(v, G[u]) {
    if (v != p) {
      dfs(v, u);
    }
  }
}

void redfs(int u, int p, int val) {
  int id = 0, sm = accumulate(all(cnt[u]), 0);
  ans[u] = val + sm;
  each(v, G[u]) {
    if (v != p) {
      redfs(v, u, val + sm - cnt[u][id++] + 1);
    }
  }
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  rep(i, n - 1) {
    int a, b;
    cin >> a >> b;
    G[a - 1].pb(b - 1), G[b - 1].pb(a - 1);
  }
  dfs(0, -1, -1);
  dfs(0, -1);
  redfs(0, -1, 0);
  srep(i, 1, n) { cout << ans[i] << " "; }
  cout << "\n";
  return 0;
}