#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int p;
vector<int> ret;
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
ret.assign(n, 0);
for (int i=0; i<n; i++) ret[i] = i+1;
return ret;
}
int find_next_station(int s, int t, vector<int> c) {
//s++, t++;
if (t < s) return s/2;
while (t != s) {
p = t;
t = (t>>1);
}
return p;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3038 ms |
488 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3030 ms |
404 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3044 ms |
468 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
867 ms |
400 KB |
Output is correct |
2 |
Execution timed out |
3029 ms |
400 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3035 ms |
480 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |