Submission #1363253

#TimeUsernameProblemLanguageResultExecution timeMemory
1363253yc11Gap (APIO16_gap)C++20
0 / 100
2096 ms5692 KiB
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
long long findGap(int T, int N)
{
	long long mn = 0;
	long long mx = 0;

	MinMax(0,1e18,&mn,&mx);
	int x = (mx-mn)/(N-1);

	set<int> yay;
	yay.insert(mn);
	yay.insert(mx);
	int c = 0;
	for (int i =mn+1;i<mx;i=i+x){
        long long a = 0;
        long long b = 0;
        MinMax(i,i+x-1,&a,&b);


        yay.insert(a);
        yay.insert(b);
	}
	int p = -1;
	int ans= 0;
	for (set<int>::iterator it = yay.begin();it!=yay.end();it++){
        if (p!=-1) ans = max(ans,*it-p);
        p = *it;
	}
	return ans;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...