#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
const long long INF = 1e18;
long long findGap(int T, int N) {
multiset < pair< long long,pair<long long,long long> > > st;
long long mn, mx;
MinMax(0ll,INF,&mn,&mx);
st.insert({-(mx-mn),{mn,mx}});
long long ans = 0;
if(N == 2){
return mx - mn;
}
if (T == 1){
for (int i=1;i<(N+1)/2;i++){
long long mmn, mmx;
MinMax(mn+1,mx-1,&mmn,&mmx);
ans = max(ans,mmn-mn);
ans = max(ans,mx-mmx);
mn = mmn;
mx = mmx;
}
ans = max(ans,mx-mn);
return ans;
}
long long mnds = (mx-mn)/(N-1);
int kk = 0;
if(mn != -1) kk++;
if(mn != mx) kk++;
while(!st.empty()) {
long long L, R;
if(abs(st.begin()->first) <= ans)
return ans;
L = st.begin()->second.first;
R = st.begin()->second.second;
st.erase(st.begin());
long long a1, a2, a3, a4;
a1 = a1 = a3 = a4 = -1;
if(L != (L+R)/2 && ((L+R)/2-L) >= mnds) {
MinMax(L,(L+R)/2,&a1,&a2);
if(a1 != -1) kk++;
if(a2 != a1) kk++;
}
if(R != (L+R)/2+1 && (R-(L+R)/2+1) >= mnds) {
MinMax((L+R)/2+1,R,&a3,&a4);
if(a3 != -1) kk++;
if(a4 != a1) kk++;
}
if(a1 == a2 && a1 != -1)
ans = max(ans,a2-L);
if(a2-a1 == 1 && a1 != -1)
ans = max(ans,1ll);
if(a1-L == 1 && a1 != -1)
ans = max(ans,1ll);
if(a3 == a4 && a4 != -1)
ans = max(ans,R-a3);
if(a4-a3 == 1 && a3 != -1)
ans = max(ans,1ll);
if(R-a4 == 1 && a4 != -1)
ans = max(ans,1ll);
if(a2 != -1 && a3 != -1)
ans = max(ans,a3-a2);
if(a3 == -1 && a1 == -1)
ans = max(ans,R-L);
if(a1 == -1 && a3 != -1)
ans = max(ans,a3-L);
if(a3 == -1 && a2 != -1)
ans = max(ans,R-a2);
if(a1 != -1 && a1-L > 1)
st.insert({L-a1,{L,a1}});
if(a1 != -1 && a2-a1 > 1)
st.insert({a1-a2,{a1,a2}});
if(a1 != -1 && a3 != -1 && a3-a2 > 1)
st.insert({a2-a3,{a2,a3}});
if(a3 != -1 && a4-a3 > 1)
st.insert({a3-a4,{a3,a4}});
if(a3 != -1 && R-a4 > 1)
st.insert({a4-R,{a4,R}});
}
return ans;
return 0;
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:47:25: warning: operation on 'a1' may be undefined [-Wsequence-point]
a1 = a1 = a3 = a4 = -1;
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 5 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 6 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 7 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 8 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 9 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 10 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 11 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 12 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 15 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 16 |
Correct |
13 ms |
5144 KB |
Output is correct |
| 17 |
Correct |
9 ms |
5144 KB |
Output is correct |
| 18 |
Correct |
13 ms |
5144 KB |
Output is correct |
| 19 |
Correct |
19 ms |
5144 KB |
Output is correct |
| 20 |
Correct |
9 ms |
5144 KB |
Output is correct |
| 21 |
Correct |
56 ms |
5144 KB |
Output is correct |
| 22 |
Correct |
56 ms |
5144 KB |
Output is correct |
| 23 |
Correct |
66 ms |
5144 KB |
Output is correct |
| 24 |
Correct |
59 ms |
5144 KB |
Output is correct |
| 25 |
Correct |
53 ms |
5144 KB |
Output is correct |
| 26 |
Correct |
59 ms |
5144 KB |
Output is correct |
| 27 |
Correct |
63 ms |
5144 KB |
Output is correct |
| 28 |
Correct |
49 ms |
5144 KB |
Output is correct |
| 29 |
Correct |
79 ms |
5144 KB |
Output is correct |
| 30 |
Correct |
36 ms |
5144 KB |
Output is correct |
| 31 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 32 |
Correct |
0 ms |
5144 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 2 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 3 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 4 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 5 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 6 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 7 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 8 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 9 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 10 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 11 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 12 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 13 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 14 |
Partially correct |
0 ms |
5144 KB |
Partially correct |
| 15 |
Partially correct |
0 ms |
5276 KB |
Partially correct |
| 16 |
Partially correct |
16 ms |
5540 KB |
Partially correct |
| 17 |
Partially correct |
13 ms |
5540 KB |
Partially correct |
| 18 |
Partially correct |
13 ms |
5408 KB |
Partially correct |
| 19 |
Partially correct |
16 ms |
5408 KB |
Partially correct |
| 20 |
Partially correct |
3 ms |
5144 KB |
Partially correct |
| 21 |
Partially correct |
56 ms |
6200 KB |
Partially correct |
| 22 |
Partially correct |
59 ms |
6200 KB |
Partially correct |
| 23 |
Partially correct |
56 ms |
6200 KB |
Partially correct |
| 24 |
Partially correct |
56 ms |
6200 KB |
Partially correct |
| 25 |
Partially correct |
173 ms |
11348 KB |
Partially correct |
| 26 |
Partially correct |
63 ms |
6200 KB |
Partially correct |
| 27 |
Partially correct |
69 ms |
6200 KB |
Partially correct |
| 28 |
Partially correct |
66 ms |
6464 KB |
Partially correct |
| 29 |
Partially correct |
63 ms |
6200 KB |
Partially correct |
| 30 |
Partially correct |
19 ms |
5144 KB |
Partially correct |
| 31 |
Correct |
0 ms |
5144 KB |
Output is correct |
| 32 |
Correct |
0 ms |
5144 KB |
Output is correct |
