Submission #95601

#	Time	Username	Problem	Language	Result	Execution time	Memory
95601		lyc	Gap (APIO16_gap)	C++14	30 / 100	70 ms	5112 KiB

gap

#include "gap.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

ll* solve(ll s, ll t, ll* ptr) {
    //cout << s << " " << t << endl;
    ll mn, mx;
    MinMax(s, t, &mn, &mx);
    if (mn != -1) {
        ll p = rand()%(mx-mn+1) + mn;
        //cout << mn << " " << p << " " << mx << endl;
        *ptr = mn;
        ++ptr;
        if (mn+1 <= p) {
            ptr = solve(mn+1, p, ptr);
        }
        if (p <= mx-1) {
            ptr = solve(p, mx-1, ptr);
        }
        if (mx != mn) {
            *ptr = mx;
            ++ptr;
        }
    }
    return ptr;
}

long long findGap(int T, int N)
{
    ll ans = 0;
    ll s, t, mn, mx;
    if (T == 1) {
        s = 0, t = (ll)1e18;
        ll arr[N];
        for (int i = 0; i < (N+1)/2; ++i) {
            MinMax(s, t, &mn, &mx);
            arr[i] = mn;
            arr[N-1-i] = mx;
            s = mn+1;
            t = mx-1;
            //cout << "FOUND " << mn << " " << mx << '\n';
        }
        //for (int i = 0; i < N; ++i) cout << arr[i] << ' ' ;cout << endl;

        for (int i = 1; i < N; ++i) {
            ans = max(ans, arr[i]-arr[i-1]);
        }
    }
    else {
        ll arr[N];
        s = 0, t = (ll)1e18;
        srand(381257742);
        solve(s, t, arr);
        for (int i = 1; i < N; ++i) {
            ans = max(ans, arr[i]-arr[i-1]);
        }
    }
	return ans;
}

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