#include "stations.h"
#include <vector>
#include <queue>
using namespace std;
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
std::vector<int> labels(n);
for (int i = 0; i < n; i++) {
labels[i] = i;
}
return labels;
}
int find_next_station(int s, int t, std::vector<int> c) {
if(s>t)return (s-1)/2;
while(s<(t-1)/2)t = (t-1)/2;
if ((t-1)/2 == s) return t;
return (s-1)/2;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
355 ms |
684 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
309 ms |
684 KB |
Output is correct |
2 |
Correct |
362 ms |
684 KB |
Output is correct |
3 |
Correct |
597 ms |
684 KB |
Output is correct |
4 |
Correct |
492 ms |
684 KB |
Output is correct |
5 |
Correct |
449 ms |
684 KB |
Output is correct |
6 |
Correct |
325 ms |
684 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
345 ms |
684 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
631 ms |
684 KB |
Output is correct |
2 |
Incorrect |
464 ms |
684 KB |
Wrong query response. |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
318 ms |
684 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |