#include "gap.h"
#include <vector>
#include <iostream>
#include <assert.h>
#include <algorithm>
using namespace std;
typedef long long ll;
ll INF=1e18;
ll S=1e15;
ll K=2;
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 |
4 ms |
484 KB |
Output is correct |
3 |
Correct |
3 ms |
540 KB |
Output is correct |
4 |
Correct |
2 ms |
564 KB |
Output is correct |
5 |
Correct |
2 ms |
564 KB |
Output is correct |
6 |
Correct |
2 ms |
564 KB |
Output is correct |
7 |
Correct |
2 ms |
564 KB |
Output is correct |
8 |
Correct |
2 ms |
588 KB |
Output is correct |
9 |
Correct |
2 ms |
636 KB |
Output is correct |
10 |
Correct |
2 ms |
636 KB |
Output is correct |
11 |
Correct |
3 ms |
636 KB |
Output is correct |
12 |
Correct |
3 ms |
636 KB |
Output is correct |
13 |
Correct |
4 ms |
636 KB |
Output is correct |
14 |
Correct |
3 ms |
704 KB |
Output is correct |
15 |
Correct |
2 ms |
704 KB |
Output is correct |
16 |
Correct |
18 ms |
1216 KB |
Output is correct |
17 |
Correct |
17 ms |
1228 KB |
Output is correct |
18 |
Correct |
33 ms |
1228 KB |
Output is correct |
19 |
Correct |
17 ms |
1304 KB |
Output is correct |
20 |
Correct |
18 ms |
1304 KB |
Output is correct |
21 |
Correct |
69 ms |
2636 KB |
Output is correct |
22 |
Correct |
69 ms |
2636 KB |
Output is correct |
23 |
Correct |
66 ms |
2636 KB |
Output is correct |
24 |
Correct |
77 ms |
2664 KB |
Output is correct |
25 |
Correct |
75 ms |
2664 KB |
Output is correct |
26 |
Correct |
66 ms |
2664 KB |
Output is correct |
27 |
Correct |
70 ms |
2664 KB |
Output is correct |
28 |
Correct |
86 ms |
2664 KB |
Output is correct |
29 |
Correct |
60 ms |
2664 KB |
Output is correct |
30 |
Correct |
58 ms |
2664 KB |
Output is correct |
31 |
Correct |
4 ms |
2664 KB |
Output is correct |
32 |
Correct |
4 ms |
2664 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Partially correct |
2 ms |
2664 KB |
Partially correct |
2 |
Partially correct |
2 ms |
2664 KB |
Partially correct |
3 |
Partially correct |
3 ms |
2664 KB |
Partially correct |
4 |
Partially correct |
2 ms |
2664 KB |
Partially correct |
5 |
Partially correct |
2 ms |
2664 KB |
Partially correct |
6 |
Partially correct |
3 ms |
2664 KB |
Partially correct |
7 |
Partially correct |
4 ms |
2664 KB |
Partially correct |
8 |
Partially correct |
5 ms |
2664 KB |
Partially correct |
9 |
Partially correct |
3 ms |
2664 KB |
Partially correct |
10 |
Partially correct |
3 ms |
2664 KB |
Partially correct |
11 |
Partially correct |
29 ms |
2664 KB |
Partially correct |
12 |
Partially correct |
41 ms |
2664 KB |
Partially correct |
13 |
Partially correct |
37 ms |
2664 KB |
Partially correct |
14 |
Partially correct |
45 ms |
2664 KB |
Partially correct |
15 |
Partially correct |
15 ms |
2664 KB |
Partially correct |
16 |
Partially correct |
587 ms |
2664 KB |
Partially correct |
17 |
Partially correct |
639 ms |
2664 KB |
Partially correct |
18 |
Partially correct |
549 ms |
2664 KB |
Partially correct |
19 |
Partially correct |
550 ms |
2664 KB |
Partially correct |
20 |
Partially correct |
33 ms |
2664 KB |
Partially correct |
21 |
Execution timed out |
2065 ms |
2836 KB |
Time limit exceeded |
22 |
Execution timed out |
2081 ms |
2836 KB |
Time limit exceeded |
23 |
Execution timed out |
2059 ms |
2836 KB |
Time limit exceeded |
24 |
Execution timed out |
2045 ms |
2836 KB |
Time limit exceeded |
25 |
Partially correct |
1359 ms |
2836 KB |
Partially correct |
26 |
Execution timed out |
2062 ms |
2836 KB |
Time limit exceeded |
27 |
Execution timed out |
2070 ms |
2836 KB |
Time limit exceeded |
28 |
Execution timed out |
2073 ms |
2836 KB |
Time limit exceeded |
29 |
Execution timed out |
2058 ms |
2836 KB |
Time limit exceeded |
30 |
Partially correct |
109 ms |
2836 KB |
Partially correct |
31 |
Partially correct |
3 ms |
2836 KB |
Partially correct |
32 |
Partially correct |
3 ms |
2836 KB |
Partially correct |