# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
104791 | IOrtroiii | Designated Cities (JOI19_designated_cities) | C++14 | 735 ms | 57172 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;
const int N = 200200;
vector< tuple<int, int, int> > g[N];
long long md[N];
long long sm[N];
long long up[N];
void dfs_down(int u,int p) {
for (auto e : g[u]) {
int v, wf, wb;
tie(v, wf, wb) = e;
if (v == p) continue;
dfs_down(v, u);
md[u] = max(md[u], md[v] + wf);
sm[u] += wf + sm[v];
}
}
void dfs_up(int u,int p) {
md[u] = max(md[u], up[u]);
pair<long long, long long> mx(up[u], 0);
for (auto e : g[u]) {
int v, wf, wb;
tie(v, wf, wb) = e;
if (v == p) continue;
long long nw = md[v] + wf;
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... |