Submission #1029883

# Submission time Handle Problem Language Result Execution time Memory
1029883 2024-07-21T13:13:45 Z Muhammet Gap (APIO16_gap) C++17
30 / 100
45 ms 3736 KB
#include <bits/stdc++.h>
#include "gap.h"

using namespace std;

#define ll long long
#define sz(s) (int)s.size()

ll findGap(int T, int n){
	if(T == 1){
		vector <ll> v, v1;
		ll ans = 0;
		ll k = 0;
		for(int i = 1; i <= (n+1)/2; i++){
			ll s, t, mn, mx;
			if(i == 1) s = 0, t = 1e18;
			else s = v.back()+1, t = v1.back()-1;
			if(s > t) break;
			MinMax(s, t, &mn, &mx);
			if(mn != -1) v.push_back(mn);
			if(mx != -1) v1.push_back(mx);
			k += (t-s+1);
			if(sz(v) > 1) ans = max(ans, (v.back()-v[sz(v)-2]));
			if(sz(v1) > 1) ans = max(ans, (v1[sz(v1)-2]-v1.back()));
			if(i == (n+1)/2) ans = max(ans, v1.back()-v.back());
		}
		return ans;
	}
	else {
		ll s = 0, t = 1e18, mn, mx;
		MinMax(s, t, &mn, &mx);
		ll d = ((mx - mn + 1) / (n - 1)), k = mn, ans = d, m = mx;
		for(ll i = mn+1; i + d < m; i += (d + 1)){
			MinMax(i, i + d, &mn, &mx);
			if(mn != -1){
				ans = max(ans, mn-k);
			}
			if(mx != -1){
				k = mx;
			}
		}

		ans = max(ans,m-k);

		return ans;
	}
}
# 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 0 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 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 1 ms 2392 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 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 6 ms 2740 KB Output is correct
17 Correct 7 ms 2904 KB Output is correct
18 Correct 8 ms 2904 KB Output is correct
19 Correct 7 ms 2904 KB Output is correct
20 Correct 6 ms 2720 KB Output is correct
21 Correct 36 ms 3524 KB Output is correct
22 Correct 21 ms 3716 KB Output is correct
23 Correct 22 ms 3716 KB Output is correct
24 Correct 28 ms 3732 KB Output is correct
25 Correct 20 ms 3676 KB Output is correct
26 Correct 39 ms 3644 KB Output is correct
27 Correct 36 ms 3708 KB Output is correct
28 Correct 29 ms 3736 KB Output is correct
29 Correct 36 ms 3708 KB Output is correct
30 Correct 25 ms 3716 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2392 KB Output isn't correct
2 Correct 0 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 1 ms 2392 KB Output is correct
6 Correct 1 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 Incorrect 1 ms 2392 KB Output isn't 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 11 ms 2392 KB Output is correct
17 Correct 10 ms 2392 KB Output is correct
18 Correct 12 ms 2388 KB Output is correct
19 Correct 8 ms 2392 KB Output is correct
20 Correct 5 ms 2592 KB Output is correct
21 Correct 45 ms 2648 KB Output is correct
22 Correct 40 ms 2648 KB Output is correct
23 Correct 34 ms 2868 KB Output is correct
24 Correct 38 ms 2648 KB Output is correct
25 Correct 32 ms 2856 KB Output is correct
26 Correct 35 ms 2648 KB Output is correct
27 Correct 42 ms 2768 KB Output is correct
28 Correct 43 ms 2648 KB Output is correct
29 Correct 43 ms 2896 KB Output is correct
30 Correct 21 ms 2648 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct