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){
if(s > t) return c[0];
int x = t, cnt = 0;
while(true){
if(!x && s) return c[0];
x >>= 1;
cnt++;
if(x == s) break;
}
return t >> (cnt - 1);
}
# | 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... |