Submission #24674

# Submission time Handle Problem Language Result Execution time Memory
24674 2017-06-11T06:37:32 Z chan492811 Gap (APIO16_gap) C++11
100 / 100
79 ms 4240 KB
#include "gap.h"
#include <cstdio>
#include <algorithm>
#define ll long long
#define MAX_V (ll)1e18
using namespace std;

ll res;

long long findGap(int t, int n){
	int i;
	ll l, r, nl, nr, now, tmp;
	MinMax(0ll, MAX_V, &l, &r);
	if(t == 1){
		n -= 2;
		while(n > 0){
			MinMax(l + 1, r - 1, &nl, &nr);
			res = max(res, max(r - nr, nl - l));
			l = nl; r = nr;
			n -= 2;
		}
		res = max(res, r - l);
		return res;
	}
	res = now = (r - l + (n - 2)) / (n - 1); nl = l;
	for(i = 1; i < n; i++){
		MinMax(l + now * (i - 1) + i, l + now * i + i, &nr, &tmp);
		res = max(res, nr - nl);
		if(tmp != -1) nl = tmp;
	}
	return res;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 4240 KB Output is correct
2 Correct 0 ms 4240 KB Output is correct
3 Correct 0 ms 4240 KB Output is correct
4 Correct 0 ms 4240 KB Output is correct
5 Correct 0 ms 4240 KB Output is correct
6 Correct 0 ms 4240 KB Output is correct
7 Correct 0 ms 4240 KB Output is correct
8 Correct 0 ms 4240 KB Output is correct
9 Correct 0 ms 4240 KB Output is correct
10 Correct 0 ms 4240 KB Output is correct
11 Correct 0 ms 4240 KB Output is correct
12 Correct 0 ms 4240 KB Output is correct
13 Correct 0 ms 4240 KB Output is correct
14 Correct 0 ms 4240 KB Output is correct
15 Correct 0 ms 4240 KB Output is correct
16 Correct 16 ms 4240 KB Output is correct
17 Correct 9 ms 4240 KB Output is correct
18 Correct 16 ms 4240 KB Output is correct
19 Correct 9 ms 4240 KB Output is correct
20 Correct 9 ms 4240 KB Output is correct
21 Correct 69 ms 4240 KB Output is correct
22 Correct 63 ms 4240 KB Output is correct
23 Correct 43 ms 4240 KB Output is correct
24 Correct 56 ms 4240 KB Output is correct
25 Correct 43 ms 4240 KB Output is correct
26 Correct 56 ms 4240 KB Output is correct
27 Correct 66 ms 4240 KB Output is correct
28 Correct 53 ms 4240 KB Output is correct
29 Correct 53 ms 4240 KB Output is correct
30 Correct 43 ms 4240 KB Output is correct
31 Correct 0 ms 4240 KB Output is correct
32 Correct 0 ms 4240 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 4240 KB Output is correct
2 Correct 0 ms 4240 KB Output is correct
3 Correct 0 ms 4240 KB Output is correct
4 Correct 0 ms 4240 KB Output is correct
5 Correct 0 ms 4240 KB Output is correct
6 Correct 0 ms 4240 KB Output is correct
7 Correct 0 ms 4240 KB Output is correct
8 Correct 0 ms 4240 KB Output is correct
9 Correct 0 ms 4240 KB Output is correct
10 Correct 0 ms 4240 KB Output is correct
11 Correct 0 ms 4240 KB Output is correct
12 Correct 0 ms 4240 KB Output is correct
13 Correct 0 ms 4240 KB Output is correct
14 Correct 0 ms 4240 KB Output is correct
15 Correct 0 ms 4240 KB Output is correct
16 Correct 13 ms 4240 KB Output is correct
17 Correct 19 ms 4240 KB Output is correct
18 Correct 19 ms 4240 KB Output is correct
19 Correct 23 ms 4240 KB Output is correct
20 Correct 6 ms 4240 KB Output is correct
21 Correct 79 ms 4240 KB Output is correct
22 Correct 79 ms 4240 KB Output is correct
23 Correct 79 ms 4240 KB Output is correct
24 Correct 79 ms 4240 KB Output is correct
25 Correct 73 ms 4240 KB Output is correct
26 Correct 73 ms 4240 KB Output is correct
27 Correct 73 ms 4240 KB Output is correct
28 Correct 73 ms 4240 KB Output is correct
29 Correct 76 ms 4240 KB Output is correct
30 Correct 36 ms 4240 KB Output is correct
31 Correct 0 ms 4240 KB Output is correct
32 Correct 0 ms 4240 KB Output is correct