Submission #21966

# Submission time Handle Problem Language Result Execution time Memory
21966 2017-04-27T21:24:30 Z RezwanArefin01 Gap (APIO16_gap) C++14
100 / 100
73 ms 5144 KB
#include <bits/stdc++.h>
using namespace std; 
typedef long long ll;
void MinMax(long long, long long, long long*, long long*);
long long findGap(int T, int N) {
	if(T==1) {
		ll pmn, pmx, mn, mx, ret = 0; 
		MinMax(0, (ll)1e18+10, &pmn, &pmx);
		for(int i=1; i<(N+1)/2; i++) {
			MinMax(pmn+1, pmx-1, &mn, &mx);
			ret = max(ret, mn - pmn);
			ret = max(ret, pmx - mx);
			pmn = mn, pmx = mx;
		} ret = max(ret, pmx - pmn);
		return ret;
	} else { 
		ll st, ed, ret = 0;
		MinMax(0, (ll)2e18+10, &st, &ed);
		if(N == 2) return ed - st;
		ll gap = (ed - st + N - 1) / N, prev = st;
		for(ll i=st+1, j=i + gap, b = 1; b<N; i=j+1, j=i+gap) {
			j = min(j, ed-1);
			if(i > j) break;
			ll mn, mx; 
			MinMax(i, j, &mn, &mx);
			if(mn != -1) {
				ret = max(ret, mn - prev);
				prev = mx;
			}
		} return max(ret, ed - prev);
	}
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 5144 KB Output is correct
2 Correct 0 ms 5144 KB Output is correct
3 Correct 0 ms 5144 KB Output is correct
4 Correct 0 ms 5144 KB Output is correct
5 Correct 0 ms 5144 KB Output is correct
6 Correct 0 ms 5144 KB Output is correct
7 Correct 0 ms 5144 KB Output is correct
8 Correct 0 ms 5144 KB Output is correct
9 Correct 0 ms 5144 KB Output is correct
10 Correct 0 ms 5144 KB Output is correct
11 Correct 0 ms 5144 KB Output is correct
12 Correct 0 ms 5144 KB Output is correct
13 Correct 0 ms 5144 KB Output is correct
14 Correct 0 ms 5144 KB Output is correct
15 Correct 0 ms 5144 KB Output is correct
16 Correct 9 ms 5144 KB Output is correct
17 Correct 13 ms 5144 KB Output is correct
18 Correct 9 ms 5144 KB Output is correct
19 Correct 13 ms 5144 KB Output is correct
20 Correct 6 ms 5144 KB Output is correct
21 Correct 39 ms 5144 KB Output is correct
22 Correct 43 ms 5144 KB Output is correct
23 Correct 43 ms 5144 KB Output is correct
24 Correct 46 ms 5144 KB Output is correct
25 Correct 36 ms 5144 KB Output is correct
26 Correct 49 ms 5144 KB Output is correct
27 Correct 53 ms 5144 KB Output is correct
28 Correct 53 ms 5144 KB Output is correct
29 Correct 53 ms 5144 KB Output is correct
30 Correct 36 ms 5144 KB Output is correct
31 Correct 0 ms 5144 KB Output is correct
32 Correct 0 ms 5144 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 5144 KB Output is correct
2 Correct 0 ms 5144 KB Output is correct
3 Correct 0 ms 5144 KB Output is correct
4 Correct 0 ms 5144 KB Output is correct
5 Correct 0 ms 5144 KB Output is correct
6 Correct 0 ms 5144 KB Output is correct
7 Correct 0 ms 5144 KB Output is correct
8 Correct 0 ms 5144 KB Output is correct
9 Correct 0 ms 5144 KB Output is correct
10 Correct 0 ms 5144 KB Output is correct
11 Correct 0 ms 5144 KB Output is correct
12 Correct 0 ms 5144 KB Output is correct
13 Correct 0 ms 5144 KB Output is correct
14 Correct 0 ms 5144 KB Output is correct
15 Correct 0 ms 5144 KB Output is correct
16 Correct 19 ms 5144 KB Output is correct
17 Correct 16 ms 5144 KB Output is correct
18 Correct 16 ms 5144 KB Output is correct
19 Correct 16 ms 5144 KB Output is correct
20 Correct 6 ms 5144 KB Output is correct
21 Correct 63 ms 5144 KB Output is correct
22 Correct 66 ms 5144 KB Output is correct
23 Correct 66 ms 5144 KB Output is correct
24 Correct 69 ms 5144 KB Output is correct
25 Correct 66 ms 5144 KB Output is correct
26 Correct 73 ms 5144 KB Output is correct
27 Correct 73 ms 5144 KB Output is correct
28 Correct 69 ms 5144 KB Output is correct
29 Correct 56 ms 5144 KB Output is correct
30 Correct 33 ms 5144 KB Output is correct
31 Correct 0 ms 5144 KB Output is correct
32 Correct 0 ms 5144 KB Output is correct