# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
780949 | Blagoj | Stations (IOI20_stations) | C++17 | 884 ms | 548 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>
#include "stations.h"
using namespace std;
vector<int> g[1005];
int in[1005], out[1005], parent[1005], timer = 0;
void dfs(int n, int p) {
in[n] = timer++;
parent[n] = p;
for (auto x : g[n]) if (x != p) dfs(x, n);
out[n] = timer - 1;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for (int i = 0; i < n; i++) g[i].clear();
timer = 0;
for (int i = 0; i < u.size(); i++) {
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
dfs(0, -1);
vector<int> labels(n);
for (int i = 0; i < n; i++) labels[i] = i;
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
for (auto x : c) if (in[x] <= in[t] && in[t] <= out[x]) return x;
return parent[s];
}
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... |