Submission #206191

#TimeUsernameProblemLanguageResultExecution timeMemory
206191mraronGap (APIO16_gap)C++14
0 / 100
114 ms11764 KiB
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
set<ll> res;
void solve2(ll L, ll R) {
	if(L>R) return ;
	ll a,b;
	MinMax(L,R,&a,&b);
	if(a==-1) return ;
	res.insert(a);
	res.insert(b);
	solve2(a+1,(a/b)/2);
	solve2((a/b)/2+1, b-1);
}	

void solve1(ll L, ll R) {
	if(L>R) return ;
	ll a,b;
	MinMax(L,R,&a,&b);
	if(a==-1) return ;
	res.insert(a);
	res.insert(b);
	solve1(a+1,b-1);
}	

long long findGap(int T, int N)
{
	if(T==2) {
		solve2(0, 1000000000000000000LL);
	}else {
		solve1(0, 1000000000000000000LL);
	}
	vector<ll> ans;
	for(auto i:res) ans.push_back(i);
	ll val=0;
	for(int i=1;i<ans.size();++i) val=max(val, ans[i]-ans[i-1]);
	return val;
	
}

Compilation message (stderr)

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:37:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1;i<ans.size();++i) val=max(val, ans[i]-ans[i-1]);
              ~^~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...