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
vector<int> l,AL[1005];
int deg[1005];
vector<int> label(int n,int k,vector<int> u,vector<int> v){
l.resize(n,-1);
for(int i=0;i<n;++i){
AL[i].clear();
deg[i]=0;
}
for(int i=0;i<n-1;++i){
++deg[u[i]];
++deg[v[i]];
AL[u[i]].pb(v[i]);
AL[v[i]].pb(u[i]);
}
for(int i=0;i<n;++i){
if(deg[i]==1){
int u=i;
l[u]=0;
while(true){
for(int v:AL[u]){
if(l[v]==-1){
l[v]=l[u]+1;
u=v;break;
}
}
if(AL[u].size()==1)break;
}
break;
}
}
return l;
}
int find_next_station(int s,int t,vector<int> c){
if(c.size()==1)return c[0];
if(s>t&&s>c[0])return c[0];
if(s>t&&s>c[1])return c[1];
if(s<t&&s<c[0])return c[0];
if(s<t&&s<c[1])return c[1];
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... |