Submission #731268

#TimeUsernameProblemLanguageResultExecution timeMemory
7312681neGap (APIO16_gap)C++14
0 / 100
53 ms2372 KiB
#include "gap.h"	
#include <bits/stdc++.h>
using namespace std;
long long findGap(int T, int N)
{
	long long s = -1,t = 1e18 + 1;
	long long x = 0,y = 0;
	vector<long long>pos;
	while(s <= t){
		MinMax(s,t,&x,&y);
		if (x == -1 && y == -1){
			break;
		}
		pos.push_back(x);
		pos.push_back(y);
		s = x + 1;
		t = y - 1;	
	}
	if (s == t && (int)pos.size() < N){
		pos.push_back(s);
	}
	long long ans = 1;
	sort(pos.begin(),pos.end());
	for (int i = 1;i<(int)pos.size();++i){
		ans = max(ans,pos[i] - pos[i - 1]);
	} 
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...