Submission #966468

#	Time	Username	Problem	Language	Result	Execution time	Memory
966468		PenguinsAreCute	Gap (APIO16_gap)	C++17	30 / 100	35 ms	3256 KiB

gap

#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll = long long;
/*
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;

long long findGap(int, int);

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;
}
*/
ll findGap(int T, int N) {
    if(T==1) {
        ll mn, mx, ans = 0;
        MinMax(0,1e18,&mn,&mx);
        //if(N==2) {return mx-mn;}
        for(int i=0;i<(N-1)/2;i++) {
            ll nMn, nMx;
            MinMax(mn+1,mx-1,&nMn,&nMx);
            ans=max({ans,nMn-mn,mx-nMx});
            mn=nMn;
            mx=nMx;
        }
        ans=max(ans,mx-mn);
        return ans;
    }
}
/*
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]);
	fprintf(out, "%lld\n", findGap(subtask_num, N));
	fprintf(out, "%lld\n", call_count);
}
*/

Compilation message (stderr)

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:53:1: warning: control reaches end of non-void function [-Wreturn-type]
   53 | }
      | ^

• Subtask 1: 30 / 30
• Subtask 2: 0 / 70