제출 #713155

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
713155		lam	Gap (APIO16_gap)	C++14	30 / 100	3037 ms	25908 KiB

gap

#include <bits/stdc++.h>
#define ll long long
#include "gap.h"
using namespace std;
#define ll long long
const int maxn = 1e5 + 10;
int n;
ll a[maxn];
ll sub1()
{
    int l=1; int r=n;
    ll s = 0; ll t = 1e18;
    while (l<=r)
    {
        ll *mx, *mn;
        ll mmax, mmin;
        mx = &mmax; mn = &mmin;
//        cerr<<l<<' '<<r<<' '<<s<<' '<<t<<endl;
        MinMax(s,t,mn,mx);
        s = (mmin)+1; t = (mmax)-1;
        a[l++]=mmin;
        a[r--]=mmax;
    }
    ll ans = 0;
    for (int i=2; i<=n; i++)
    {

        if (ans<a[i]-a[i-1]) ans=a[i]-a[i-1];
    }
    return ans;
}

set<int> b;

void dnc(ll s, ll t)
{
    if (s>t) return;
    ll *mn,*mx;
    ll mmin,mmax;
    mx = &mmax; mn=&mmin;
    MinMax(s,t,mn,mx);
    if (mmin == -1) return;
    s = mmin+1; t = mmax-1;
    b.insert(mmin); b.insert(mmax);
    if (mmin==mmax) return;
    int mid = (s+t)/2;
    dnc(s,mid); dnc(mid+1,t);
}

ll sub2()
{
    dnc(0,1e18);
    int m=0;
    for (int i:b) a[++m] = i;
    ll ans = 0;
    assert(n==m);
    for (int i=2; i<=n; i++) ans=max(ans,a[i]-a[i-1]);
    return ans;
}

ll findGap(int T, int N)
{
    n=N;
    if (T==1) return sub1();
    else return sub2();
}

• Subtask 1: 30 / 30
• Subtask 2: 0 / 70