Submission #108933

#	Time	Username	Problem	Language	Result	Execution time	Memory
108933		autumn_eel	Gap (APIO16_gap)	C++14	30 / 100	69 ms	2044 KiB

gap

#include <bits/stdc++.h>
#define rep(i,n)for(int i=0;i<(n);i++)
using namespace std;
typedef long long ll;

#include "gap.h"


ll solve1(int n){
	deque<ll>f,r;
	while(f.size()+r.size()<n){
		ll mn,mx;
		ll L=0,R=1e18;
		if(!f.empty())L=f.back()+1;
		if(!r.empty())R=r.front()-1;
		MinMax(L,R,&mn,&mx);
		f.push_back(mn);
		if(mn!=mx)r.push_front(mx);
	}
	while(!r.empty()){
		f.push_back(r.front());
		r.pop_front();
	}
	ll ans=0;
	rep(i,n-1)ans=max(ans,f[i+1]-f[i]);
	return ans;
}
ll solve2(int n){
	return 0;
}

long long findGap(int T, int N){
	if(T==1)return solve1(N);
	return solve2(N);
}

Compilation message (stderr)

gap.cpp: In function 'll solve1(int)':
gap.cpp:11:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(f.size()+r.size()<n){
        ~~~~~~~~~~~~~~~~~^~

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