///~~~LOTA~~~///
//#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define append push_back
#define add insert
#define nl '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(),(x).end()
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define terminator main
#define N 1000
vector<int> label(int n,int k,vector<int> u,vector<int> v){
vector<int> l;
for(int i=0;i<n;i++)
l.append(i);
return(l);
}
int find_next_station(int s,int t,vector<int> c){
int n,m;
n=t;
while(1){
m=(n-1)/2;
if(m<=s)
break;
n=m;
}
m=(n-1)/2;
if(m==s)
return n;
return (s-1)/2;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
386 ms |
684 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
261 ms |
684 KB |
Output is correct |
2 |
Correct |
368 ms |
684 KB |
Output is correct |
3 |
Correct |
638 ms |
684 KB |
Output is correct |
4 |
Correct |
449 ms |
684 KB |
Output is correct |
5 |
Correct |
413 ms |
684 KB |
Output is correct |
6 |
Correct |
329 ms |
684 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
413 ms |
688 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
565 ms |
684 KB |
Output is correct |
2 |
Incorrect |
431 ms |
956 KB |
Wrong query response. |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
330 ms |
684 KB |
Wrong query response. |
2 |
Halted |
0 ms |
0 KB |
- |