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;
const int nx=1e3+5;
vector<int> res;
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
res.resize(n);
for (int i=0; i<n; i++) res[i]=i;
return res;
}
int find_next_station(int s, int t, std::vector<int> c) {
if (c.size()==1) return c[0];
s++;
t++;
for (auto &x:c) x++;
while (t>s)
{
if (c[0]==t) return c[0]-1;
if (c[1]==t) return c[1]-1;
if (c.size()>2&&c[2]==t) return c[2]-1;
t/=2;
}
return c[0]-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... |