#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 |
1 |
Incorrect |
368 ms |
808 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
287 ms |
816 KB |
Output is correct |
2 |
Correct |
305 ms |
784 KB |
Output is correct |
3 |
Correct |
517 ms |
684 KB |
Output is correct |
4 |
Correct |
404 ms |
684 KB |
Output is correct |
5 |
Correct |
337 ms |
684 KB |
Output is correct |
6 |
Correct |
283 ms |
708 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
359 ms |
1016 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
626 ms |
700 KB |
Output is correct |
2 |
Incorrect |
453 ms |
692 KB |
Wrong query response. |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
385 ms |
832 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |