# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
753281 | LeonaRaging | Election Campaign (JOI15_election_campaign) | C++14 | 121 ms | 36276 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.
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define db(val) "[" #val " = " << (val) << "] "
const int maxn = 1e5 + 4;
const int N = 16;
struct Query {
int u, v, w;
Query(int u = 0, int v = 0, int w = 0): u(u), v(v), w(w) {}
} q[maxn];
int n, m, h[maxn], tin[maxn], tout[maxn], up[maxn][20], dp[maxn], sum[maxn];
vector<int> adj[maxn], cross[maxn], down[maxn];
void dfs1(int u, int p) {
tin[u] = ++tin[0];
for (int j = 1; j <= N; j++)
up[u][j] = up[up[u][j - 1]][j - 1];
for (int v : adj[u])
if (v != p) {
h[v] = h[u] + 1;
up[v][0] = u;
dfs1(v, u);
}
tout[u] = tin[0];
}
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |