# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
321675 | Gilgamesh | Stations (IOI20_stations) | C++17 | 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"
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1'001;
vector<int> adj[mxN];
int timer;
int temp[mxN];
void dfs(int v, int p){
temp[timer++] = v;
for(int i : adj[v]) {
if(i == p) continue;
dfs(i, v);
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels(n);
for(int i = 0; i < n - 1; ++i){
adj[u[i]].emplace_back(adj[v[i]]);
adj[v[i]].emplace_back(adj[u[i]]);
}
timer = 0;
dfs(0, -1);
for(int i = 0; i < n; ++i){
labels[i] = temp[i];
}
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
sort(c.begin(), c.end());
if(t < s) {
return c[0];
} else {
int ans = 0;
for(int i : c){
if(t < i) break;
ans = i;
}
return ans;
}
}
//int main(){}