#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;
while(ri-le > rez)
{
pair<int,int> aux = qry(le+1,ri-1);
if(aux.first==-1)
break;
rez = max(rez, aux.first-le);
rez = max(rez, ri-aux.second);
le = aux.first;
ri = aux.second;
}
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 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 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 |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
344 KB |
Output is correct |
13 |
Correct |
0 ms |
344 KB |
Output is correct |
14 |
Correct |
1 ms |
344 KB |
Output is correct |
15 |
Correct |
1 ms |
344 KB |
Output is correct |
16 |
Correct |
7 ms |
428 KB |
Output is correct |
17 |
Correct |
7 ms |
652 KB |
Output is correct |
18 |
Correct |
8 ms |
600 KB |
Output is correct |
19 |
Correct |
6 ms |
564 KB |
Output is correct |
20 |
Correct |
5 ms |
600 KB |
Output is correct |
21 |
Correct |
34 ms |
1080 KB |
Output is correct |
22 |
Correct |
25 ms |
1364 KB |
Output is correct |
23 |
Correct |
25 ms |
1112 KB |
Output is correct |
24 |
Correct |
25 ms |
1244 KB |
Output is correct |
25 |
Correct |
22 ms |
1112 KB |
Output is correct |
26 |
Correct |
25 ms |
1112 KB |
Output is correct |
27 |
Correct |
25 ms |
1112 KB |
Output is correct |
28 |
Correct |
25 ms |
1112 KB |
Output is correct |
29 |
Correct |
35 ms |
1104 KB |
Output is correct |
30 |
Correct |
22 ms |
1112 KB |
Output is correct |
31 |
Correct |
0 ms |
344 KB |
Output is correct |
32 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Output isn't correct |
2 |
Partially correct |
0 ms |
344 KB |
Partially correct |
3 |
Partially correct |
0 ms |
344 KB |
Partially correct |
4 |
Partially correct |
0 ms |
344 KB |
Partially correct |
5 |
Partially correct |
0 ms |
344 KB |
Partially correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
0 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 |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
0 ms |
344 KB |
Output is correct |
13 |
Correct |
0 ms |
344 KB |
Output is correct |
14 |
Correct |
0 ms |
344 KB |
Output is correct |
15 |
Partially correct |
1 ms |
344 KB |
Partially correct |
16 |
Correct |
5 ms |
440 KB |
Output is correct |
17 |
Correct |
5 ms |
600 KB |
Output is correct |
18 |
Correct |
7 ms |
600 KB |
Output is correct |
19 |
Correct |
6 ms |
600 KB |
Output is correct |
20 |
Correct |
4 ms |
600 KB |
Output is correct |
21 |
Correct |
17 ms |
1012 KB |
Output is correct |
22 |
Correct |
17 ms |
1112 KB |
Output is correct |
23 |
Correct |
20 ms |
1364 KB |
Output is correct |
24 |
Correct |
17 ms |
1108 KB |
Output is correct |
25 |
Partially correct |
33 ms |
1112 KB |
Partially correct |
26 |
Correct |
18 ms |
1112 KB |
Output is correct |
27 |
Correct |
17 ms |
1112 KB |
Output is correct |
28 |
Correct |
17 ms |
1112 KB |
Output is correct |
29 |
Correct |
16 ms |
1112 KB |
Output is correct |
30 |
Correct |
15 ms |
1240 KB |
Output is correct |
31 |
Partially correct |
0 ms |
344 KB |
Partially correct |
32 |
Correct |
0 ms |
344 KB |
Output is correct |