# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
517049 | Ai7081 | Stations (IOI20_stations) | C++17 | 2257 ms | 2097156 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>
using namespace std;
const int N = 1005;
int cnt;
vector<int> adj[N], ret;
void dfs1(int v, int p) {
ret[v] = cnt++;
for (auto to : adj[v]) {
if (to != p) {
dfs1(to, v);
}
}
return;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for (int i=0; i<u.size(); i++) {
adj[u[i]].push_back(v[i]);
adj[v[i]].push_back(u[i]);
}
for (int i=0; i<n; i++) {
if (adj[i].size() == 1) {
ret.assign(n, 0);
cnt = 0;
dfs1(i, i);
return ret;
}
}
return ret;
}
int find_next_station(int s, int t, vector<int> c) {
return (s < t) ? s+1 : s-1;
}
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... |