| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 45257 |
2018-04-12T08:40:16 Z |
nibnalin |
Gap (APIO16_gap) |
C++17 |
|
117 ms |
39220 KB |
#include <iostream>
#include <cstdio>
#include <vector>
#include "gap.h"
using namespace std;
typedef long long int lli;
const lli maxn = int(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 qry(lli L, lli R)
{
//cout << L << " " << R << "\n";
if(R-L < ans) return;
pair<lli, lli> left = {L, (L+R)/2}, right = {(L+R)/2+1, R};
pair<lli, lli> leftst, rightst;
MinMax(left.first, left.second, &leftst.first, &leftst.second), MinMax(right.first, right.second, &rightst.first, &rightst.second);
ans = max(ans, rightst.first-leftst.second);
if(leftst.first != leftst.second && leftst.first != -1) qry(L, (L+R)/2);
if(rightst.first != rightst.second && rightst.first != -1) qry((L+R)/2+1, R);
}
void sub2(lli n)
{
qry(0, inf);
}
lli findGap(int t, int n)
{
if(t == 1) sub1(n);
else sub2(n);
return ans;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
376 KB |
Output is correct |
| 3 |
Correct |
2 ms |
424 KB |
Output is correct |
| 4 |
Correct |
2 ms |
424 KB |
Output is correct |
| 5 |
Correct |
2 ms |
428 KB |
Output is correct |
| 6 |
Correct |
2 ms |
448 KB |
Output is correct |
| 7 |
Correct |
2 ms |
504 KB |
Output is correct |
| 8 |
Correct |
2 ms |
544 KB |
Output is correct |
| 9 |
Correct |
2 ms |
548 KB |
Output is correct |
| 10 |
Correct |
2 ms |
552 KB |
Output is correct |
| 11 |
Correct |
3 ms |
724 KB |
Output is correct |
| 12 |
Correct |
3 ms |
728 KB |
Output is correct |
| 13 |
Correct |
3 ms |
828 KB |
Output is correct |
| 14 |
Correct |
3 ms |
828 KB |
Output is correct |
| 15 |
Correct |
2 ms |
912 KB |
Output is correct |
| 16 |
Correct |
16 ms |
1776 KB |
Output is correct |
| 17 |
Correct |
16 ms |
2128 KB |
Output is correct |
| 18 |
Correct |
19 ms |
2624 KB |
Output is correct |
| 19 |
Correct |
16 ms |
3056 KB |
Output is correct |
| 20 |
Correct |
12 ms |
3264 KB |
Output is correct |
| 21 |
Correct |
59 ms |
6316 KB |
Output is correct |
| 22 |
Correct |
57 ms |
8232 KB |
Output is correct |
| 23 |
Correct |
58 ms |
9940 KB |
Output is correct |
| 24 |
Correct |
58 ms |
12040 KB |
Output is correct |
| 25 |
Correct |
52 ms |
13116 KB |
Output is correct |
| 26 |
Correct |
71 ms |
14840 KB |
Output is correct |
| 27 |
Correct |
57 ms |
16724 KB |
Output is correct |
| 28 |
Correct |
59 ms |
18548 KB |
Output is correct |
| 29 |
Correct |
57 ms |
20392 KB |
Output is correct |
| 30 |
Correct |
43 ms |
21084 KB |
Output is correct |
| 31 |
Correct |
2 ms |
21084 KB |
Output is correct |
| 32 |
Correct |
2 ms |
21084 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
21084 KB |
Output is correct |
| 2 |
Partially correct |
2 ms |
21084 KB |
Partially correct |
| 3 |
Partially correct |
2 ms |
21084 KB |
Partially correct |
| 4 |
Correct |
2 ms |
21084 KB |
Output is correct |
| 5 |
Partially correct |
2 ms |
21084 KB |
Partially correct |
| 6 |
Partially correct |
2 ms |
21084 KB |
Partially correct |
| 7 |
Incorrect |
2 ms |
21084 KB |
Output isn't correct |
| 8 |
Partially correct |
2 ms |
21084 KB |
Partially correct |
| 9 |
Partially correct |
2 ms |
21084 KB |
Partially correct |
| 10 |
Partially correct |
2 ms |
21084 KB |
Partially correct |
| 11 |
Incorrect |
3 ms |
21084 KB |
Output isn't correct |
| 12 |
Incorrect |
2 ms |
21084 KB |
Output isn't correct |
| 13 |
Incorrect |
2 ms |
21084 KB |
Output isn't correct |
| 14 |
Incorrect |
2 ms |
21084 KB |
Output isn't correct |
| 15 |
Partially correct |
4 ms |
21084 KB |
Partially correct |
| 16 |
Incorrect |
10 ms |
21084 KB |
Output isn't correct |
| 17 |
Incorrect |
15 ms |
21084 KB |
Output isn't correct |
| 18 |
Incorrect |
9 ms |
21340 KB |
Output isn't correct |
| 19 |
Incorrect |
10 ms |
21800 KB |
Output isn't correct |
| 20 |
Partially correct |
5 ms |
21976 KB |
Partially correct |
| 21 |
Incorrect |
33 ms |
24328 KB |
Output isn't correct |
| 22 |
Incorrect |
38 ms |
26216 KB |
Output isn't correct |
| 23 |
Incorrect |
34 ms |
28048 KB |
Output isn't correct |
| 24 |
Incorrect |
32 ms |
29904 KB |
Output isn't correct |
| 25 |
Partially correct |
117 ms |
31228 KB |
Partially correct |
| 26 |
Incorrect |
33 ms |
33000 KB |
Output isn't correct |
| 27 |
Incorrect |
46 ms |
34844 KB |
Output isn't correct |
| 28 |
Incorrect |
47 ms |
36716 KB |
Output isn't correct |
| 29 |
Incorrect |
35 ms |
38612 KB |
Output isn't correct |
| 30 |
Partially correct |
16 ms |
39220 KB |
Partially correct |
| 31 |
Correct |
2 ms |
39220 KB |
Output is correct |
| 32 |
Correct |
2 ms |
39220 KB |
Output is correct |
