#include <iostream>
#include <cstdio>
#include <vector>
#include "gap.h"
using namespace std;
typedef long long int lli;
const lli maxn = lli(1e5)+5, inf = lli(1e18)+1;
lli ans = 0, A[maxn];
void sub1(lli n)
{
pair<lli, lli> range = {0, inf};
lli L = 0, R = n-1;
while(L <= R)
{
MinMax(range.first, range.second, &A[L], &A[R]);
range.first = A[L]+1, range.second = A[R]-1;
L++, R--;
}
for(lli i = 1;i < n;i++) ans = max(ans, A[i]-A[i-1]);
}
void sub2(lli n)
{
pair<lli, lli> range;
MinMax(0, inf, &range.first, &range.second);
if(n == 2)
{
ans = max(range.second-range.first, ans);
return;
}
lli sz = (range.second-range.first-1)/(n-1);
lli prev = range.first;
pair<lli, lli> cur = {range.first+1, min(range.second-1, range.first+sz)};
bool emp = 0;
while(cur.first < range.second)
{
pair<lli, lli> res;
//cout << cur.first << " " << cur.second << "\n";
MinMax(cur.first, cur.second, &res.first, &res.second);
if(res.first != -1)
{
//cout << "v: " << res.first << " " << prev << " " << res.second << "\n";
ans = max(ans, res.first-prev);
prev = res.second;
if(emp == 1) return;
emp = 0;
}
else emp = 1;
cur.first = cur.second+1;
cur.second = min(range.second-1, cur.first+sz-1);
}
ans = max(ans, range.second-prev);
}
lli findGap(int t, int n)
{
if(t == 1) sub1(n);
else sub2(n);
return ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
248 KB |
Output is correct |
| 2 |
Correct |
2 ms |
356 KB |
Output is correct |
| 3 |
Correct |
2 ms |
432 KB |
Output is correct |
| 4 |
Correct |
2 ms |
448 KB |
Output is correct |
| 5 |
Correct |
2 ms |
500 KB |
Output is correct |
| 6 |
Correct |
2 ms |
508 KB |
Output is correct |
| 7 |
Correct |
2 ms |
544 KB |
Output is correct |
| 8 |
Correct |
2 ms |
620 KB |
Output is correct |
| 9 |
Correct |
2 ms |
748 KB |
Output is correct |
| 10 |
Correct |
2 ms |
748 KB |
Output is correct |
| 11 |
Correct |
2 ms |
748 KB |
Output is correct |
| 12 |
Correct |
3 ms |
748 KB |
Output is correct |
| 13 |
Correct |
3 ms |
748 KB |
Output is correct |
| 14 |
Correct |
3 ms |
748 KB |
Output is correct |
| 15 |
Correct |
2 ms |
748 KB |
Output is correct |
| 16 |
Correct |
16 ms |
1020 KB |
Output is correct |
| 17 |
Correct |
15 ms |
1020 KB |
Output is correct |
| 18 |
Correct |
16 ms |
1020 KB |
Output is correct |
| 19 |
Correct |
15 ms |
1020 KB |
Output is correct |
| 20 |
Correct |
11 ms |
1020 KB |
Output is correct |
| 21 |
Correct |
56 ms |
2172 KB |
Output is correct |
| 22 |
Correct |
62 ms |
2172 KB |
Output is correct |
| 23 |
Correct |
63 ms |
2172 KB |
Output is correct |
| 24 |
Correct |
59 ms |
2172 KB |
Output is correct |
| 25 |
Correct |
50 ms |
2172 KB |
Output is correct |
| 26 |
Correct |
58 ms |
2172 KB |
Output is correct |
| 27 |
Correct |
59 ms |
2300 KB |
Output is correct |
| 28 |
Correct |
58 ms |
2300 KB |
Output is correct |
| 29 |
Correct |
57 ms |
2300 KB |
Output is correct |
| 30 |
Correct |
42 ms |
2300 KB |
Output is correct |
| 31 |
Correct |
2 ms |
2300 KB |
Output is correct |
| 32 |
Correct |
2 ms |
2300 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
2300 KB |
Output is correct |
| 2 |
Incorrect |
2 ms |
2300 KB |
Output isn't correct |
| 3 |
Incorrect |
2 ms |
2300 KB |
Output isn't correct |
| 4 |
Incorrect |
2 ms |
2300 KB |
Output isn't correct |
| 5 |
Correct |
2 ms |
2300 KB |
Output is correct |
| 6 |
Incorrect |
2 ms |
2300 KB |
Output isn't correct |
| 7 |
Incorrect |
2 ms |
2300 KB |
Output isn't correct |
| 8 |
Incorrect |
2 ms |
2300 KB |
Output isn't correct |
| 9 |
Incorrect |
2 ms |
2300 KB |
Output isn't correct |
| 10 |
Incorrect |
2 ms |
2300 KB |
Output isn't correct |
| 11 |
Incorrect |
2 ms |
2300 KB |
Output isn't correct |
| 12 |
Incorrect |
2 ms |
2300 KB |
Output isn't correct |
| 13 |
Incorrect |
2 ms |
2300 KB |
Output isn't correct |
| 14 |
Incorrect |
2 ms |
2300 KB |
Output isn't correct |
| 15 |
Correct |
2 ms |
2300 KB |
Output is correct |
| 16 |
Incorrect |
9 ms |
2300 KB |
Output isn't correct |
| 17 |
Incorrect |
9 ms |
2300 KB |
Output isn't correct |
| 18 |
Incorrect |
9 ms |
2300 KB |
Output isn't correct |
| 19 |
Incorrect |
11 ms |
2300 KB |
Output isn't correct |
| 20 |
Incorrect |
8 ms |
2300 KB |
Output isn't correct |
| 21 |
Incorrect |
32 ms |
2300 KB |
Output isn't correct |
| 22 |
Incorrect |
32 ms |
2300 KB |
Output isn't correct |
| 23 |
Incorrect |
33 ms |
2300 KB |
Output isn't correct |
| 24 |
Incorrect |
33 ms |
2300 KB |
Output isn't correct |
| 25 |
Correct |
23 ms |
2300 KB |
Output is correct |
| 26 |
Incorrect |
31 ms |
2300 KB |
Output isn't correct |
| 27 |
Incorrect |
31 ms |
2300 KB |
Output isn't correct |
| 28 |
Incorrect |
30 ms |
2300 KB |
Output isn't correct |
| 29 |
Incorrect |
32 ms |
2300 KB |
Output isn't correct |
| 30 |
Incorrect |
29 ms |
2300 KB |
Output isn't correct |
| 31 |
Incorrect |
2 ms |
2300 KB |
Output isn't correct |
| 32 |
Correct |
2 ms |
2300 KB |
Output is correct |
