# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40678 | Hassoony | Gap (APIO16_gap) | C++14 | 75 ms | 40404 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 <stdio.h>
#include <stdlib.h>
#include<bits/stdc++.h>
using namespace std;
#include "gap.h"
static void my_assert(int k){ if (!k) exit(1); }
static int subtask_num, N;
static long long A[100001];
static long long call_count;
typedef long long ll;
typedef double D;
const ll inf=(1ll<<61);
const ll mod=1e9+7;
const int MX=1e5+9;
vector<ll>v;
ll findGap(int T, int N){
ll l=0,r=1e18;
MinMax(l,r,&l,&r);
v.push_back(l);
v.push_back(r);
l++;r--;
while(1){
if(l!=-1&&l<=r){
MinMax(l,r,&l,&r);
if(l==-1)break;
v.push_back(l);
v.push_back(r);
l++;r--;
}
else break;
}
sort(v.begin(),v.end());
ll ans=0;
for(int i=0;i<N-1;i++){
ans=max(ans,v[i+1]-v[i]);
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |