# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
305073 | Haunted_Cpp | Stations (IOI20_stations) | C++17 | 1178 ms | 1024 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;
const int MAX_N = 1e3 + 5;
vector<vector<int>> g(MAX_N);
int Time = -1, in[MAX_N], out[MAX_N];
void dfs(int node, int p) {
in[node] = ++Time;
for (auto to : g[node]) {
if (to != p) {
dfs(to, node);
}
}
out[node] = Time;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
Time = -1;
g.clear(); g.resize(MAX_N);
vector<int> labels(n);
for (int i = 0; i < n - 1; i++) {
g[u[i]].emplace_back(v[i]);
g[v[i]].emplace_back(u[i]);
}
dfs(0, -1);
for (int i = 0; i < n; i++) {
labels[i] = in[i] * 1000 + out[i];
}
# | 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... |