Submission #106969

#	Time	Username	Problem	Language	Result	Execution time	Memory
106969		golub	Gap (APIO16_gap)	C++14	70 / 100	88 ms	3308 KiB

gap

#include "gap.h"
#include<bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define F first
#define S second
#define pb push_back
#define pii pair<long long, long long>
#define len(x) (long long)x.size()

template<typename A, typename B>
bool cmax(A &a, const B &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<typename A, typename B>
bool cmin(A &a, const B &b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

int askcount = 0;

pii ask(long long s, long long t) {
	askcount++;
	long long mn = 0, mx = 0;
	MinMax(s, t, &mn, &mx);
	return {mn, mx};
}

long long findGap(int T, int N) {
	vector<long long> a;
	long long l = -1, r = (long long)1e18 + 1;
	MinMax(l, r, &l, &r);
	a.pb(l); a.pb(r);
	long long dx = (r - l) / (N - 1);
	long long MAX = r;
	r = l + dx;
	while (l < MAX) {
		pii res = ask(l, r);
		if (res.F != -1) a.pb(res.F);
		if (res.S != -1) a.pb(res.S);
		l += dx + 1;
		r += dx + 1;
	}
	long long best = -1;
	sort(all(a));
	// for (auto x: a) cout << x << "\n";
	for (int i = 0; i < len(a) - 1; i++) {
		cmax(best, a[i + 1] - a[i]);
	}
	return best;
}

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