# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
891670 | vjudge1 | Highway Tolls (IOI18_highway) | C++17 | 1861 ms | 262144 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 "highway.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using ii = pair<int, int>;
vector<ii> E;
struct tree {
int n;
vi par, par_cent, sz;
vector<vi> L, G;
tree(int N) : n(N), L(N), par(N), par_cent(N), sz(N), G(N) {}
void add_edge(int u, int v) {
L[u].push_back(v);
L[v].push_back(u);
}
void init() {
vi on(n, 1);
function<void(int, int)> dfs_sz = [&](int u, int p) {
sz[u] = 1;
for(auto it : L[u]) {
if(on[it] && it != p) {
dfs_sz(it, u);
sz[u] += sz[it];
}
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... |