#include "gap.h"
#include <vector>
#include <iostream>
#include <assert.h>
#include <algorithm>
using namespace std;
typedef long long ll;
ll INF=1e18;
ll S=1e12;
ll K=50;
ll x,y;
vector<ll> V;
void F(ll a, ll b){
MinMax(a,b,&x,&y);
if(x==-1)return;
if(a==b)
V.push_back(a);
else{
ll p=(b-a+K-1)/K;
for(ll i=a;i<=b;i+=p)
F(i,min(i+p-1,b));
}
}
long long findGap(int T, int N)
{
if(T==1){
y=INF;
for(int i=0;i<(N+1)/2;i++){
MinMax(x,y,&x,&y);
if(x==-1)break;
V.push_back(x);
V.push_back(y);
x++;
y--;
if(x>y)break;
}
sort(V.begin(),V.end());
x=0;
for(int i=0;i<V.size()-1;i++)
x=max(x,V[i+1]-V[i]);
return x;
}
MinMax(INF,INF,&x,&y);
if(x!=-1)
V.push_back(INF);
for(ll i=0;i<INF;i+=S)
F(i,i+S-1);
sort(V.begin(),V.end());
x=0;
for(int i=0;i<V.size()-1;i++)
x=max(x,V[i+1]-V[i]);
return x;
}
/*
1 6
1 2 5 7 8 12
*/
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:50:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<V.size()-1;i++)
~^~~~~~~~~~~
gap.cpp:67:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<V.size()-1;i++)
~^~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
356 KB |
Output is correct |
| 3 |
Correct |
2 ms |
392 KB |
Output is correct |
| 4 |
Correct |
3 ms |
408 KB |
Output is correct |
| 5 |
Correct |
2 ms |
464 KB |
Output is correct |
| 6 |
Correct |
3 ms |
516 KB |
Output is correct |
| 7 |
Correct |
3 ms |
520 KB |
Output is correct |
| 8 |
Correct |
2 ms |
520 KB |
Output is correct |
| 9 |
Correct |
3 ms |
520 KB |
Output is correct |
| 10 |
Correct |
2 ms |
520 KB |
Output is correct |
| 11 |
Correct |
3 ms |
596 KB |
Output is correct |
| 12 |
Correct |
3 ms |
620 KB |
Output is correct |
| 13 |
Correct |
4 ms |
620 KB |
Output is correct |
| 14 |
Correct |
6 ms |
620 KB |
Output is correct |
| 15 |
Correct |
3 ms |
620 KB |
Output is correct |
| 16 |
Correct |
18 ms |
1136 KB |
Output is correct |
| 17 |
Correct |
20 ms |
1260 KB |
Output is correct |
| 18 |
Correct |
20 ms |
1260 KB |
Output is correct |
| 19 |
Correct |
18 ms |
1260 KB |
Output is correct |
| 20 |
Correct |
17 ms |
1260 KB |
Output is correct |
| 21 |
Correct |
72 ms |
2528 KB |
Output is correct |
| 22 |
Correct |
71 ms |
2532 KB |
Output is correct |
| 23 |
Correct |
78 ms |
2532 KB |
Output is correct |
| 24 |
Correct |
88 ms |
2532 KB |
Output is correct |
| 25 |
Correct |
76 ms |
2532 KB |
Output is correct |
| 26 |
Correct |
73 ms |
2536 KB |
Output is correct |
| 27 |
Correct |
85 ms |
2536 KB |
Output is correct |
| 28 |
Correct |
84 ms |
2592 KB |
Output is correct |
| 29 |
Correct |
74 ms |
2592 KB |
Output is correct |
| 30 |
Correct |
60 ms |
2592 KB |
Output is correct |
| 31 |
Correct |
3 ms |
2592 KB |
Output is correct |
| 32 |
Correct |
4 ms |
2592 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Partially correct |
31 ms |
2592 KB |
Partially correct |
| 2 |
Partially correct |
57 ms |
2592 KB |
Partially correct |
| 3 |
Partially correct |
59 ms |
2592 KB |
Partially correct |
| 4 |
Partially correct |
61 ms |
2592 KB |
Partially correct |
| 5 |
Partially correct |
79 ms |
2592 KB |
Partially correct |
| 6 |
Partially correct |
127 ms |
2592 KB |
Partially correct |
| 7 |
Partially correct |
117 ms |
2592 KB |
Partially correct |
| 8 |
Partially correct |
85 ms |
2592 KB |
Partially correct |
| 9 |
Partially correct |
86 ms |
2592 KB |
Partially correct |
| 10 |
Partially correct |
107 ms |
2592 KB |
Partially correct |
| 11 |
Partially correct |
205 ms |
2592 KB |
Partially correct |
| 12 |
Partially correct |
216 ms |
2592 KB |
Partially correct |
| 13 |
Partially correct |
193 ms |
2592 KB |
Partially correct |
| 14 |
Partially correct |
219 ms |
2592 KB |
Partially correct |
| 15 |
Partially correct |
144 ms |
2592 KB |
Partially correct |
| 16 |
Partially correct |
1803 ms |
2592 KB |
Partially correct |
| 17 |
Partially correct |
1821 ms |
2592 KB |
Partially correct |
| 18 |
Partially correct |
1812 ms |
2592 KB |
Partially correct |
| 19 |
Partially correct |
1757 ms |
2592 KB |
Partially correct |
| 20 |
Partially correct |
221 ms |
2592 KB |
Partially correct |
| 21 |
Execution timed out |
2060 ms |
2592 KB |
Time limit exceeded |
| 22 |
Execution timed out |
2075 ms |
2592 KB |
Time limit exceeded |
| 23 |
Execution timed out |
2049 ms |
2592 KB |
Time limit exceeded |
| 24 |
Execution timed out |
2070 ms |
2592 KB |
Time limit exceeded |
| 25 |
Execution timed out |
2067 ms |
2592 KB |
Time limit exceeded |
| 26 |
Execution timed out |
2067 ms |
2592 KB |
Time limit exceeded |
| 27 |
Execution timed out |
2055 ms |
2592 KB |
Time limit exceeded |
| 28 |
Execution timed out |
2061 ms |
2592 KB |
Time limit exceeded |
| 29 |
Execution timed out |
2054 ms |
2592 KB |
Time limit exceeded |
| 30 |
Partially correct |
308 ms |
2592 KB |
Partially correct |
| 31 |
Partially correct |
89 ms |
2592 KB |
Partially correct |
| 32 |
Partially correct |
72 ms |
2592 KB |
Partially correct |
