답안 #45284

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
45284	2018-04-12T13:26:28 Z	nibnalin	Gap (APIO16_gap)	C++17	100 / 100	87 ms	2244 KB

gap

#include <iostream>
#include <cstdio>
#include <vector>
#include "gap.h"
using namespace std;
 
typedef long long int lli;
 
const lli maxn = lli(1e5)+5, inf = lli(1e18)+1;
 
lli ans = 0, A[maxn];
 
void sub1(lli n)
{
	pair<lli, lli> range = {0, inf};
	lli L = 0, R = n-1;
	while(L <= R)
	{
		MinMax(range.first, range.second, &A[L], &A[R]);
		range.first = A[L]+1, range.second = A[R]-1;
		L++, R--;
	}
	for(lli i = 1;i < n;i++) ans = max(ans, A[i]-A[i-1]);
}
 
void sub2(lli n)
{
	pair<lli, lli> range;
	MinMax(0, inf, &range.first, &range.second);
	lli sz = (range.second-range.first+n-1)/(n-1);
	lli prev = range.first;
	pair<lli, lli> cur = {range.first+1, min(range.second-1, range.first+sz)};
	while(cur.first < range.second)
	{
		pair<lli, lli> res;
		//cout << cur.first << " " << cur.second << "\n";
		MinMax(cur.first, cur.second, &res.first, &res.second);
		if(res.first != -1)
		{
			ans = max(ans, res.first-prev);
			prev = res.second;
		}
		cur.first = cur.second+1;
		cur.second = min(range.second-1, cur.first+sz-1);
	}
	ans = max(ans, range.second-prev);
}
 
lli findGap(int t, int n)
{
	if(t == 1) sub1(n);
	else sub2(n);
	return ans;
}

Subtask #1

30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	376 KB	Output is correct
3	Correct	2 ms	428 KB	Output is correct
4	Correct	2 ms	428 KB	Output is correct
5	Correct	2 ms	428 KB	Output is correct
6	Correct	2 ms	604 KB	Output is correct
7	Correct	2 ms	604 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	2 ms	604 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	3 ms	836 KB	Output is correct
12	Correct	3 ms	836 KB	Output is correct
13	Correct	2 ms	836 KB	Output is correct
14	Correct	3 ms	836 KB	Output is correct
15	Correct	3 ms	836 KB	Output is correct
16	Correct	16 ms	996 KB	Output is correct
17	Correct	15 ms	996 KB	Output is correct
18	Correct	16 ms	996 KB	Output is correct
19	Correct	15 ms	996 KB	Output is correct
20	Correct	11 ms	996 KB	Output is correct
21	Correct	56 ms	2160 KB	Output is correct
22	Correct	68 ms	2160 KB	Output is correct
23	Correct	54 ms	2160 KB	Output is correct
24	Correct	63 ms	2160 KB	Output is correct
25	Correct	54 ms	2160 KB	Output is correct
26	Correct	61 ms	2168 KB	Output is correct
27	Correct	55 ms	2168 KB	Output is correct
28	Correct	62 ms	2244 KB	Output is correct
29	Correct	65 ms	2244 KB	Output is correct
30	Correct	56 ms	2244 KB	Output is correct
31	Correct	2 ms	2244 KB	Output is correct
32	Correct	2 ms	2244 KB	Output is correct

Subtask #2

70.0 / 70.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	2244 KB	Output is correct
2	Correct	2 ms	2244 KB	Output is correct
3	Correct	2 ms	2244 KB	Output is correct
4	Correct	2 ms	2244 KB	Output is correct
5	Correct	2 ms	2244 KB	Output is correct
6	Correct	2 ms	2244 KB	Output is correct
7	Correct	2 ms	2244 KB	Output is correct
8	Correct	2 ms	2244 KB	Output is correct
9	Correct	2 ms	2244 KB	Output is correct
10	Correct	2 ms	2244 KB	Output is correct
11	Correct	3 ms	2244 KB	Output is correct
12	Correct	3 ms	2244 KB	Output is correct
13	Correct	3 ms	2244 KB	Output is correct
14	Correct	4 ms	2244 KB	Output is correct
15	Correct	4 ms	2244 KB	Output is correct
16	Correct	27 ms	2244 KB	Output is correct
17	Correct	26 ms	2244 KB	Output is correct
18	Correct	27 ms	2244 KB	Output is correct
19	Correct	26 ms	2244 KB	Output is correct
20	Correct	10 ms	2244 KB	Output is correct
21	Correct	79 ms	2244 KB	Output is correct
22	Correct	77 ms	2244 KB	Output is correct
23	Correct	78 ms	2244 KB	Output is correct
24	Correct	76 ms	2244 KB	Output is correct
25	Correct	67 ms	2244 KB	Output is correct
26	Correct	87 ms	2244 KB	Output is correct
27	Correct	71 ms	2244 KB	Output is correct
28	Correct	72 ms	2244 KB	Output is correct
29	Correct	76 ms	2244 KB	Output is correct
30	Correct	56 ms	2244 KB	Output is correct
31	Correct	3 ms	2244 KB	Output is correct
32	Correct	2 ms	2244 KB	Output is correct