Submission #593334

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
593334	2022-07-10T22:02:55 Z	YesPy	Gap (APIO16_gap)	C++17	100 / 100	53 ms	1876 KB

gap

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

#define maxs(i, j) (i = max(i, j))
#define fastio ios::sync_with_stdio(false);cin.tie(nullptr);
#define ln '\n'
#define nwln cout<<ln;

using namespace std;

typedef long long ll;

const ll LINF = 1001001001001001001;
ll a[100001], pos, ans, mn, mx;

ll findGap(int T, int N) {
	if(T == 1) {
		ll l = 1, r = LINF;
		
		for(int i = 0; i<((N+1)>>1); ++i) {
			MinMax(l, r, &mn, &mx);
			a[pos++] = mn, a[pos++] = mx;
			l = mn + 1, r = mx - 1;
		}

		sort(a, a + N);
		for(ll i=1; i<N; ++i) maxs(ans, (a[i] - a[i-1]));

		return ans;
	} else {
		MinMax(1, LINF, &mn, &mx);
		ll block = (mx - mn + N - 2)/(N - 1), Mn, Mx, L = mn;
		
		for(ans = block, pos=mn, ++block; (pos+block)<=mx; pos += block) {
			MinMax(pos, pos+block-1, &Mn, &Mx);
			if(Mn != -1) maxs(ans, (Mn - L)), L = Mx;
		}

		MinMax(pos, mx, &Mn, &Mx);
		if(Mn != -1) maxs(ans, (Mn - L));

		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	0 ms	208 KB	Output is correct
6	Correct	0 ms	260 KB	Output is correct
7	Correct	0 ms	208 KB	Output is correct
8	Correct	1 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	336 KB	Output is correct
16	Correct	9 ms	592 KB	Output is correct
17	Correct	9 ms	716 KB	Output is correct
18	Correct	10 ms	712 KB	Output is correct
19	Correct	10 ms	688 KB	Output is correct
20	Correct	7 ms	704 KB	Output is correct
21	Correct	36 ms	1876 KB	Output is correct
22	Correct	39 ms	1864 KB	Output is correct
23	Correct	36 ms	1736 KB	Output is correct
24	Correct	36 ms	1864 KB	Output is correct
25	Correct	32 ms	1760 KB	Output is correct
26	Correct	37 ms	1828 KB	Output is correct
27	Correct	37 ms	1840 KB	Output is correct
28	Correct	37 ms	1864 KB	Output is correct
29	Correct	37 ms	1832 KB	Output is correct
30	Correct	31 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	1 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	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	544 KB	Output is correct
17	Correct	11 ms	464 KB	Output is correct
18	Correct	11 ms	432 KB	Output is correct
19	Correct	11 ms	436 KB	Output is correct
20	Correct	6 ms	464 KB	Output is correct
21	Correct	51 ms	1068 KB	Output is correct
22	Correct	53 ms	1052 KB	Output is correct
23	Correct	46 ms	976 KB	Output is correct
24	Correct	48 ms	1076 KB	Output is correct
25	Correct	48 ms	1064 KB	Output is correct
26	Correct	47 ms	1088 KB	Output is correct
27	Correct	46 ms	1076 KB	Output is correct
28	Correct	47 ms	1088 KB	Output is correct
29	Correct	47 ms	968 KB	Output is correct
30	Correct	28 ms	976 KB	Output is correct
31	Correct	0 ms	208 KB	Output is correct
32	Correct	0 ms	208 KB	Output is correct