Submission #1096896

#TimeUsernameProblemLanguageResultExecution timeMemory
1096896NewtonabcGap (APIO16_gap)C++14
0 / 100
40 ms2672 KiB
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
stack<long long> st;
vector<long long> arr;
long long findGap(int T, int N)
{
	long long ans=LLONG_MAX;
	long long mn=0,mx=1e18+1;
	while(mn!=mx){
		MinMax(mn+1,mx-1,&mn,&mx);
		if(mn==-1) break;
		arr.push_back(mn);
		st.push(mx);
	}
	while(!st.empty()) arr.push_back(st.top()),st.pop();
	for(int i=0;i<N-1;i++){
		ans=min(ans,arr[i+1]-arr[i]);
	}
	//for(int i=0;i<N;i++) cout<<arr[i] <<" ";
	
	return ans;
	
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...