제출 #128172

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
128172		LittleFlowers__	Gap (APIO16_gap)	C++14	100 / 100	84 ms	4076 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
#define in ({long long x=0;long long c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rnd(long long l,long long r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(false),cin.tie(nullptr);
#define task "TASK"
#define forinc(a,b,c) for(long long a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(long long a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<long long,long long>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))

long long findGap(int T,int N){
    if(T==1){
        long long l=0,r=1e18,ret;
        vector<long long> h,t;
        forinc(i,1,(N+1)/2){
            long long x,y;
            MinMax(l,r,&x,&y);
            h.pb(x); t.pb(y);
            l=x+1,r=y-1;
        }
        ret=t.back()-h.back();
        forinc(i,1,h.size()-1) ret=max({ret,h[i]-h[i-1],t[i-1]-t[i]});
        return ret;

    } else{
        long long l=0,r=1e18,ret;
        vector<long long> h,t;
        long long x,y;
        MinMax(l,r,&x,&y);
        h.pb(x); t.pb(y);
        long long gap=(y-x+1)/N+1;
        l=x+1;
        forinc(i,1,(y-x)/gap+1){
            MinMax(l,min(t.back()-1,l+gap-1),&x,&y);
            if(x!=-1) h.pb(x);
            if(y!=-1) h.pb(y);
            l+=gap;
        }
        ret=t.back()-h.back();
        forinc(i,1,h.size()-1) ret=max(ret,h[i]-h[i-1]);
        return ret;
    }
}

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