| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 47122 |
2018-04-27T20:40:11 Z |
yusufake |
Gap (APIO16_gap) |
C++ |
|
64 ms |
39336 KB |
#include <bits/stdc++.h>
using namespace std;
#include "gap.h"
/*
static void my_assert(int k){ if (!k) exit(1); }
static int subtask_num, N;
static long long A[100001];
static long long call_count;
void MinMax(long long s, long long t, long long *mn, long long *mx)
{
int lo = 1, hi = N, left = N+1, right = 0;
my_assert(s <= t && mn != NULL && mx != NULL);
while (lo <= hi){
int mid = (lo+hi)>>1;
if (A[mid] >= s) hi = mid - 1, left = mid;
else lo = mid + 1;
}
lo = 1, hi = N;
while (lo <= hi){
int mid = (lo+hi)>>1;
if (A[mid] <= t) lo = mid + 1, right = mid;
else hi = mid - 1;
}
if (left > right) *mn = *mx = -1;
else{
*mn = A[left];
*mx = A[right];
}
if (subtask_num == 1) call_count++;
else if (subtask_num == 2) call_count += right-left+2;
}
*/
typedef long long ll;
ll f(ll l, ll r, ll pl, ll pr, ll zz){
//cout << l << " " << r << " " << zz << " cc\n";
if(l > r || zz <= 0) return pr-pl;
ll mn,mx;
MinMax(l,r,&mn,&mx);
//cout << l << " " << r << " " << << " " << pr << " ss\n";
//cout << mn << " " << mx << " aa\n";
ll t = max(mn-pl , pr-mx);
return max(t , f(mn+1,mx-1,mn,mx,zz-2));
}
long long findGap(int T, int n){
if(T == 1) return f(0,1e18,1e18,0,n);
return 0;
}
/*
int main()
{
//FILE *in = stdin, *out = stdout;
//my_assert(2 == fscanf(in, "%d%d", &subtask_num, &N));
//my_assert(1 <= subtask_num && subtask_num <= 2);
//my_assert(2 <= N && N <= 100000);
//for (int i=1;i<=N;i++) my_assert(1 == fscanf(in, "%lld", A+i));
//for (int i=1;i<N;i++) my_assert(A[i] < A[i+1]);
A[1] = 2;
A[2] = 3;
A[3] = 6;
A[4] = 8;
N = 4;
subtask_num = 1;
printf("%lld\n", findGap(1, 4));
printf("%lld\n", call_count);
}
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
2 ms |
496 KB |
Output is correct |
| 3 |
Correct |
2 ms |
536 KB |
Output is correct |
| 4 |
Correct |
2 ms |
536 KB |
Output is correct |
| 5 |
Correct |
2 ms |
540 KB |
Output is correct |
| 6 |
Correct |
2 ms |
588 KB |
Output is correct |
| 7 |
Correct |
2 ms |
596 KB |
Output is correct |
| 8 |
Correct |
2 ms |
596 KB |
Output is correct |
| 9 |
Correct |
2 ms |
600 KB |
Output is correct |
| 10 |
Correct |
2 ms |
604 KB |
Output is correct |
| 11 |
Correct |
3 ms |
608 KB |
Output is correct |
| 12 |
Correct |
3 ms |
764 KB |
Output is correct |
| 13 |
Correct |
3 ms |
856 KB |
Output is correct |
| 14 |
Correct |
3 ms |
948 KB |
Output is correct |
| 15 |
Correct |
2 ms |
948 KB |
Output is correct |
| 16 |
Correct |
17 ms |
2412 KB |
Output is correct |
| 17 |
Correct |
43 ms |
2892 KB |
Output is correct |
| 18 |
Correct |
16 ms |
3336 KB |
Output is correct |
| 19 |
Correct |
17 ms |
3692 KB |
Output is correct |
| 20 |
Correct |
12 ms |
3776 KB |
Output is correct |
| 21 |
Correct |
58 ms |
8664 KB |
Output is correct |
| 22 |
Correct |
58 ms |
10508 KB |
Output is correct |
| 23 |
Correct |
59 ms |
12224 KB |
Output is correct |
| 24 |
Correct |
58 ms |
14320 KB |
Output is correct |
| 25 |
Correct |
63 ms |
15416 KB |
Output is correct |
| 26 |
Correct |
61 ms |
17272 KB |
Output is correct |
| 27 |
Correct |
63 ms |
19164 KB |
Output is correct |
| 28 |
Correct |
58 ms |
20888 KB |
Output is correct |
| 29 |
Correct |
60 ms |
22860 KB |
Output is correct |
| 30 |
Correct |
64 ms |
23552 KB |
Output is correct |
| 31 |
Correct |
2 ms |
23552 KB |
Output is correct |
| 32 |
Correct |
2 ms |
23552 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
23552 KB |
Output isn't correct |
| 2 |
Incorrect |
2 ms |
23552 KB |
Output isn't correct |
| 3 |
Incorrect |
2 ms |
23552 KB |
Output isn't correct |
| 4 |
Incorrect |
2 ms |
23552 KB |
Output isn't correct |
| 5 |
Incorrect |
2 ms |
23552 KB |
Output isn't correct |
| 6 |
Incorrect |
2 ms |
23552 KB |
Output isn't correct |
| 7 |
Incorrect |
2 ms |
23552 KB |
Output isn't correct |
| 8 |
Incorrect |
2 ms |
23552 KB |
Output isn't correct |
| 9 |
Incorrect |
2 ms |
23552 KB |
Output isn't correct |
| 10 |
Incorrect |
2 ms |
23552 KB |
Output isn't correct |
| 11 |
Incorrect |
2 ms |
23552 KB |
Output isn't correct |
| 12 |
Incorrect |
2 ms |
23552 KB |
Output isn't correct |
| 13 |
Incorrect |
2 ms |
23552 KB |
Output isn't correct |
| 14 |
Incorrect |
2 ms |
23552 KB |
Output isn't correct |
| 15 |
Incorrect |
2 ms |
23552 KB |
Output isn't correct |
| 16 |
Incorrect |
13 ms |
23552 KB |
Output isn't correct |
| 17 |
Incorrect |
9 ms |
23552 KB |
Output isn't correct |
| 18 |
Incorrect |
9 ms |
23552 KB |
Output isn't correct |
| 19 |
Incorrect |
9 ms |
23552 KB |
Output isn't correct |
| 20 |
Incorrect |
5 ms |
23552 KB |
Output isn't correct |
| 21 |
Incorrect |
29 ms |
24472 KB |
Output isn't correct |
| 22 |
Incorrect |
34 ms |
26272 KB |
Output isn't correct |
| 23 |
Incorrect |
32 ms |
28116 KB |
Output isn't correct |
| 24 |
Incorrect |
30 ms |
29976 KB |
Output isn't correct |
| 25 |
Incorrect |
22 ms |
31188 KB |
Output isn't correct |
| 26 |
Incorrect |
32 ms |
33036 KB |
Output isn't correct |
| 27 |
Incorrect |
31 ms |
34880 KB |
Output isn't correct |
| 28 |
Incorrect |
29 ms |
36740 KB |
Output isn't correct |
| 29 |
Incorrect |
35 ms |
38588 KB |
Output isn't correct |
| 30 |
Incorrect |
17 ms |
39336 KB |
Output isn't correct |
| 31 |
Incorrect |
2 ms |
39336 KB |
Output isn't correct |
| 32 |
Incorrect |
3 ms |
39336 KB |
Output isn't correct |
