# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
384834 | kostia244 | Designated Cities (JOI19_designated_cities) | C++17 | 757 ms | 87816 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 ll = long long;
#define int long long
const int maxn = 4e5 + 12;
int n, cst[2*maxn];
ll edgesum = 0;
vector<array<int, 2>> g[maxn];
ll sub[maxn];
void sub_cost(int v, int p) {
sub[v] = 0;
for(auto [i, id] : g[v]) if(i != p) {
sub_cost(i, v);
sub[v] += sub[i] + cst[id];
}
}
ll arb[maxn];
void reroot_cost(int v, int p, ll sum) {
arb[v] = sum;
for(auto [i, id] : g[v]) if(i!=p) {
reroot_cost(i, v, sum-cst[id]+cst[id^1]);
}
}
ll greedy[maxn], used[maxn];
array<ll, 2> find_leaf(int v, int p) {
array<ll, 2> ans = {0, v};
for(auto [i, id] : g[v]) if(i != p) {
auto t = find_leaf(i, v);
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... |