# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
606132 | polya | Stations (IOI20_stations) | C++14 | 0 ms | 0 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"
using namespace std;
vector<int> adj[1004];
vector<int> labels;
int cnt = 0;
void dfs(int nn, int pp) {
labels[nn] = cnt++;
for (auto &i : adj[nn]) if (i != pp) dfs(i);
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for (int i=0; i<n; i++) adj[i].clear();
labels.resize(n, 10000);
for (int i=0; i<n-1; i++) {
adj[u[i]].emplace_back(v[i]);
adj[v[i]].emplace_back(u[i]);
}
for (int i=0; i<n; i++) {
if (adj[i].size() == 1) { dfs(i, -1); return labels;}
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
if (s < t) return s+1;
else return s-1;
}