#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
#define what_is(a) cout << #a << " is " << a << "\n"
#define checker(a) cout <"checker reached " << a << "\n"
vector<vector<int>> adj(1000,vector<int>());
std::vector<int> label(int n, int k, std::vector<int> u, std::vector<int> v) {
vector<int> lbl(n);
for(int i=0;i<n;i++)
lbl[i] = i;
return lbl;
}
int find_next_station(int s, int t, std::vector<int> c) {
int a =s,b=t;
while(a>0){
a= (a-1)/2;
if(a==b)break;
}
if(a==b)return (s-1)/2;
a=s,b=t;
int p=b;
while(b>0){
p=b;
b = (b-1)/2;
if(a==b)break;
}
if(a==b)return p;
return (s-1)/2;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
616 ms |
520 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
502 ms |
508 KB |
Output is correct |
2 |
Correct |
618 ms |
520 KB |
Output is correct |
3 |
Correct |
1220 ms |
512 KB |
Output is correct |
4 |
Correct |
871 ms |
512 KB |
Output is correct |
5 |
Correct |
623 ms |
400 KB |
Output is correct |
6 |
Correct |
633 ms |
512 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
611 ms |
508 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1043 ms |
400 KB |
Output is correct |
2 |
Incorrect |
668 ms |
400 KB |
Wrong query response. |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
655 ms |
512 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |