답안 #45274

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
45274 2018-04-12T12:47:38 Z nibnalin Gap (APIO16_gap) C++17
83.5083 / 100
96 ms 2280 KB
#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-1)/(n+1);
	lli prev = range.first;
	pair<lli, lli> cur = {range.first+1, range.first+sz};
	while(cur.first < range.second)
	{
		pair<lli, lli> res;
		//cout << cur.first << " " << cur.second << "\n";
		MinMax(cur.first, min(cur.second, range.second-1), &res.first, &res.second);
		if(res.first != -1)
		{
			//cout << "v: " << res.first << " " << prev << " " << res.second << "\n";
			ans = max(ans, res.first-prev);
			prev = res.second;
		}
		cur.first = cur.second+1;
		cur.second = 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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 556 KB Output is correct
4 Correct 2 ms 556 KB Output is correct
5 Correct 2 ms 556 KB Output is correct
6 Correct 2 ms 556 KB Output is correct
7 Correct 2 ms 556 KB Output is correct
8 Correct 2 ms 588 KB Output is correct
9 Correct 2 ms 588 KB Output is correct
10 Correct 2 ms 588 KB Output is correct
11 Correct 3 ms 824 KB Output is correct
12 Correct 3 ms 824 KB Output is correct
13 Correct 2 ms 824 KB Output is correct
14 Correct 3 ms 824 KB Output is correct
15 Correct 3 ms 824 KB Output is correct
16 Correct 16 ms 1020 KB Output is correct
17 Correct 15 ms 1020 KB Output is correct
18 Correct 16 ms 1020 KB Output is correct
19 Correct 22 ms 1020 KB Output is correct
20 Correct 12 ms 1020 KB Output is correct
21 Correct 58 ms 2280 KB Output is correct
22 Correct 58 ms 2280 KB Output is correct
23 Correct 59 ms 2280 KB Output is correct
24 Correct 60 ms 2280 KB Output is correct
25 Correct 50 ms 2280 KB Output is correct
26 Correct 59 ms 2280 KB Output is correct
27 Correct 59 ms 2280 KB Output is correct
28 Correct 60 ms 2280 KB Output is correct
29 Correct 59 ms 2280 KB Output is correct
30 Correct 60 ms 2280 KB Output is correct
31 Correct 2 ms 2280 KB Output is correct
32 Correct 2 ms 2280 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Partially correct 2 ms 2280 KB Partially correct
2 Partially correct 2 ms 2280 KB Partially correct
3 Partially correct 2 ms 2280 KB Partially correct
4 Partially correct 2 ms 2280 KB Partially correct
5 Partially correct 2 ms 2280 KB Partially correct
6 Partially correct 2 ms 2280 KB Partially correct
7 Partially correct 2 ms 2280 KB Partially correct
8 Partially correct 2 ms 2280 KB Partially correct
9 Partially correct 2 ms 2280 KB Partially correct
10 Partially correct 1 ms 2280 KB Partially correct
11 Partially correct 3 ms 2280 KB Partially correct
12 Partially correct 3 ms 2280 KB Partially correct
13 Partially correct 3 ms 2280 KB Partially correct
14 Partially correct 4 ms 2280 KB Partially correct
15 Partially correct 3 ms 2280 KB Partially correct
16 Partially correct 29 ms 2280 KB Partially correct
17 Partially correct 20 ms 2280 KB Partially correct
18 Partially correct 26 ms 2280 KB Partially correct
19 Partially correct 20 ms 2280 KB Partially correct
20 Partially correct 11 ms 2280 KB Partially correct
21 Partially correct 78 ms 2280 KB Partially correct
22 Partially correct 76 ms 2280 KB Partially correct
23 Partially correct 75 ms 2280 KB Partially correct
24 Partially correct 96 ms 2280 KB Partially correct
25 Partially correct 73 ms 2280 KB Partially correct
26 Partially correct 85 ms 2280 KB Partially correct
27 Partially correct 77 ms 2280 KB Partially correct
28 Partially correct 76 ms 2280 KB Partially correct
29 Partially correct 77 ms 2280 KB Partially correct
30 Partially correct 44 ms 2280 KB Partially correct
31 Partially correct 2 ms 2280 KB Partially correct
32 Partially correct 2 ms 2280 KB Partially correct