Submission #1196015

#TimeUsernameProblemLanguageResultExecution timeMemory
1196015hackstarGap (APIO16_gap)C++20
0 / 100
30 ms1964 KiB
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;

#define int long long

int findGap(signed t,signed n){
	vector<int>a(n);
	int l=0,r=1e18;
	int mn,mx;
	for(int i=0;i<n/2;i++){
		MinMax(l,r,&mn,&mx);
		a[i]=l;
		a[n-i-1]=r;
		l=mn+1;
		r=mx-1;
	}
	int ans=0;
	for(int i=0;i<n-1;i++){
		int cur=a[i+1]-a[i];
		ans=max(ans,cur);
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...