Submission #106972

# Submission time Handle Problem Language Result Execution time Memory
106972 2019-04-21T10:50:28 Z golub Gap (APIO16_gap) C++14
100 / 100
85 ms 3332 KB
#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 stupid_solve(int N) {
	vector<long long> a(N);
	long long itr1 = 0, itr2 = N - 1;
	long long l = -1, r = (long long)1e18 + 1;
	while (itr1 <= itr2) {
		pii res = ask(l, r);
		assert(res.F != -1);
		assert(res.S != -1);
		a[itr1++] = res.F;
		a[itr2--] = res.S;
		l = res.F + 1;
		r = res.S - 1;
	}
	long long best = -1;
	sort(all(a));
	for (int i = 0; i < N - 1; i++) {
		cmax(best, a[i + 1] - a[i]);
	}
	return best;
}

long long findGap(int T, int N) {
	if (T == 1) return stupid_solve(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;
}
# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 16 ms 768 KB Output is correct
17 Correct 15 ms 768 KB Output is correct
18 Correct 15 ms 768 KB Output is correct
19 Correct 13 ms 768 KB Output is correct
20 Correct 10 ms 768 KB Output is correct
21 Correct 62 ms 1912 KB Output is correct
22 Correct 52 ms 1964 KB Output is correct
23 Correct 52 ms 1912 KB Output is correct
24 Correct 49 ms 1912 KB Output is correct
25 Correct 42 ms 1920 KB Output is correct
26 Correct 71 ms 1912 KB Output is correct
27 Correct 57 ms 1920 KB Output is correct
28 Correct 60 ms 1960 KB Output is correct
29 Correct 54 ms 1912 KB Output is correct
30 Correct 47 ms 1912 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 3 ms 356 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 284 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 21 ms 896 KB Output is correct
17 Correct 21 ms 896 KB Output is correct
18 Correct 21 ms 896 KB Output is correct
19 Correct 21 ms 896 KB Output is correct
20 Correct 14 ms 512 KB Output is correct
21 Correct 85 ms 2288 KB Output is correct
22 Correct 73 ms 2288 KB Output is correct
23 Correct 77 ms 2288 KB Output is correct
24 Correct 84 ms 2288 KB Output is correct
25 Correct 71 ms 3332 KB Output is correct
26 Correct 77 ms 2288 KB Output is correct
27 Correct 70 ms 2288 KB Output is correct
28 Correct 67 ms 2288 KB Output is correct
29 Correct 67 ms 2296 KB Output is correct
30 Correct 34 ms 1528 KB Output is correct
31 Correct 2 ms 384 KB Output is correct
32 Correct 3 ms 384 KB Output is correct