# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
653280 | mychecksedad | 기지국 (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 <bits/stdc++.h>
using namespace std;
#define pb push_back
vector<int> label(int n, int k, vector<int> u, vector<int> v){
int timer = 0, tin[n], tout[n];
vector<vector<int>> g(n);
for(int i = 0; i < n-1; ++i) g[u[i]].pb(v[i]), g[v[i]].pb(u[i]);
function<void(int, int)> dfs = [&](int v, int p, int d){
if(d) tin[v] = timer++;
for(int u: g[v]){
if(u != p) dfs(u, v, d^1);
}
if(!d) tout[v] = timer++;
};
dfs(0, 0, 1);
vector<int> l;
for(int i = 0; i < n; ++i) l.pb(dep[i] % 2 == 1 ? tin[i] : tout[i]);
return l;
}
int find_next_station(int s, int t, vector<int> c){
for(int p: c){
if(p==t) return t;
}
if(s == 0){
for(int i = 0; i < c.size(); ++i){
if(c[i] >= t){
return c[i];
}
}
}
if(s <= c[0]){
int par = c.back();
if(t <= s || par <= t)
return par;
for(int i = 0; i < c.size() - 1; ++i){
if(t <= c[i]){
return c[i];
}
}
}
int par = c[0];
if(t >= s || t <= par){
return par;
}
for(int i = c.size() - 1; i >= 1; --i){
if(t >= c[i]){
return c[i];
}
}
return -1;
}