#include <bits/stdc++.h>
using namespace std;
const int N = 1005;
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> ret;
for (int i=0; i<n; i++) ret.push_back(i+1);
return ret;
}
int find_next_station(int s, int t, vector<int> c) {
//s++, t++;
if (t < s) return s/2;
int p = 0;
while (1) {
p = t;
t /= 2;
if (t == s) return p;
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3050 ms |
400 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3060 ms |
488 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3037 ms |
400 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
870 ms |
488 KB |
Output is correct |
2 |
Execution timed out |
3058 ms |
400 KB |
Time limit exceeded |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
3041 ms |
400 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |