Problem p02728 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define double long double
#define EPS 1e-9
// #define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template <typename T> ostream &operator<<(ostream &os, const vector<T> &A) {
  for (int i = 0; i < A.size(); i++)
    os << A[i] << " ";
  os << endl;
  return os;
}
template <> ostream &operator<<(ostream &os, const vector<vector<int>> &A) {
  int N = A.size();
  int M;
  if (N > 0)
    M = A[0].size();
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < M; j++)
      os << A[i][j] << " ";
    os << endl;
  }
  return os;
}

typedef pair<int, int> pii;
typedef long long ll;

struct edge {
  int from, to, d, c;
  edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
    from = _from;
    to = _to;
    d = _d;
    c = _c;
  }
  bool operator<(const edge &rhs) const {
    return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
  }
};
struct aabb {
  int x1, y1, x2, y2;
  aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector<edge> edges;
typedef vector<edges> graph;
struct flow {
  int to, cap, rev, cost;
  flow(int to = 0, int cap = 0, int rev = 0, int cost = 0)
      : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector<vector<flow>> flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template <typename T, typename U> bool chmin(T &x, const U &y) {
  if (x > y) {
    x = y;
    return true;
  }
  return false;
}
template <typename T, typename U> bool chmax(T &x, const U &y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}

struct initializer {
  initializer() { cout << fixed << setprecision(20); }
};
initializer _____;
ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
  int d = a;
  if (b != 0) {
    d = extgcd(b, a % b, y, x);
    y -= (a / b) * x;
  } else {
    x = 1;
    y = 0;
  }
  return d;
}
ll factorial(ll x) {
  if (x == 1)
    return 1;
  else
    return x * factorial(x - 1);
}
ll Mfactorial(ll x, ll m) {
  ll ret = 1;
  for (ll i = 1; i <= x; i++) {
    ret *= i;
    ret %= m;
  }
  return ret;
}
vector<int> MfactTable(int n, int m) {
  vector<int> ret(n + 1);
  ret[0] = 1;
  int tmp = 1;
  for (int i = 1; i <= n; i++) {
    tmp *= i;
    tmp %= m;
    ret[i] = tmp;
  }
  return ret;
}
int Minverse(int a, int m) {
  int x, y;
  extgcd(a, m, x, y);
  return (m + x % m) % m;
}
int McombSmall(int n, int k, int m) {
  // O(n)
  if (k > n)
    return 0;
  int ret = Mfactorial(n, m);
  ret *= Minverse(Mfactorial(k, m), m);
  ret %= m;
  ret *= Minverse(Mfactorial(n - k, m), m);
  return ret % m;
}
int McombFromFactTable(vector<int> &T, int n, int k, int m) {
  if (k > n)
    return 0;
  int ret = T[n];
  ret *= Minverse(T[k], m);
  ret %= m;
  ret *= Minverse(T[n - k], m);
  return ret % m;
}
ll pow(ll x, int n) {
  if (n == 0)
    return 1;
  ll ret = (n & 1) ? x : 1;
  ll a = pow(x, n / 2);
  return ret * a * a;
}
ll Mpow(ll x, int n, int m) {
  if (n == 0)
    return 1;
  ll ret = (n & 1) ? x : 1;
  ll a = Mpow(x, n / 2, m);
  return (((ret * a) % m) * a) % m;
}
vector<vector<int>> combTable(int N) {
  vector<vector<int>> ret(N + 1, vector<int>(N + 1));
  for (int i = 0; i <= N; i++)
    for (int j = 0; j <= i; j++) {
      if (j == 0 || j == i)
        ret[i][j] = 1;
      else
        ret[i][j] = ret[i - 1][j - 1] + ret[i - 1][j];
    }
  return ret;
}
int countNmodPisQlr(int l, int r, int P, int Q) {
  // r>=l>=0
  return (r - Q + P) / P - (l - Q + P - 1) / P;
}
struct Combination {
  int N = 0, M;
  vector<int> Ftable, FItable, Inversetable;
  void init() {
    Ftable.resize(N + 1);
    FItable.resize(N + 1);
    Inversetable.resize(N + 1);
    Ftable[0] = 1;
    FItable[0] = 1;
    for (int i = 1; i <= N; i++)
      Ftable[i] = Ftable[i - 1] * i % M;
    FItable[N] = Minverse(Ftable[N], M);
    for (int i = N - 1; i >= 1; i--)
      FItable[i] = FItable[i + 1] * (i + 1) % M;
    Inversetable[1] = 1;
    for (int i = 2; i <= N; i++)
      Inversetable[i] = M - Inversetable[M % i] * (M / i) % M;
  }
  Combination(int max, int mod) {
    N = max;
    M = mod;
    init();
  }
  int calc(int n, int k) {
    if (k > n)
      return 0;
    int ret = Ftable[n] * FItable[k] % M * FItable[n - k] % M;
    return ret;
  }
  int inverse(int n) { return Inversetable[n]; }
  int factorial(int n) { return Ftable[n]; }
  int factorialInverse(int n) { return FItable[n]; }
};
int N, M, K, T, Q, H, W;
pii dfs(vector<vector<int>> &G, Combination &cmb, vector<map<int, pii>> &dp,
        int x, int p, int f) {
  if (dp[x].find(p) != dp[x].end()) {
    return dp[x][p];
  }
  int c = 1, v = 1;
  if (f || p == -1) {
    for (auto j : G[x]) {
      if (j == p)
        continue;
      pii ret = dfs(G, cmb, dp, j, x, f);
      c += ret.second;
      (v *= ret.first * cmb.factorialInverse(ret.second) % MOD) %= MOD;
    }

  } else {
    pii ret = dfs(G, cmb, dp, x, -1, f);
    pii ret2 = dfs(G, cmb, dp, p, x, f);
    c = N - ret2.second;
    v = ret.first * cmb.factorialInverse(ret.second - 1) % MOD;
    if (0) {
      cout << "----------" << endl;
      cout << ret.first << " " << ret.second << endl
           << ret2.first << " " << ret2.second << endl;
    }
    (v *= Minverse(ret2.first, MOD) * cmb.factorial(ret2.second) % MOD) %= MOD;
  }
  (v *= cmb.factorial(c - 1)) %= MOD;
  pii ret(v, c);
  return dp[x][p] = ret;
}
signed main() {
  cin >> N;
  vector<vector<int>> G(N);
  rep(i, N - 1) {
    int a, b;
    cin >> a >> b;
    --a;
    --b;
    G[a].push_back(b);
    G[b].push_back(a);
  }
  Combination cmb(N + 10, MOD);
  vector<map<int, pii>> dp(N);
  dfs(G, cmb, dp, 0, -1, 1);
  rep(k, N) cout << dfs(G, cmb, dp, k, -1, 0).first << endl;
  // cout << dp[1][0].second << endl;
  //	cout << cmb.factorialInverse(0) << endl;
  return 0;
}

Error: TLE

Fixed submission:

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>

#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define double long double
#define EPS 1e-9
// #define PI 3.14159265358979

#define rep(i, n) for (int i = 0; i < (int)(n); i++)

using namespace std;

template <typename T> ostream &operator<<(ostream &os, const vector<T> &A) {
  for (int i = 0; i < A.size(); i++)
    os << A[i] << " ";
  os << endl;
  return os;
}
template <> ostream &operator<<(ostream &os, const vector<vector<int>> &A) {
  int N = A.size();
  int M;
  if (N > 0)
    M = A[0].size();
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < M; j++)
      os << A[i][j] << " ";
    os << endl;
  }
  return os;
}

