# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
672640 | tbzard | Stations (IOI20_stations) | C++14 | 916 ms | 756 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;
void dfs1(int u, int p, vector<int> &weight, vector<vector<int> > &g){
weight[u] = 1;
for(int i=0;i<g[u].size();i++){
int v = g[u][i];
if(v != p){
dfs1(v, u, weight, g);
weight[u] += weight[v];
}
}
}
void dfs2(int u, int p, int d, int l, int r, vector<int> &ans, vector<int> &weight, vector<vector<int> > &g){
if(d%2 == 0){
ans[u] = l;
l++;
}
else{
ans[u] = r;
r--;
}
for(int i=0;i<g[u].size();i++){
int v = g[u][i];
if(v != p){
dfs2(v, u, d+1, l, l+weight[v]-1, ans, weight, g);
l += weight[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... |