# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
361937 | valerikk | Stations (IOI20_stations) | C++17 | 877 ms | 1120 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 <vector>
using namespace std;
const int N = 1007;
vector<int> g[N];
int tin[N], tout[N], t;
void dfs(int v, int p = -1) {
tin[v] = t++;
for (int u : g[v]) {
if (u != p) dfs(u, v);
}
tout[v] = t;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for (int i = 0; i < n; i++) g[i].clear();
for (int i = 0; i < n - 1; i++) {
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
t = 0;
dfs(0);
tout[0] = n - 1;
vector<int> l(n);
for (int i = 0; i < n; i++) l[i] = tin[i]*1000 + tout[i];
return l;
}
void fun(int v) {
tin[v] = v / 1000;
tout[v] = v % 1000;
}
int find_next_station(int s, int t, vector<int> c) {
fun(s); fun(t);
for (int v : c) fun(v);
int p;
for (int v : c) {
if (tin[v] <= tin[s] && tout[v] >= tout[s]) {
p = v;
continue;
}
if (tin[v] <= tin[t] && tout[v] >= tout[t]) return v;
}
return p;
}
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... |