제출 #40864

#제출 시각아이디문제언어결과실행 시간메모리
40864IvanCGap (APIO16_gap)C++14
0 / 100
33 ms1516 KiB
#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> ii;
ll NN,TT,maior;
void binary_search(ll ini,ll fim){
	if(ini == fim) return;
	ll copia1,copia2;
	ll meio = ini + (fim - ini)/2;
	MinMax(meio+1,meio,&copia1,&copia2);
	maior = max(maior, abs(copia1 - copia2) );
	if(fim - ini <= maior) return;
	binary_search(ini,copia2);
	binary_search(copia1,fim);
	return;
}
ll findGap(int T,int N){
	TT = T;
	NN = N;
	ll ini = 0,fim = (ll)1e18,copia1,copia2;
	MinMax(ini,fim,&copia1,&copia2);
	binary_search(copia1,copia2);
	return maior;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...