oj.uz

답안 #45281

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
45281 2018-04-12T13:11:42 Z nibnalin Gap (APIO16_gap) C++17
89.0376 / 100
 107 ms 2276 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);
	if(n == 2)
	{
		ans = max(range.second-range.first, ans);
		return;
	}
	lli sz = (range.second-range.first-1)/(n-1);
	lli prev = range.first;
	pair<lli, lli> cur = {range.first+1, min(range.second-1, range.first+sz)};
	bool emp = 0;
	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)
		{
			//cout << "v: " << res.first << " " << prev << " " << res.second << "\n";
			ans = max(ans, res.first-prev);
			prev = res.second;
			//if(emp == 1) return;
			emp = 0;
		}
		else emp = 1;
		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;
}

Compilation message

gap.cpp: In function 'void sub2(lli)':
gap.cpp:38:7: warning: variable 'emp' set but not used [-Wunused-but-set-variable]
  bool emp = 0;
       ^~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 248 KB Output is correct
2 Correct 2 ms 356 KB Output is correct
3 Correct 2 ms 536 KB Output is correct
4 Correct 2 ms 536 KB Output is correct
5 Correct 2 ms 536 KB Output is correct
6 Correct 3 ms 536 KB Output is correct
7 Correct 2 ms 536 KB Output is correct
8 Correct 2 ms 536 KB Output is correct
9 Correct 2 ms 536 KB Output is correct
10 Correct 2 ms 572 KB Output is correct
11 Correct 2 ms 572 KB Output is correct
12 Correct 3 ms 612 KB Output is correct
13 Correct 3 ms 612 KB Output is correct
14 Correct 3 ms 612 KB Output is correct
15 Correct 3 ms 612 KB Output is correct
16 Correct 16 ms 928 KB Output is correct
17 Correct 21 ms 928 KB Output is correct
18 Correct 17 ms 1016 KB Output is correct
19 Correct 15 ms 1016 KB Output is correct
20 Correct 17 ms 1016 KB Output is correct
21 Correct 66 ms 2276 KB Output is correct
22 Correct 54 ms 2276 KB Output is correct
23 Correct 60 ms 2276 KB Output is correct
24 Correct 55 ms 2276 KB Output is correct
25 Correct 49 ms 2276 KB Output is correct
26 Correct 59 ms 2276 KB Output is correct
27 Correct 55 ms 2276 KB Output is correct
28 Correct 63 ms 2276 KB Output is correct
29 Correct 66 ms 2276 KB Output is correct
30 Correct 40 ms 2276 KB Output is correct
31 Correct 2 ms 2276 KB Output is correct
32 Correct 2 ms 2276 KB Output is correct

Subtask #2
59.037623636 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2276 KB Output is correct
2 Correct 2 ms 2276 KB Output is correct
3 Correct 2 ms 2276 KB Output is correct
4 Correct 2 ms 2276 KB Output is correct
5 Correct 2 ms 2276 KB Output is correct
6 Correct 2 ms 2276 KB Output is correct
7 Correct 2 ms 2276 KB Output is correct
8 Correct 2 ms 2276 KB Output is correct
9 Correct 2 ms 2276 KB Output is correct
10 Correct 2 ms 2276 KB Output is correct
11 Correct 3 ms 2276 KB Output is correct
12 Correct 4 ms 2276 KB Output is correct
13 Correct 4 ms 2276 KB Output is correct
14 Correct 4 ms 2276 KB Output is correct
15 Correct 3 ms 2276 KB Output is correct
16 Correct 19 ms 2276 KB Output is correct
17 Correct 19 ms 2276 KB Output is correct
18 Correct 22 ms 2276 KB Output is correct
19 Correct 23 ms 2276 KB Output is correct
20 Partially correct 17 ms 2276 KB Partially correct
21 Correct 73 ms 2276 KB Output is correct
22 Correct 83 ms 2276 KB Output is correct
23 Correct 84 ms 2276 KB Output is correct
24 Correct 94 ms 2276 KB Output is correct
25 Correct 68 ms 2276 KB Output is correct
26 Correct 107 ms 2276 KB Output is correct
27 Correct 77 ms 2276 KB Output is correct
28 Correct 75 ms 2276 KB Output is correct
29 Correct 72 ms 2276 KB Output is correct
30 Partially correct 53 ms 2276 KB Partially correct
31 Correct 2 ms 2276 KB Output is correct
32 Correct 2 ms 2276 KB Output is correct