Submission #1029886

# Submission time Handle Problem Language Result Execution time Memory
1029886 2024-07-21T13:17:42 Z Muhammet Gap (APIO16_gap) C++17
30 / 100
46 ms 2048 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 + n - 2) / (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;
			}
		}

		ll x;
		MinMax(0,m-1,&mn,&x);
		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 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 6 ms 856 KB Output is correct
17 Correct 8 ms 856 KB Output is correct
18 Correct 8 ms 856 KB Output is correct
19 Correct 9 ms 828 KB Output is correct
20 Correct 7 ms 856 KB Output is correct
21 Correct 36 ms 1916 KB Output is correct
22 Correct 36 ms 1916 KB Output is correct
23 Correct 35 ms 1932 KB Output is correct
24 Correct 26 ms 1936 KB Output is correct
25 Correct 23 ms 1924 KB Output is correct
26 Correct 31 ms 1916 KB Output is correct
27 Correct 34 ms 2028 KB Output is correct
28 Correct 35 ms 1972 KB Output is correct
29 Correct 25 ms 1924 KB Output is correct
30 Correct 29 ms 2048 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Partially correct 0 ms 344 KB Partially correct
3 Partially correct 0 ms 344 KB Partially correct
4 Partially correct 0 ms 344 KB Partially correct
5 Partially correct 0 ms 344 KB Partially correct
6 Partially correct 0 ms 344 KB Partially correct
7 Partially correct 1 ms 340 KB Partially correct
8 Partially correct 1 ms 344 KB Partially correct
9 Partially correct 1 ms 344 KB Partially correct
10 Incorrect 1 ms 344 KB Output isn't correct
11 Partially correct 1 ms 344 KB Partially correct
12 Partially correct 1 ms 344 KB Partially correct
13 Partially correct 1 ms 344 KB Partially correct
14 Partially correct 1 ms 344 KB Partially correct
15 Partially correct 1 ms 344 KB Partially correct
16 Partially correct 10 ms 600 KB Partially correct
17 Partially correct 9 ms 600 KB Partially correct
18 Partially correct 10 ms 600 KB Partially correct
19 Partially correct 8 ms 600 KB Partially correct
20 Partially correct 6 ms 600 KB Partially correct
21 Partially correct 41 ms 1112 KB Partially correct
22 Partially correct 44 ms 1232 KB Partially correct
23 Partially correct 43 ms 1052 KB Partially correct
24 Partially correct 46 ms 1204 KB Partially correct
25 Partially correct 37 ms 1112 KB Partially correct
26 Partially correct 44 ms 1208 KB Partially correct
27 Partially correct 40 ms 1112 KB Partially correct
28 Partially correct 46 ms 1112 KB Partially correct
29 Partially correct 40 ms 1112 KB Partially correct
30 Partially correct 20 ms 1112 KB Partially correct
31 Partially correct 1 ms 344 KB Partially correct
32 Partially correct 0 ms 344 KB Partially correct