# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
536177 | DJ035 | Gap (APIO16_gap) | C++17 | 0 ms | 0 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"
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#include <bits/stdc++.h>
#define MEM 111111
#define sanic ios_base::sync_with_stdio(0)
#define x first
#define y second
#define pf push_front
#define pb push_back
#define all(v) v.begin(), v.end()
#define sz size()
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pi;
const ll INF = 1e17+7;
const ll MOD = 998244353;
ll gcd(ll a, ll b){
if(a%b) return gcd(b, a%b);
return b;
}
ll t,n,m;
ll a[MEM];
ll findGap(int T, int N)
{
if(T==1){
ll l=0, r=1e18, ll=0, rr=N-1;
for(int i=0; i<(N+1)/2; i++){
MinMax(l, r, l, r);
a[ll] = l;
a[rr] = r;
l++, r--;
ll++, rr--;
}
ll ans=0;
for(int i=0; i<N-1; i++)
ans = max(ans, a[i+1]-a[i]);
return ans;
}
}