Submission #672448

#	Time	Username	Problem	Language	Result	Execution time	Memory
672448		Dan4Life	Gap (APIO16_gap)	C++17	30 / 100	68 ms	2248 KiB

gap

#include <bits/stdc++.h>
#include "gap.h"
using namespace std;
using ll = long long;
#define fi first
#define se second
#define pb push_back
#define all(a) a.begin(),a.end()
#define sz(a) (int)a.size()
const int maxn = 5e5+10;
const ll LINF = (ll)2e18;

ll ans=1,mn=-1,mx=-1;

ll findGap(int T, int n)
{
	ll s=0, t=LINF; ans=1;
	if(T==1){
		vector<ll> v; v.clear(); int x = (n+1)/2;
		while(x--) MinMax(s,t,&mn,&mx), v.pb(mn), v.pb(mx), s=mn+1, t=mx-1;
		sort(all(v));
		for(int i = 0; i < sz(v)-1; i++) 
			ans = max(ans, v[i+1]-v[i]);
		return ans;
	}
	MinMax(s,t,&mn,&mx); ll i=mn, num=(mx-mn+n-1)/(n-1), x, y, p=mn; ans=num;
	for(i; ; i+=num+1){
		MinMax(i,min(mx,i+num),&x,&y);
		if(x!=-1) ans = max(ans, x-p),p=x;
		if(i+num>=mx){
			if(x!=-1) ans = max(ans, x-p);
			break;
		}
	}
	return ans;
}

Compilation message (stderr)

gap.cpp: In function 'll findGap(int, int)':
gap.cpp:27:6: warning: statement has no effect [-Wunused-value]
   27 |  for(i; ; i+=num+1){
      |      ^

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