# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
333458 | sabamaku | 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"
#include <bits/stdc++.h>
#define f first
#define s second
using namespace std;
int cnt;
pair <int,int> d[20005];
vector <int> vi[2005];
void dfs(int x,int p){
d[x].f = cnt++;
for (int j = 0; j < vi[x].size(); j++){
int to = vi[x][j];
if (to == p) continue;
dfs(to,x);
}
d[x].s = cnt++;
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels;
for (int i = 0; i < 1001; i++){
vi[i].clear();
d[i].f = 0;
d[i].f = d[i].s;
}
for (int i = 0; i < u.size(); i++){
vi[u[i]].pb(v[i]);
vi[v[i]].pb(u[i]);
}
cnt = 0;
dfs(0,0);
for (int i = 0; i < n; i++)
labels.pb((d[i].f) * 1000 + d[i].s);
return labels;
}
int find_next_station(int s, int t, vector<int> v1) {
if (s / 1000 < t / 1000){
for (int i = 1; i < v1.size();i++)
if (t / 1000 >= v1[i] / 1000 && v1[i] % 1000 >= t % 1000) return v1[i];
}
return v1[0];
}