# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
529603 | pokmui9909 | Stations (IOI20_stations) | C++17 | 1019 ms | 840 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 "stations.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll in[1005], out[1005];
vector<ll> T[1005];
ll num = -1;
void dfs(ll u, ll p){
in[u] = ++num;
for(auto v : T[u]){
if(v == p) continue;
dfs(v, u);
}
out[u] = num;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
num = -1;
for(int i = 0; i < n; i++) T[i].clear();
for(int i = 0; i < n - 1; i++){
T[u[i]].push_back(v[i]);
T[v[i]].push_back(u[i]);
}
dfs(0, -1);
vector<int> L(n);
for(int i = 0; i < n; i++){
L[i] = in[i] * 1000 + out[i];
}
return L;
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... |