# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950807 | m1dsho | Two Currencies (JOI23_currencies) | C++98 | 4567 ms | 76392 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define int long long
using namespace std;
struct node {
int s, t, x, y;
};
const int N = 2e5 + 2;
const int L = 20;
int dp[L][N];
int tin[N];
int sz[N];
int H[N];
int up[N];
pair<int, int> t[5 * N];
vector<int> g[N];
void dfs1(int u, int p) {
sz[u] = 1;
H[u] = H[p] + 1;
dp[0][u] = p;
for (int i = 1; i < L; i++) {
dp[i][u] = dp[i - 1][dp[i - 1][u]];
}
for (auto v: g[u]) {
if (v == p) continue;
dfs1(v, u);
sz[u] += sz[v];
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |