# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
166245 | maruii | Designated Cities (JOI19_designated_cities) | C++14 | 895 ms | 50904 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;
using pii = pair<int, int>;
using ll = long long;
#define ff first
#define ss second
int N, Q, dfn[200005], dfnn, efn[200005], par[200005];
bool used[200005];
vector<pair<int, pii> > edge[200005];
ll ans[200005], D[200005];
ll dfs1(int x, int p) {
ll ret = 0;
for (auto i : edge[x]) {
if (i.ff == p) continue;
ret += dfs1(i.ff, x) + i.ss.ff;
}
return ret;
}
ll dfs2(int x, int p, ll v) {
ll ret = v;
for (auto i : edge[x]) {
if (i.ff == p) continue;
ret = min(ret, dfs2(i.ff, x, v - i.ss.ff + i.ss.ss));
}
return ret;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |