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;
vector<int> label(int n, int k, vector<int> u, vector<int> v){
vector<int> labels(n);
for(int i = 0; i < n; i++)
labels[i] = i;
return labels;
}
int find_next_station(int s, int t, vector<int> c){
while(true){
if(t <= s) return c[0];
if(t == 2 * s + 1 || t == 2 * s + 2) break;
t >>= 1;
}
return t;
}
/*
1
5 10
0 1
1 2
1 3
2 4
*/
# | 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... |