#include "gap.h"
#include <climits>
#include <vector>
using namespace std;
long long binary_solve(long long L, long long R) {
if(R - L <= 1) return R - L;
int mid = (L + R)/2;
long long qL1, qR1;
MinMax(L + 1, mid, &qL1, &qR1);
long long qL2, qR2;
MinMax(mid + 1, R - 1, &qL2, &qR2);
if(qL1 == -1 && qL2 == -1) return R - L;
long long ans = 0;
if(qL1 != -1 && qL2 != -1) ans = max(ans, qL2 - qR1);
if(qL1 != -1) {
ans = max(ans, qL1 - L);
ans = max(ans, binary_solve(qL1, qR1));
}
if(qL2 != -1) {
ans = max(ans, R - qR2);
ans = max(ans, binary_solve(qL2, qR2));
}
return ans;
}
long long findGap(int T, int N) {
long long L, R;
MinMax(0, LLONG_MAX, &L, &R);
if(T == 1) {
return binary_solve(L, R);
}
long long diff = ((R - L - 1) + (N - 2))/(N - 1);
vector<pair<long long, long long> > cands;
cands.push_back({L, L});
for(long long x = L + 1; x <= R - 1; x += diff) {
long long qL, qR;
MinMax(x, min(x + diff - 1, R - 1), &qL, &qR);
if(qL != -1) cands.push_back({qL, qR});
}
cands.push_back({R, R});
long long ans = 0;
for(int i = 1; i < cands.size(); i++) {
ans = max(ans, cands[i].first - cands[i - 1].second);
}
return ans;
}
Compilation message
gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:52:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 1; i < cands.size(); i++) {
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
2 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
3 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
4 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
5 |
Incorrect |
0 ms |
4300 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
7 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
8 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
9 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
10 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
11 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
12 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
13 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
14 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
15 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
16 |
Incorrect |
6 ms |
4300 KB |
Unexpected end of file - int64 expected |
17 |
Incorrect |
6 ms |
4300 KB |
Unexpected end of file - int64 expected |
18 |
Incorrect |
6 ms |
4300 KB |
Unexpected end of file - int64 expected |
19 |
Incorrect |
3 ms |
4300 KB |
Unexpected end of file - int64 expected |
20 |
Incorrect |
3 ms |
4300 KB |
Unexpected end of file - int64 expected |
21 |
Incorrect |
26 ms |
4300 KB |
Unexpected end of file - int64 expected |
22 |
Incorrect |
23 ms |
4300 KB |
Unexpected end of file - int64 expected |
23 |
Incorrect |
23 ms |
4300 KB |
Unexpected end of file - int64 expected |
24 |
Incorrect |
26 ms |
4300 KB |
Unexpected end of file - int64 expected |
25 |
Incorrect |
19 ms |
4300 KB |
Unexpected end of file - int64 expected |
26 |
Incorrect |
23 ms |
4300 KB |
Unexpected end of file - int64 expected |
27 |
Incorrect |
26 ms |
4300 KB |
Unexpected end of file - int64 expected |
28 |
Incorrect |
26 ms |
4300 KB |
Unexpected end of file - int64 expected |
29 |
Incorrect |
26 ms |
4300 KB |
Unexpected end of file - int64 expected |
30 |
Incorrect |
9 ms |
4300 KB |
Unexpected end of file - int64 expected |
31 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
32 |
Incorrect |
0 ms |
4300 KB |
Unexpected end of file - int64 expected |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
4300 KB |
Output is correct |
2 |
Correct |
0 ms |
4300 KB |
Output is correct |
3 |
Correct |
0 ms |
4300 KB |
Output is correct |
4 |
Correct |
0 ms |
4300 KB |
Output is correct |
5 |
Correct |
0 ms |
4300 KB |
Output is correct |
6 |
Correct |
0 ms |
4300 KB |
Output is correct |
7 |
Correct |
0 ms |
4300 KB |
Output is correct |
8 |
Correct |
0 ms |
4300 KB |
Output is correct |
9 |
Correct |
0 ms |
4300 KB |
Output is correct |
10 |
Correct |
0 ms |
4300 KB |
Output is correct |
11 |
Correct |
0 ms |
4300 KB |
Output is correct |
12 |
Correct |
0 ms |
4300 KB |
Output is correct |
13 |
Correct |
0 ms |
4300 KB |
Output is correct |
14 |
Correct |
0 ms |
4300 KB |
Output is correct |
15 |
Correct |
0 ms |
4444 KB |
Output is correct |
16 |
Correct |
16 ms |
4772 KB |
Output is correct |
17 |
Correct |
16 ms |
4772 KB |
Output is correct |
18 |
Correct |
19 ms |
4772 KB |
Output is correct |
19 |
Correct |
16 ms |
4772 KB |
Output is correct |
20 |
Correct |
6 ms |
4300 KB |
Output is correct |
21 |
Correct |
66 ms |
5924 KB |
Output is correct |
22 |
Correct |
73 ms |
5924 KB |
Output is correct |
23 |
Correct |
66 ms |
5924 KB |
Output is correct |
24 |
Correct |
69 ms |
5924 KB |
Output is correct |
25 |
Correct |
69 ms |
7460 KB |
Output is correct |
26 |
Correct |
73 ms |
5924 KB |
Output is correct |
27 |
Correct |
73 ms |
5924 KB |
Output is correct |
28 |
Correct |
73 ms |
5924 KB |
Output is correct |
29 |
Correct |
76 ms |
5924 KB |
Output is correct |
30 |
Correct |
36 ms |
4772 KB |
Output is correct |
31 |
Correct |
0 ms |
4300 KB |
Output is correct |
32 |
Correct |
0 ms |
4300 KB |
Output is correct |