# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
632948 | Arnch | Designated Cities (JOI19_designated_cities) | C++17 | 873 ms | 60988 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;
constexpr int N = 2e5 + 10;
int n;
ll total;
ll ps[N], cnt[N], par[N], up[N];
int st[N], fn[N], id[N], tim;
ll ans[N];
bool mark[N];
vector<pair<int, int> > adj[N];
void preDFS(int x, int p = 0) {
for(auto j : adj[x]) {
if(j.first == p) {
up[x] = up[p] + j.second;
break;
}
}
for(auto j : adj[x]) {
if(j.first == p) {
continue;
}
cnt[j.first] = j.second;
ps[j.first] = ps[x] + j.second;
# | 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... |