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 what_is(a) cout << #a << " is " << a << "\n"
#define checker(a) cout <"checker reached " << a << "\n"
vector<vector<int>> adj(1000,vector<int>());
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
vector<int> lbl(n);
for(int i=0;i<n;i++)
lbl[i] = i;
return lbl;
}
int find_next_station(int s, int t, std::vector<int> c) {
int a =s,b=t;
while(a>0){
a= (a-1)/2;
if(a==b)break;
}
if(a==b)return (s-1)/2;
a=s,b=t;
int p=b;
while(b>0){
p=b;
b = (b-1)/2;
if(a==b)break;
}
if(a==b)return p;
return (s-1)/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... |