Submission #30791

#	Time	Username	Problem	Language	Result	Execution time	Memory
30791		inqr	Gap (APIO16_gap)	C++14	100 / 100	96 ms	8956 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define rt insert
#define st first
#define nd second
#define ll long long
#define pii pair < int , int >
#define DB printf("debug\n");
#define umax( x , y ) x = max( x , y )
#define umin( x , y ) x = min( x , y )
#define all(x) x.begin() , x.end()
using namespace std;
long long findGap(int T, int N)
{
	if(T==1){
		ll a[N];memset(a,0,sizeof(a));
		ll l=0,r=N-1;
		while(l<=r){
			if(l==0 && r==N-1){
				MinMax(0,1e18,&a[l],&a[r]);
			}
			else{
				//printf("l=%d r=%d\n",l,r);
				MinMax(a[l-1]+1,a[r+1]-1,&a[l],&a[r]);	
				//else MinMax(a[l-1]+1,1e18,&a[l],NULL);
			}
			l++,r--;
		}
		ll ans=0;
		for(int i=0;i<N-1;i++){
			//printf("i=%d a[i]=%lld a[i+1]=%lld\n",i,a[i],a[i+1]);
			umax(ans,a[i+1]-a[i]);
		}
		return ans;
	}
	else if(T==2){
		ll a[N];memset(a,0,sizeof(a));
		MinMax(0,1e18,&a[0],&a[N-1]);
		ll inter=(a[N-1]-a[0])/(N-1);
		//printf("N %d inter %lld \n",N,inter);
		if(N==2)return a[1]-a[0];
		vector < pair < ll,ll > > res;
		ll x,y;
		ll ans=0;
		for(ll i=a[0];i<a[N-1];i+=inter+1){
			//printf("%d %d\n",i,i+inter);
			MinMax(i,i+inter,&x,&y);
			if(x!=-1)res.pb(mp(x,y));
		}
		for(ll i=1;i<res.size();i++){
			//DB
			//printf("i=%lld st %lld nd %lld \n",i,res[i].st,res[i].nd);
			ans=max(ans,res[i].st-res[i-1].nd);
		}
		//if(res.size()==0)umax(ans,a[N-1]-a[0]);
		//printf("ans=%lld\n",ans);
		return ans;
	}
}

// N 83
// N-1 1 test case yanlis

Compilation message (stderr)

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:52:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(ll i=1;i<res.size();i++){
               ^
gap.cpp:61:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

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