답안 #1029884

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1029884	2024-07-21T13:14:52 Z	Muhammet	Gap (APIO16_gap)	C++17	30 / 100	50 ms	3724 KB

gap

#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;
			}
		}

		ans = max(ans,m-k);

		return ans;
	}
}

Subtask #1

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	344 KB	Output is 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	0 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	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	2 ms	2392 KB	Output is correct
13	Correct	1 ms	2392 KB	Output is correct
14	Correct	2 ms	2392 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct
16	Correct	7 ms	2904 KB	Output is correct
17	Correct	7 ms	2904 KB	Output is correct
18	Correct	9 ms	2720 KB	Output is correct
19	Correct	10 ms	2904 KB	Output is correct
20	Correct	5 ms	2904 KB	Output is correct
21	Correct	26 ms	3704 KB	Output is correct
22	Correct	39 ms	3596 KB	Output is correct
23	Correct	32 ms	3596 KB	Output is correct
24	Correct	30 ms	3708 KB	Output is correct
25	Correct	24 ms	3716 KB	Output is correct
26	Correct	28 ms	3576 KB	Output is correct
27	Correct	36 ms	3724 KB	Output is correct
28	Correct	36 ms	3708 KB	Output is correct
29	Correct	26 ms	3612 KB	Output is correct
30	Correct	22 ms	3580 KB	Output is correct
31	Correct	1 ms	2392 KB	Output is correct
32	Correct	1 ms	2392 KB	Output is correct

Subtask #2

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	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	0 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	2 ms	2392 KB	Output is correct
14	Correct	2 ms	2392 KB	Output is correct
15	Correct	1 ms	2392 KB	Output is correct
16	Correct	9 ms	2392 KB	Output is correct
17	Correct	9 ms	2392 KB	Output is correct
18	Correct	13 ms	2592 KB	Output is correct
19	Correct	11 ms	2552 KB	Output is correct
20	Correct	8 ms	2560 KB	Output is correct
21	Correct	50 ms	2856 KB	Output is correct
22	Correct	36 ms	2808 KB	Output is correct
23	Correct	38 ms	2648 KB	Output is correct
24	Correct	35 ms	2648 KB	Output is correct
25	Correct	32 ms	2648 KB	Output is correct
26	Correct	37 ms	2648 KB	Output is correct
27	Correct	40 ms	2860 KB	Output is correct
28	Correct	37 ms	2772 KB	Output is correct
29	Correct	45 ms	2812 KB	Output is correct
30	Correct	18 ms	2864 KB	Output is correct
31	Correct	1 ms	2392 KB	Output is correct
32	Correct	0 ms	2392 KB	Output is correct