# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1196021 | hackstar | Gap (APIO16_gap) | C++20 | 30 ms | 1924 KiB |
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long
int findGap(signed t,signed n){
vector<int>a(n);
int l=1,r=1e18;
int mn,mx;
for(int i=0;i<(n+1)/2;i++){
MinMax(l,r,&mn,&mx);
a[i]=l;
a[n-i-1]=r;
l=mn+1;
r=mx-1;
}
int ans=-1;
for(int i=0;i<n-1;i++){
int cur=a[i+1]-a[i];
ans=max(ans,cur);
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |