Submission #47139

# Submission time Handle Problem Language Result Execution time Memory
47139 2018-04-27T22:43:50 Z yusufake Gap (APIO16_gap) C++
100 / 100
77 ms 4552 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){
    if(l > r || zz <= 0) return pr-pl;
	ll mn,mx;
    MinMax(l,r,&mn,&mx);
	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);
    ll las=0, t, res, p, mn, mx;
    MinMax(0,1e18,&mn,&mx);
    res = t = (mx-mn) / (n-1);  
    p = mn;
    ll mxx = mx;
    ll mnn = mn;
    for(;;){
        MinMax(p,p+t,&mn,&mx);
        res = max(res , las ? mn-las : 0);
        las = mx == -1 ? las : mx;
        p = p+t+1;
        if(p > mxx) return res;
    }
   
    
    return 0;
}

/*
int main()
{
	A[1] = 2;
	A[2] = 3;
	A[3] = 6;
	A[4] = 8;
    N = 4;
    subtask_num = 2;
	printf("%lld\n", findGap(2, 4));
	printf("%lld\n", call_count);
}
*/

Compilation message

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:52:8: warning: unused variable 'mnn' [-Wunused-variable]
     ll mnn = mn;
        ^~~
# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 552 KB Output is correct
4 Correct 2 ms 552 KB Output is correct
5 Correct 2 ms 552 KB Output is correct
6 Correct 2 ms 624 KB Output is correct
7 Correct 2 ms 632 KB Output is correct
8 Correct 2 ms 736 KB Output is correct
9 Correct 2 ms 740 KB Output is correct
10 Correct 2 ms 748 KB Output is correct
11 Correct 3 ms 748 KB Output is correct
12 Correct 2 ms 748 KB Output is correct
13 Correct 2 ms 748 KB Output is correct
14 Correct 2 ms 748 KB Output is correct
15 Correct 2 ms 748 KB Output is correct
16 Correct 15 ms 1660 KB Output is correct
17 Correct 15 ms 1660 KB Output is correct
18 Correct 16 ms 1660 KB Output is correct
19 Correct 16 ms 1660 KB Output is correct
20 Correct 11 ms 1660 KB Output is correct
21 Correct 60 ms 4476 KB Output is correct
22 Correct 63 ms 4476 KB Output is correct
23 Correct 58 ms 4476 KB Output is correct
24 Correct 60 ms 4476 KB Output is correct
25 Correct 50 ms 4552 KB Output is correct
26 Correct 58 ms 4552 KB Output is correct
27 Correct 57 ms 4552 KB Output is correct
28 Correct 58 ms 4552 KB Output is correct
29 Correct 57 ms 4552 KB Output is correct
30 Correct 44 ms 4552 KB Output is correct
31 Correct 2 ms 4552 KB Output is correct
32 Correct 2 ms 4552 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 4552 KB Output is correct
2 Correct 2 ms 4552 KB Output is correct
3 Correct 2 ms 4552 KB Output is correct
4 Correct 2 ms 4552 KB Output is correct
5 Correct 2 ms 4552 KB Output is correct
6 Correct 2 ms 4552 KB Output is correct
7 Correct 2 ms 4552 KB Output is correct
8 Correct 2 ms 4552 KB Output is correct
9 Correct 2 ms 4552 KB Output is correct
10 Correct 2 ms 4552 KB Output is correct
11 Correct 3 ms 4552 KB Output is correct
12 Correct 3 ms 4552 KB Output is correct
13 Correct 3 ms 4552 KB Output is correct
14 Correct 3 ms 4552 KB Output is correct
15 Correct 3 ms 4552 KB Output is correct
16 Correct 22 ms 4552 KB Output is correct
17 Correct 19 ms 4552 KB Output is correct
18 Correct 19 ms 4552 KB Output is correct
19 Correct 20 ms 4552 KB Output is correct
20 Correct 11 ms 4552 KB Output is correct
21 Correct 75 ms 4552 KB Output is correct
22 Correct 73 ms 4552 KB Output is correct
23 Correct 76 ms 4552 KB Output is correct
24 Correct 75 ms 4552 KB Output is correct
25 Correct 76 ms 4552 KB Output is correct
26 Correct 74 ms 4552 KB Output is correct
27 Correct 77 ms 4552 KB Output is correct
28 Correct 74 ms 4552 KB Output is correct
29 Correct 74 ms 4552 KB Output is correct
30 Correct 41 ms 4552 KB Output is correct
31 Correct 2 ms 4552 KB Output is correct
32 Correct 2 ms 4552 KB Output is correct