# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
307120 | dxz05 | Stations (IOI20_stations) | C++14 | 1029 ms | 1140 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 MAXN = 1111;
vector<int> g[MAXN];
vector<int> vec;
void dfs(int v, int p){
vec.push_back(v);
for (int u : g[v]){
if (u != p) dfs(u, v);
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for (int i = 0; i < n; i++) g[i].clear(); vec.clear();
vector<int> labels(n);
for (int i = 0; i < n - 1; i++){
g[u[i]].push_back(v[i]);
g[v[i]].push_back(u[i]);
}
int idx = 0;
for (int i = 0; i < n; i++){
if (g[i].size() == 1) idx = i;
}
dfs(idx, -1);
for (int i = 0; i < n; i++){
labels[vec[i]] = i;
}
return labels;
}
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... |