#include "stations.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(),v.end()
#define pb push_back
#define SZ(a) ((int)a.size())
vector<int> idx;
vector<int> label(int n, int k, vector<int> u, vector<int> v)
{
idx.resize(n);
for(int i=0;i<n;++i)
idx[i]=i;
return idx;
}
int find_next_station(int s, int t, vector<int> c)
{
int x=t;
while(x>s)
x>>=1;
if(x==s)
{
for(int x=t;x/2!=s;x>>=1);
return x;
}
return s>>1;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
560 ms |
760 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
580 ms |
748 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
735 ms |
768 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
961 ms |
1040 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
638 ms |
768 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |