# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
342051 | SeDunion | Stations (IOI20_stations) | C++17 | 1111 ms | 1380 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;
vector<int> g[2002];
int tin[2002], tout[2002], timer;
void dfs(int v, vector<int> &labels, int p = -1, int d = 0) {
if (!d) labels[v] = timer++;
for (int to : g[v]) if (to != p) {
dfs(to, labels, v, d ^ 1);
}
if (d) labels[v] = timer++;
}
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
std::vector<int> labels(n);
for (int i = 0; i < n; i++) {
g[i].clear();
}
timer = 0;
for (int i = 0 ; i < n - 1 ; ++ i) {
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
dfs(1, labels);
return labels;
}
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... |