# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
321512 | NachoLibre | Stations (IOI20_stations) | C++14 | 1124 ms | 1280 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;
const int N = 1003;
vector<int> v[N], dr;
int tn;
void sgd(int dg, int op, int dt) {
if(dt & 1 ^ 1) dr[dg] = tn, ++tn;
for(int i = 0; i < v[dg].size(); ++i) {
if(v[dg][i] != op) {
sgd(v[dg][i], dg, dt + 1);
}
}
if(dt & 1) dr[dg] = tn, ++tn;
}
vector<int> label(int n, int k, vector<int> x, vector<int> y) {
for(int i = 0; i < n; ++i) v[i].clear();
for(int i = 0; i < n - 1; ++i) {
v[x[i]].push_back(y[i]);
v[y[i]].push_back(x[i]);
}
dr.clear();
for(int i = 0; i < n; ++i) dr.push_back(0);
tn = 0;
sgd(0, -1, 0);
return dr;
}
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... |