# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
388726 | 1bin | Designated Cities (JOI19_designated_cities) | C++14 | 1131 ms | 39888 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;
typedef long long ll;
const ll NMAX = 2e5 + 5;
#define all(v) v.begin(), v.end()
ll N, Q, a, b, c, d, W[NMAX], vis[NMAX], dp[NMAX], U[NMAX], D[NMAX], ans[NMAX];
vector<pair<ll, ll>> to[NMAX], v;
void dfs2(int now, int bef) {
for (auto& e : to[now]) {
int nxt = e.first;
if (nxt == bef) {
U[now] += e.second;
continue;
}
dfs2(nxt, now);
D[now] += D[nxt] + e.second;
}
return;
}
void dfs3(int now, int bef) {
for (auto& e : to[now]) {
int nxt = e.first;
if (nxt == bef) continue;
U[nxt] += U[now] + D[now] - D[nxt] - e.second;
dfs3(nxt, now);
}
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... |