#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);
lli sz = (range.second-range.first)/(n-1);
lli prev = range.first;
pair<lli, lli> cur = {range.first+1, min(range.second, range.first+sz)};
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)
{
ans = max(ans, res.first-prev);
prev = res.second;
}
cur.first = cur.second+1;
cur.second = min(range.second, 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 |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
488 KB |
Output is correct |
| 3 |
Correct |
2 ms |
608 KB |
Output is correct |
| 4 |
Correct |
2 ms |
608 KB |
Output is correct |
| 5 |
Correct |
2 ms |
608 KB |
Output is correct |
| 6 |
Correct |
2 ms |
608 KB |
Output is correct |
| 7 |
Correct |
2 ms |
608 KB |
Output is correct |
| 8 |
Correct |
2 ms |
608 KB |
Output is correct |
| 9 |
Correct |
2 ms |
608 KB |
Output is correct |
| 10 |
Correct |
2 ms |
608 KB |
Output is correct |
| 11 |
Correct |
3 ms |
608 KB |
Output is correct |
| 12 |
Correct |
3 ms |
608 KB |
Output is correct |
| 13 |
Correct |
3 ms |
608 KB |
Output is correct |
| 14 |
Correct |
2 ms |
608 KB |
Output is correct |
| 15 |
Correct |
3 ms |
608 KB |
Output is correct |
| 16 |
Correct |
15 ms |
948 KB |
Output is correct |
| 17 |
Correct |
15 ms |
948 KB |
Output is correct |
| 18 |
Correct |
16 ms |
948 KB |
Output is correct |
| 19 |
Correct |
16 ms |
948 KB |
Output is correct |
| 20 |
Correct |
13 ms |
948 KB |
Output is correct |
| 21 |
Correct |
57 ms |
2100 KB |
Output is correct |
| 22 |
Correct |
79 ms |
2188 KB |
Output is correct |
| 23 |
Correct |
70 ms |
2188 KB |
Output is correct |
| 24 |
Correct |
54 ms |
2188 KB |
Output is correct |
| 25 |
Correct |
69 ms |
2188 KB |
Output is correct |
| 26 |
Correct |
56 ms |
2188 KB |
Output is correct |
| 27 |
Correct |
55 ms |
2188 KB |
Output is correct |
| 28 |
Correct |
79 ms |
2188 KB |
Output is correct |
| 29 |
Correct |
61 ms |
2188 KB |
Output is correct |
| 30 |
Correct |
45 ms |
2188 KB |
Output is correct |
| 31 |
Correct |
2 ms |
2188 KB |
Output is correct |
| 32 |
Correct |
2 ms |
2188 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
2188 KB |
Output is correct |
| 2 |
Correct |
2 ms |
2188 KB |
Output is correct |
| 3 |
Correct |
2 ms |
2188 KB |
Output is correct |
| 4 |
Correct |
2 ms |
2188 KB |
Output is correct |
| 5 |
Correct |
3 ms |
2188 KB |
Output is correct |
| 6 |
Correct |
2 ms |
2188 KB |
Output is correct |
| 7 |
Correct |
2 ms |
2188 KB |
Output is correct |
| 8 |
Correct |
2 ms |
2188 KB |
Output is correct |
| 9 |
Correct |
2 ms |
2188 KB |
Output is correct |
| 10 |
Correct |
2 ms |
2188 KB |
Output is correct |
| 11 |
Correct |
3 ms |
2188 KB |
Output is correct |
| 12 |
Correct |
3 ms |
2188 KB |
Output is correct |
| 13 |
Correct |
3 ms |
2188 KB |
Output is correct |
| 14 |
Correct |
3 ms |
2188 KB |
Output is correct |
| 15 |
Correct |
3 ms |
2188 KB |
Output is correct |
| 16 |
Correct |
19 ms |
2188 KB |
Output is correct |
| 17 |
Correct |
20 ms |
2188 KB |
Output is correct |
| 18 |
Correct |
20 ms |
2188 KB |
Output is correct |
| 19 |
Correct |
19 ms |
2188 KB |
Output is correct |
| 20 |
Partially correct |
11 ms |
2188 KB |
Partially correct |
| 21 |
Correct |
75 ms |
2188 KB |
Output is correct |
| 22 |
Correct |
75 ms |
2188 KB |
Output is correct |
| 23 |
Correct |
74 ms |
2188 KB |
Output is correct |
| 24 |
Correct |
78 ms |
2188 KB |
Output is correct |
| 25 |
Correct |
71 ms |
2188 KB |
Output is correct |
| 26 |
Correct |
75 ms |
2188 KB |
Output is correct |
| 27 |
Correct |
75 ms |
2188 KB |
Output is correct |
| 28 |
Correct |
75 ms |
2188 KB |
Output is correct |
| 29 |
Correct |
86 ms |
2188 KB |
Output is correct |
| 30 |
Partially correct |
50 ms |
2188 KB |
Partially correct |
| 31 |
Correct |
2 ms |
2188 KB |
Output is correct |
| 32 |
Correct |
2 ms |
2188 KB |
Output is correct |
