Submission #591724

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
591724	2022-07-07T19:28:27 Z	piOOE	Gap (APIO16_gap)	C++17	100 / 100	59 ms	1872 KB

gap

#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
ll findGap(int T, int N) {
    const ll inf = 1'000'000'000'000'000'000LL;
    ll mn = -1, mx  = inf + 1;
    if (T == 1) {
        vector<ll> a(N);
        ll ans = -inf;
        for (int l = 0, r = N - 1; l <= r; ++l, --r) {
            MinMax(mn + 1, mx - 1, &mn, &mx);
            assert(mn != -1);
            a[l] = mn, a[r] = mx;
        }
        for (int i = 0; i < N - 1; ++i) {
            ans = max(ans, a[i + 1] - a[i]);
        }
        return ans;
    } else {
        MinMax(0, inf, &mn, &mx);
        ll sum = mx - mn;
        ll ans = -inf;
        ll len = (sum + (N - 1) - 1) / (N - 1);
        ll R = mx;
        for (int i = N - 1; i > 0; --i) {
            ll nw = mx;
            MinMax(mx - len, mx - 1, &mn, &mx);
            if (mx != -1) {
                ans = max(ans, R - mx);
                R = mn;
            }
            mx = nw - len;
        }
        return ans;
    }
}

Subtask #1

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	1 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	1 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	0 ms	208 KB	Output is correct
10	Correct	0 ms	208 KB	Output is correct
11	Correct	1 ms	336 KB	Output is correct
12	Correct	1 ms	336 KB	Output is correct
13	Correct	1 ms	336 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	292 KB	Output is correct
16	Correct	9 ms	596 KB	Output is correct
17	Correct	9 ms	608 KB	Output is correct
18	Correct	9 ms	604 KB	Output is correct
19	Correct	10 ms	636 KB	Output is correct
20	Correct	7 ms	720 KB	Output is correct
21	Correct	40 ms	1824 KB	Output is correct
22	Correct	55 ms	1800 KB	Output is correct
23	Correct	37 ms	1828 KB	Output is correct
24	Correct	34 ms	1864 KB	Output is correct
25	Correct	34 ms	1812 KB	Output is correct
26	Correct	42 ms	1808 KB	Output is correct
27	Correct	38 ms	1816 KB	Output is correct
28	Correct	35 ms	1868 KB	Output is correct
29	Correct	35 ms	1824 KB	Output is correct
30	Correct	29 ms	1872 KB	Output is correct
31	Correct	0 ms	208 KB	Output is correct
32	Correct	0 ms	208 KB	Output is correct

Subtask #2

70.0 / 70.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	0 ms	208 KB	Output is correct
7	Correct	0 ms	208 KB	Output is correct
8	Correct	0 ms	208 KB	Output is correct
9	Correct	0 ms	208 KB	Output is correct
10	Correct	0 ms	208 KB	Output is correct
11	Correct	1 ms	208 KB	Output is correct
12	Correct	1 ms	208 KB	Output is correct
13	Correct	1 ms	208 KB	Output is correct
14	Correct	1 ms	336 KB	Output is correct
15	Correct	1 ms	336 KB	Output is correct
16	Correct	12 ms	464 KB	Output is correct
17	Correct	13 ms	464 KB	Output is correct
18	Correct	11 ms	464 KB	Output is correct
19	Correct	14 ms	428 KB	Output is correct
20	Correct	7 ms	464 KB	Output is correct
21	Correct	59 ms	1088 KB	Output is correct
22	Correct	49 ms	1056 KB	Output is correct
23	Correct	50 ms	1080 KB	Output is correct
24	Correct	50 ms	1052 KB	Output is correct
25	Correct	47 ms	1068 KB	Output is correct
26	Correct	52 ms	1084 KB	Output is correct
27	Correct	51 ms	1032 KB	Output is correct
28	Correct	57 ms	1012 KB	Output is correct
29	Correct	56 ms	1076 KB	Output is correct
30	Correct	29 ms	1104 KB	Output is correct
31	Correct	0 ms	208 KB	Output is correct
32	Correct	1 ms	208 KB	Output is correct