#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
vector<int> label(int n, int k, vector<int> u, vector<int> v) {
vector<int> labels(n);
for (int i = 0; i < n ; i++) {
labels[i] = i;
}
return labels;
}
int find_next_station(int s, int t, vector<int> c) {
int uptar = t;
while(uptar != 0 and (uptar - 1)/2 != s)
uptar = (uptar - 1)/2;
if (uptar == 0) return (s - 1)/2;
return uptar;
}
/************/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
638 ms |
400 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
523 ms |
400 KB |
Output is correct |
2 |
Correct |
669 ms |
488 KB |
Output is correct |
3 |
Correct |
924 ms |
400 KB |
Output is correct |
4 |
Correct |
718 ms |
488 KB |
Output is correct |
5 |
Correct |
734 ms |
616 KB |
Output is correct |
6 |
Correct |
458 ms |
484 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
524 ms |
488 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1085 ms |
400 KB |
Output is correct |
2 |
Incorrect |
813 ms |
400 KB |
Wrong query response. |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
636 ms |
568 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |