#include "stations.h"
#include <vector>
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(c[0]<c[1]){
int temp=c[0];
c[0]=c[1];
c[1]=temp;
}
return (s<t)?c[0]:c[1];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
569 ms |
860 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
506 ms |
848 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
662 ms |
988 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
994 ms |
736 KB |
Output is correct |
2 |
Incorrect |
789 ms |
1012 KB |
Wrong query response. |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
553 ms |
756 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |