#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
const int N=1005;
vector<int>lab(N);
int t=1;
vector<int>G[N];
void dfs(int u=0,int p=-1,bool f=1){
if(f){
lab[u]=t;
t++;
}
for(auto v:G[u]){
if(v==p) continue;
dfs(v,u,!f);
}
if(!f){
lab[u]=t;
t++;
}
}
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
for(int i=0;i<n-1;i++){
G[u[i]].push_back(v[i]);
G[v[i]].push_back(u[i]);
}
dfs();
vector<int>ans;
for(int i=0;i<n;i++) ans.push_back(lab[i]);
return ans;
for(int i=0;i<n;i++) G[i].clear();
}
int find_next_station(int s, int t, vector<int> c) {
int n=c.size();
if(n==1) return c[0];
if(s<c[0]){
c.insert(begin(c),s);
for(int i=1;i<n;i++){
if(t<=c[i] and t>c[i-1]) return c[i];
}
return c[n];
}
c.insert(end(c)-1,s);
for(int i=n-1;i>0;i--){
if(t>=c[i] and t<c[i+1]) return c[i];
}
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... |