#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> g[200001];
int used[200001];
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
vector<int> l(n);
for(int i=0;i<n;i++)
g[i].clear(),used[i]=0;
for(int i=0;i<n-1;i++)
g[u[i]].push_back(v[i]),g[v[i]].push_back(u[i]);
for(int i=0;i<n;i++)
l[i]=i;
return l;
}
int find_next_station(int s, int t, std::vector<int> c)
{
//cout<<s<<" ! "<<t<<endl;
vector<int> h={};
if(s<t)
{
while(s<=t)
{
//cout<<"- "<<t<<endl;
h.push_back(t);
if(t==0)break;
t=(t-1)/2;
}
if(h[h.size()-1]==s)return h[h.size()-2];
}
return s/2;
}
# | 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... |