oj.uz

답안 #1029891

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029891 2024-07-21T13:26:33 Z Muhammet Gap (APIO16_gap) C++17
100 / 100
 45 ms 3948 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, ind = 0;
		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;
			}
			ind = i;
		}

		ind += d;

		ll x;
		MinMax(ind+1,m-1,&mn,&x);
		if(mn != -1) ans = max(ans, mn-k);
		if(x == -1){
			ans = max(ans,m-k);
		}
		else {
			ans = max(ans,m-x);
		}

		return ans;
	}
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 ms 2388 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 1 ms 2392 KB Output is correct
9 Correct 0 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 11 ms 2812 KB Output is correct
17 Correct 7 ms 2904 KB Output is correct
18 Correct 6 ms 2720 KB Output is correct
19 Correct 6 ms 2904 KB Output is correct
20 Correct 7 ms 2820 KB Output is correct
21 Correct 31 ms 3684 KB Output is correct
22 Correct 29 ms 3648 KB Output is correct
23 Correct 37 ms 3948 KB Output is correct
24 Correct 27 ms 3716 KB Output is correct
25 Correct 31 ms 3716 KB Output is correct
26 Correct 24 ms 3716 KB Output is correct
27 Correct 27 ms 3716 KB Output is correct
28 Correct 30 ms 3604 KB Output is correct
29 Correct 30 ms 3716 KB Output is correct
30 Correct 21 ms 3708 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2392 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 0 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 0 ms 2392 KB Output is correct
8 Correct 0 ms 2392 KB Output is correct
9 Correct 0 ms 2392 KB Output is correct
10 Correct 0 ms 2460 KB Output is correct
11 Correct 2 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 2 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 12 ms 2592 KB Output is correct
17 Correct 11 ms 2392 KB Output is correct
18 Correct 10 ms 2588 KB Output is correct
19 Correct 9 ms 2388 KB Output is correct
20 Correct 6 ms 2644 KB Output is correct
21 Correct 37 ms 2836 KB Output is correct
22 Correct 36 ms 2648 KB Output is correct
23 Correct 41 ms 2648 KB Output is correct
24 Correct 44 ms 2648 KB Output is correct
25 Correct 36 ms 2648 KB Output is correct
26 Correct 42 ms 2808 KB Output is correct
27 Correct 44 ms 2648 KB Output is correct
28 Correct 45 ms 2648 KB Output is correct
29 Correct 43 ms 2852 KB Output is correct
30 Correct 20 ms 2648 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 0 ms 2392 KB Output is correct