typedef pair<int, int> pii;
typedef long long ll;

struct edge {
  int from, to, d, c;
  edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
    from = _from;
    to = _to;
    d = _d;
    c = _c;
  }
  bool operator<(const edge &rhs) const {
    return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
  }
};
struct aabb {
  int x1, y1, x2, y2;
  aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};

typedef vector<edge> edges;
typedef vector<edges> graph;
struct flow {
  int to, cap, rev, cost;
  flow(int to = 0, int cap = 0, int rev = 0, int cost = 0)
      : to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector<vector<flow>> flows;

const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);

int pow2(int n) { return 1LL << n; }
template <typename T, typename U> bool chmin(T &x, const U &y) {
  if (x > y) {
    x = y;
    return true;
  }
  return false;
}
template <typename T, typename U> bool chmax(T &x, const U &y) {
  if (x < y) {
    x = y;
    return true;
  }
  return false;
}

struct initializer {
  initializer() { cout << fixed << setprecision(20); }
};
initializer _____;
ll gcd(ll a, ll b) {
  if (b == 0)
    return a;
  else
    return gcd(b, a % b);
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
  int d = a;
  if (b != 0) {
    d = extgcd(b, a % b, y, x);
    y -= (a / b) * x;
  } else {
    x = 1;
    y = 0;
  }
  return d;
}
ll factorial(ll x) {
  if (x == 1)
    return 1;
  else
    return x * factorial(x - 1);
}
ll Mfactorial(ll x, ll m) {
  ll ret = 1;
  for (ll i = 1; i <= x; i++) {
    ret *= i;
    ret %= m;
  }
  return ret;
}
vector<int> MfactTable(int n, int m) {
  vector<int> ret(n + 1);
  ret[0] = 1;
  int tmp = 1;
  for (int i = 1; i <= n; i++) {
    tmp *= i;
    tmp %= m;
    ret[i] = tmp;
  }
  return ret;
}
int Minverse(int a, int m) {
  int x, y;
  extgcd(a, m, x, y);
  return (m + x % m) % m;
}
int McombSmall(int n, int k, int m) {
  // O(n)
  if (k > n)
    return 0;
  int ret = Mfactorial(n, m);
  ret *= Minverse(Mfactorial(k, m), m);
  ret %= m;
  ret *= Minverse(Mfactorial(n - k, m), m);
  return ret % m;
}
int McombFromFactTable(vector<int> &T, int n, int k, int m) {
  if (k > n)
    return 0;
  int ret = T[n];
  ret *= Minverse(T[k], m);
  ret %= m;
  ret *= Minverse(T[n - k], m);
  return ret % m;
}
ll pow(ll x, int n) {
  if (n == 0)
    return 1;
  ll ret = (n & 1) ? x : 1;
  ll a = pow(x, n / 2);
  return ret * a * a;
}
ll Mpow(ll x, int n, int m) {
  if (n == 0)
    return 1;
  ll ret = (n & 1) ? x : 1;
  ll a = Mpow(x, n / 2, m);
  return (((ret * a) % m) * a) % m;
}
vector<vector<int>> combTable(int N) {
  vector<vector<int>> ret(N + 1, vector<int>(N + 1));
  for (int i = 0; i <= N; i++)
    for (int j = 0; j <= i; j++) {
      if (j == 0 || j == i)
        ret[i][j] = 1;
      else
        ret[i][j] = ret[i - 1][j - 1] + ret[i - 1][j];
    }
  return ret;
}
int countNmodPisQlr(int l, int r, int P, int Q) {
  // r>=l>=0
  return (r - Q + P) / P - (l - Q + P - 1) / P;
}
struct Combination {
  int N = 0, M;
  vector<int> Ftable, FItable, Inversetable;
  void init() {
    Ftable.resize(N + 1);
    FItable.resize(N + 1);
    Inversetable.resize(N + 1);
    Ftable[0] = 1;
    FItable[0] = 1;
    for (int i = 1; i <= N; i++)
      Ftable[i] = Ftable[i - 1] * i % M;
    FItable[N] = Minverse(Ftable[N], M);
    for (int i = N - 1; i >= 1; i--)
      FItable[i] = FItable[i + 1] * (i + 1) % M;
    Inversetable[1] = 1;
    for (int i = 2; i <= N; i++)
      Inversetable[i] = M - Inversetable[M % i] * (M / i) % M;
  }
  Combination(int max, int mod) {
    N = max;
    M = mod;
    init();
  }
  Combination() {}
  int calc(int n, int k) {
    if (k > n)
      return 0;
    int ret = Ftable[n] * FItable[k] % M * FItable[n - k] % M;
    return ret;
  }
  int inverse(int n) { return Inversetable[n]; }
  int factorial(int n) { return Ftable[n]; }
  int factorialInverse(int n) { return FItable[n]; }
};
int N, M, K, T, Q, H, W;
vector<unordered_map<int, pii>> dp;
Combination cmb;
pii dfs(graph &G, int x, int y, int p) {
  if (dp[x].find(y) != dp[x].end())
    return dp[x][y];
  int n = 0;
  vector<pii> A;
  for (auto &e : G[x]) {
    if (e.to == p)
      continue;
    pii ret = dfs(G, e.to, e.d, x);
    n += ret.second;
    A.push_back(ret);
  }
  pii ret(1, 0);
  ret.second = n + 1;
  rep(i, A.size()) {
    ret.first *= A[i].first * cmb.calc(n, A[i].second) % MOD;
    ret.first %= MOD;
    n -= A[i].second;
  }
  return dp[x][y] = ret;
}
signed main() {
  cin >> N;
  graph G(N);
  cmb = Combination(N + 10, MOD);
  dp.resize(N);
  rep(i, N - 1) {
    int a, b;
    cin >> a >> b;
    --a;
    --b;
    G[a].emplace_back(a, b, i);
    G[b].emplace_back(b, a, i);
  }
  rep(k, N) {
    pii ans = dfs(G, k, N - 1, -1);
    cout << ans.first << endl;
  }
  return 0;
}