답안 #1105740

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1105740	2024-10-27T14:31:48 Z	mariaclara	Gap (APIO16_gap)	C++17	100 / 100	36 ms	3584 KB

gap

#include "gap.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
const ll INF = 1e18;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first 
#define sc second 

ll findGap(int T, int N) {

	if(T == 1) {
		vector<ll> a(N);
		int l = 0, r = N-1;
		ll val1 = 0, val2 = INF;

		while(l <= r) {
			MinMax(val1, val2, &a[l], &a[r]);
			val1 = a[l] + 1;
			val2 = a[r] - 1;
			l++;
			r--;
		}

		ll ans = 0;
		for(int i = 1; i < N; i++) 
			ans = max(ans, a[i] - a[i-1]);

		return ans;
	}

	ll at, last;
	MinMax(0, INF, &at, &last);
	ll ans = (last-at + N-2)/(N-1), val = at + ans + 1;

	while(at < last) {
		ll a, b;
		MinMax(at+1, val, &a, &b);

		if(a != -1) { 
			ans = max(ans, a - at);
			at = b;
			val = at + ans + 1;
			continue;
		}

		ans++;
		val += ans;
	}

	return ans;
}

Subtask #1

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	336 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2384 KB	Output is correct
9	Correct	1 ms	2384 KB	Output is correct
10	Correct	1 ms	2384 KB	Output is correct
11	Correct	1 ms	2384 KB	Output is correct
12	Correct	2 ms	2396 KB	Output is correct
13	Correct	1 ms	2384 KB	Output is correct
14	Correct	1 ms	2384 KB	Output is correct
15	Correct	1 ms	2384 KB	Output is correct
16	Correct	8 ms	2640 KB	Output is correct
17	Correct	9 ms	2640 KB	Output is correct
18	Correct	8 ms	2640 KB	Output is correct
19	Correct	7 ms	2640 KB	Output is correct
20	Correct	6 ms	2640 KB	Output is correct
21	Correct	30 ms	3408 KB	Output is correct
22	Correct	26 ms	3408 KB	Output is correct
23	Correct	36 ms	3484 KB	Output is correct
24	Correct	27 ms	3408 KB	Output is correct
25	Correct	24 ms	3408 KB	Output is correct
26	Correct	28 ms	3408 KB	Output is correct
27	Correct	29 ms	3584 KB	Output is correct
28	Correct	29 ms	3408 KB	Output is correct
29	Correct	28 ms	3408 KB	Output is correct
30	Correct	23 ms	3408 KB	Output is correct
31	Correct	1 ms	2384 KB	Output is correct
32	Correct	1 ms	2384 KB	Output is correct

Subtask #2

70.0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2484 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2384 KB	Output is correct
9	Correct	1 ms	2384 KB	Output is correct
10	Correct	1 ms	2384 KB	Output is correct
11	Correct	1 ms	2384 KB	Output is correct
12	Correct	1 ms	2384 KB	Output is correct
13	Correct	1 ms	2384 KB	Output is correct
14	Correct	1 ms	2384 KB	Output is correct
15	Correct	1 ms	2384 KB	Output is correct
16	Correct	6 ms	2384 KB	Output is correct
17	Correct	6 ms	2384 KB	Output is correct
18	Correct	6 ms	2384 KB	Output is correct
19	Correct	6 ms	2384 KB	Output is correct
20	Correct	3 ms	2556 KB	Output is correct
21	Correct	18 ms	2640 KB	Output is correct
22	Correct	21 ms	2764 KB	Output is correct
23	Correct	18 ms	2640 KB	Output is correct
24	Correct	20 ms	2736 KB	Output is correct
25	Correct	35 ms	2640 KB	Output is correct
26	Correct	20 ms	2640 KB	Output is correct
27	Correct	34 ms	2640 KB	Output is correct
28	Correct	22 ms	2640 KB	Output is correct
29	Correct	31 ms	2640 KB	Output is correct
30	Correct	18 ms	2640 KB	Output is correct
31	Correct	1 ms	2384 KB	Output is correct
32	Correct	1 ms	2384 KB	Output is correct