제출 #536194

#제출 시각아이디문제언어결과실행 시간메모리
536194DJ035Gap (APIO16_gap)C++17
100 / 100
56 ms1864 KiB
#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()
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, s=0, e=N-1;
        for(int i=0; i<(N+1)/2; i++){
            MinMax(l, r, &l, &r);
            a[s] = l;
            a[e] = r;
            l++, r--;
            s++, e--;
        }
        ll ans=0;
        for(int i=0; i<N-1; i++)
            ans = max(ans, a[i+1]-a[i]);
        return ans;
	}
	else{
        ll mn, mx;
        MinMax(0,1e18,&mn,&mx);
        ll sz=(mx-mn+N-1)/N;
        ll ans=0, tp=mn;
        for(int i=0; i<N; i++){
            ll s=mn+i*sz+1, e=mn+(i+1)*sz;
            ll gmx, gmn;
            MinMax(s,e,&gmn,&gmx);
            if(gmn==-1) continue;
            ans = max(ans, gmn-tp);
            tp = gmx;
        }
        return ans;
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...