# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
755682 | Desh03 | Election Campaign (JOI15_election_campaign) | C++17 | 144 ms | 33248 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;
vector<int> dep, dp, dp2;
vector<vector<int>> g, up;
vector<vector<tuple<int, int, int>>> qr;
int t, lg;
void dfs(int u, int p) {
up[0][u] = p;
for (int i = 1; i < lg; i++) up[i][u] = up[i - 1][up[i - 1][u]];
for (int v : g[u])
if (v ^ p)
dep[v] = dep[u] + 1, dfs(v, u);
}
int getkth(int u, int k) {
for (int i = 0; i < lg; i++)
if (k >> i & 1)
u = up[i][u];
return u;
}
void calc_dp(int u, int p) {
for (int v : g[u])
if (v ^ p) {
calc_dp(v, u);
dp2[u] += dp[v];
}
dp[u] = dp2[u];
# | 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... |