#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int INF = 1e18;
pair<int,int> qry(int le, int ri)
{
pair<int,int> aux;
MinMax(le,ri,&aux.first,&aux.second);
return aux;
}
long long bigsolve(int N)
{
int rez=1;
pair<int,int> tot = qry(0,INF);
int cur=tot.first;
while(tot.second - cur > rez)
{
pair<int,int> aux = qry(cur+1,cur+rez);
if(aux.first!=-1)
{
cur = aux.second;
continue;
}
int c=rez;
while(1)
{
c=(c+1)*2;
aux = qry(cur+1,cur+c);
if(aux.first!=-1)
{
rez = max(rez, aux.first - cur);
cur = aux.second;
break;
}
}
}
return rez;
}
int smallsolve(int N)
{
pair<int,int> tot = qry(0,INF);
int le=tot.first,ri=tot.second,rez=1,pozle=1,pozri=N;
while(ri-le > rez)
{
if(pozle+1<=pozri)
{
rez = max(rez, ri-le);
break;
}
pair<int,int> aux = qry(le+1,ri-1);
rez = max(rez, aux.first-le);
rez = max(rez, ri-aux.second);
le = aux.first;
ri = aux.second;
pozle++;
pozri--;
}
return rez;
}
long long findGap(int32_t T, int32_t N)
{
if(T==1 || N<=20) return smallsolve(N);
return bigsolve(N);
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 3 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 4 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 6 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 7 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 8 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 9 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 10 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 11 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 12 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 13 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 14 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 15 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 16 |
Incorrect |
6 ms |
640 KB |
Output isn't correct |
| 17 |
Incorrect |
6 ms |
600 KB |
Output isn't correct |
| 18 |
Incorrect |
3 ms |
436 KB |
Output isn't correct |
| 19 |
Incorrect |
6 ms |
600 KB |
Output isn't correct |
| 20 |
Incorrect |
2 ms |
600 KB |
Output isn't correct |
| 21 |
Incorrect |
13 ms |
1128 KB |
Output isn't correct |
| 22 |
Incorrect |
17 ms |
1112 KB |
Output isn't correct |
| 23 |
Incorrect |
16 ms |
1172 KB |
Output isn't correct |
| 24 |
Incorrect |
17 ms |
1196 KB |
Output isn't correct |
| 25 |
Incorrect |
19 ms |
1112 KB |
Output isn't correct |
| 26 |
Incorrect |
13 ms |
1112 KB |
Output isn't correct |
| 27 |
Incorrect |
17 ms |
1112 KB |
Output isn't correct |
| 28 |
Incorrect |
18 ms |
1112 KB |
Output isn't correct |
| 29 |
Incorrect |
12 ms |
1048 KB |
Output isn't correct |
| 30 |
Incorrect |
9 ms |
1112 KB |
Output isn't correct |
| 31 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| 32 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
| 5 |
Incorrect |
1 ms |
596 KB |
Output isn't correct |
| 6 |
Correct |
0 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
344 KB |
Output is correct |
| 8 |
Correct |
0 ms |
344 KB |
Output is correct |
| 9 |
Correct |
0 ms |
344 KB |
Output is correct |
| 10 |
Correct |
0 ms |
344 KB |
Output is correct |
| 11 |
Correct |
0 ms |
344 KB |
Output is correct |
| 12 |
Correct |
0 ms |
344 KB |
Output is correct |
| 13 |
Correct |
1 ms |
344 KB |
Output is correct |
| 14 |
Correct |
1 ms |
344 KB |
Output is correct |
| 15 |
Partially correct |
1 ms |
344 KB |
Partially correct |
| 16 |
Correct |
6 ms |
652 KB |
Output is correct |
| 17 |
Correct |
5 ms |
600 KB |
Output is correct |
| 18 |
Correct |
4 ms |
436 KB |
Output is correct |
| 19 |
Correct |
4 ms |
600 KB |
Output is correct |
| 20 |
Correct |
4 ms |
652 KB |
Output is correct |
| 21 |
Correct |
16 ms |
1112 KB |
Output is correct |
| 22 |
Correct |
25 ms |
1196 KB |
Output is correct |
| 23 |
Correct |
18 ms |
1112 KB |
Output is correct |
| 24 |
Correct |
27 ms |
1216 KB |
Output is correct |
| 25 |
Partially correct |
44 ms |
1156 KB |
Partially correct |
| 26 |
Correct |
28 ms |
1116 KB |
Output is correct |
| 27 |
Correct |
18 ms |
1184 KB |
Output is correct |
| 28 |
Correct |
27 ms |
1112 KB |
Output is correct |
| 29 |
Correct |
17 ms |
1208 KB |
Output is correct |
| 30 |
Correct |
20 ms |
1112 KB |
Output is correct |
| 31 |
Partially correct |
0 ms |
344 KB |
Partially correct |
| 32 |
Correct |
0 ms |
344 KB |
Output is correct |
