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 <bits/stdc++.h>
using namespace std;
const int N = 1005;
int p;
vector<int> ret;
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
ret.assign(n, 0);
for (int i=0; i<n; i++) ret[i] = i+1;
return ret;
}
int find_next_station(int s, int t, vector<int> c) {
//s++, t++;
if (t < s) return s/2;
while (t != s) {
p = t;
t = (t>>1);
}
return p;
}
# | 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... |