제출 #25588

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
25588		kajebiii	Gap (APIO16_gap)	C++14	30 / 100	79 ms	6588 KiB

gap

#include "gap.h"

#include <algorithm>
#include <stdio.h>

using namespace std;

#define REP(i,n) for(int (i)=0;(i)<(int)(n);(i)++)
#define REPO(i,n) for(int (i)=1; (i)<=(int)(n); (i)++)
#define SZ(v) ((int)(v).size())
#define ALL(v) (v).begin(),(v).end()
#define one first
#define two second
typedef long long ll;
typedef pair<int, int> pi;
const int INF = 0x3f2f1f0f;
const ll LINF = 1ll * INF * INF;


const ll MINV = 0, MAXV = 1e18;
const int MAX_N = 1e5 + 100;

ll minV, maxV;

ll Nr[MAX_N][2], Ans[MAX_N];
long long findGap(int T, int N)
{
    if(T == 1) {
        ll ans = 0;
        minV = MINV, maxV = MAXV;        
        int li = 0, ri = N-1;
        for(int i=0; i<(N+1)/2; i++) {
            ll l, r;
            MinMax(minV, maxV, &l, &r);
            Ans[li++] = l;
            Ans[ri--] = r;
            minV = l+1; maxV = r-1;
        }
        for(int i=0; i+1<N; i++)
            ans = max(ans, Ans[i+1] - Ans[i]);
        return ans;
    }
    if(T == 2) {
        MinMax(MINV, MAXV, &minV, &maxV);
        ll diff = (maxV - minV + N-1) / N;
        ll ans = 0, lastR = -1;
        for(int i=0; i<N; i++) {
            ll l = min(maxV, minV + i * diff);
            ll r = min(maxV, minV + (i+1) * diff);
            MinMax(l, r, &Nr[i][0], &Nr[i][1]);
//            printf("%lld %lld -> %lld %lld\n", l, r, Nr[i][0], Nr[i][1]);
            if(Nr[i][0] >= 0) {
                ans = max(ans, Nr[i][0] - lastR);
                lastR = Nr[i][1];
            }
        }
        return ans;
    }
	return 0;
}

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