Submission #875934

# Submission time Handle Problem Language Result Execution time Memory
875934 2023-11-20T19:10:09 Z Lobo Gap (APIO16_gap) C++17
100 / 100
42 ms 4048 KB
#include "gap.h"
#include<bits/stdc++.h>
using namespace std;
#define int long long

int findGap(int32_t T, int32_t n)
{

	if(T == 1) {
		int mn,mx;
		vector<int> a(n+1);
		MinMax(0,(int) 1e18,&mn,&mx);
		a[1] = mn;
		a[n] = mx;
		int l = 2;
		int r = n-1;
		while(l <= r) {
			MinMax(a[l-1]+1,a[r+1]-1,&a[l],&a[r]);
			l++;
			r--;
		}

		int ans = 0;
		for(int i = 1; i <= n-1; i++) ans = max(ans, a[i+1]-a[i]);
		return ans;
		
	}
	else {

		int a1,an;
		MinMax(0,(int) 1e18,&a1,&an);

		int gap = (an-a1+n-1-1)/(n-1);
		int gap0 = gap;
		int ant = a1;
		for(int i = a1; i <= an; i+= gap0+1) {
			int mn,mx;
			MinMax(i,i+gap0,&mn,&mx);

			if(mn == -1) continue;
			gap = max(gap,mn-ant);
			ant = mx;
		}
		return gap;
	}
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2548 KB Output is correct
16 Correct 9 ms 2680 KB Output is correct
17 Correct 8 ms 2584 KB Output is correct
18 Correct 8 ms 2752 KB Output is correct
19 Correct 8 ms 2580 KB Output is correct
20 Correct 7 ms 2560 KB Output is correct
21 Correct 30 ms 3860 KB Output is correct
22 Correct 30 ms 3592 KB Output is correct
23 Correct 30 ms 3624 KB Output is correct
24 Correct 30 ms 3624 KB Output is correct
25 Correct 28 ms 3624 KB Output is correct
26 Correct 30 ms 3620 KB Output is correct
27 Correct 30 ms 4048 KB Output is correct
28 Correct 33 ms 3864 KB Output is correct
29 Correct 29 ms 3628 KB Output is correct
30 Correct 25 ms 3616 KB Output is correct
31 Correct 0 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 2392 KB Output is correct
2 Correct 0 ms 2392 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 0 ms 2392 KB Output is correct
6 Correct 0 ms 2392 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 0 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 2392 KB Output is correct
14 Correct 1 ms 2392 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 10 ms 2584 KB Output is correct
17 Correct 10 ms 2756 KB Output is correct
18 Correct 11 ms 2584 KB Output is correct
19 Correct 10 ms 2588 KB Output is correct
20 Correct 5 ms 2572 KB Output is correct
21 Correct 42 ms 2848 KB Output is correct
22 Correct 40 ms 2852 KB Output is correct
23 Correct 40 ms 3108 KB Output is correct
24 Correct 41 ms 3100 KB Output is correct
25 Correct 39 ms 2852 KB Output is correct
26 Correct 42 ms 2856 KB Output is correct
27 Correct 42 ms 3116 KB Output is correct
28 Correct 40 ms 2856 KB Output is correct
29 Correct 41 ms 3108 KB Output is correct
30 Correct 22 ms 2836 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct