Submission #23580

#	Time	Username	Problem	Language	Result	Execution time	Memory
23580		samir_droubi	Gap (APIO16_gap)	C++14	30 / 100	79 ms	5144 KiB

gap

	#include <bits/stdc++.h>

	#include "gap.h"
	#define ll long long

	using namespace std;
	/*
	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;
	}
	*/
	long long findGap(int T, int n)
	{
		if(T==1)
		{
			ll l,r;
			ll mn,mx;
			ll ans=0;
			MinMax(0,1LL*(1e18),&l,&r);
			if(n==2)return r-l;
			while(l+1<r-1&&n>2)
			{
				MinMax(l+1,r-1,&mn,&mx);
				if(mx==-1)break;
				ans=max(ans,mn-l);
				ans=max(ans,r-mx);
				l=mn;
				r=mx;
				n-=2;
			}
			return ans;
		}
		else
		{
			ll l,r;
			MinMax(0,1LL*(1e18),&l,&r);
			if(n==2)return r-l;
			++l;
			--r;
			ll d=(r-l+1)/(n-1);
			ll ans=0;
			ll last=l;
			ll mn,mx;
			for(ll i=l;i+d-1<=r;i+=d)
			{	
				MinMax(i,min(i+d-1,r),&mn,&mx);
				if(mn==-1)continue;
				ans=max(ans,mn-last);
				last=mx;
			}
			ans=max(ans,r-last);
			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);
	}
	*/

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