#include <bits/stdc++.h>
using namespace std;
vector <int> label(int n, int k, vector <int> u, vector <int> v)
{
vector <int> arr;
for (int i = 0; i < n; i++)
{
arr.push_back(i);
}
return arr;
}
int find_next_station(int s, int t, vector<int> c)
{
if (t > s) return s + 1;
else return s - 1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
344 ms |
780 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
292 ms |
800 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
344 ms |
684 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
605 ms |
684 KB |
Output is correct |
2 |
Incorrect |
386 ms |
684 KB |
Wrong query response. |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
326 ms |
684 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |