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;
#define pb push_back
typedef long long ll;
vector<int> v[1005];
int ti=0,ttin[1005],ttout[1005];
void dfs(int c,int p){
ttin[c]=++ti;
for(int x:v[c]){
if(x==p) continue;
dfs(x,c);
}
ttout[c]=ti;
}
vector<int> label(int n, int k,vector<int> u,vector<int> w){
for(int i=0;i<1005;i++) v[i].clear();
vector<int> res(n);
for(int i=0;i<n-1;i++){
v[u[i]].pb(w[i]);
v[w[i]].pb(u[i]);
}
dfs(0,0);
for(int i=0;i<n;i++) res[i]=1000*ttin[i]+ttout[i];
return res;
}
int find_next_station(int s,int t,vector<int> c) {
int sin,sout,tin,tout;
sout=s%1000;
sin=s/1000;
tout=t%1000;
tin=t/1000;
if(sin<=tin && tout<=sout){
for(int x:c){
int xin,xout;
xout=x%1000;
xin=x/1000;
if(xin<=tin && tout<=xout) return x;
}
}
return c[0];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |