# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
793170 | algorithm16 | Gap (APIO16_gap) | C++14 | 69 ms | 5660 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "gap.h"
#include<iostream>
#include<set>
#include<algorithm>
using namespace std;
typedef long long int llint;
set <llint> s;
llint fnd(llint x,llint r) {
set <llint>::iterator it=s.upper_bound(x+r);
if(it!=s.begin()) {
it--;
if((*it)!=x) return (*it);
}
llint mn=0,mx=0;
MinMax(x+1,x+r,&mn,&mx);
s.insert(mn);
s.insert(mx);
return mx;
}
llint findGap(int T, int N)
{
llint mn,mx;
if(T==1) {
llint x=1,y=1e18,r=0,cnt=0;
while(x<y) {
if(N==0) {
r=max(r,y-x+2);
break;
}
MinMax(x,y,&mn,&mx);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |