# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
796774 | alexander707070 | 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<bits/stdc++.h>
#define MAXN 1007
using namespace std;
int n,st,et;
vector<int> sol,v[MAXN];
int tim,in[MAXN],out[MAXN];
void dfs(int x,int p,int dep){
in[x]=tim; tim++;
for(int i=0;i<v[x].size();i++){
if(v[x][i]!=p)dfs(v[x][i],x,dep+1);
}
out[x]=tim; tim++;
if(dep%2==0)sol[x]=in[x];
else sol[x]=out[x];
}
vector<int> label(int N, int k,vector<int> from,vector<int> to){
n=N;
sol.resize(n);
for(int i=0;i<n;i++){
v[i].clear(); vis[i]=false;
}
tim=0;
for(int i=0;i<n-1;i++){
v[from[i]].push_back(to[i]);
v[to[i]].push_back(from[i]);
}
dfs(0,-1,0);
return sol;
}
int find_next_station(int s, int t,vector<int> c){
if(s==0){
st=s+1;
for(int i=0;i<c.size();i++){
if(t>st and t<c[i])return c[i];
}
}else if(s<c[0]){
st=s+1;
for(int i=0;i<c.size()-1;i++){
if(t>st and t<c[i])return c[i];
st=c[i]+1;
}
return c[c.size()-1];
}else{
et=s-1;
for(int i=c.size()-1;i>=1;i--){
if(t>c[i] and t<et)return c[i];
}
return c[0];
}
}