oj.uz

답안 #24841

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
24841 2017-06-15T08:03:09 Z nibnalin 구경하기 (JOI13_watching) C++14
0 / 100
 66 ms 262144 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int maxn = int(1e3)+5, inf = int(1e9)+5;

int n, p, q, A[maxn], nex[maxn][2], memo[maxn][maxn];

int DP(int idx, int p)
{
	if(idx == n) return 0;
	else if(memo[idx][p] != -1) return memo[idx][p];
	else
	{
		int res = inf;
		if(p) res = min(res, DP(nex[idx][0], p-1));
		res = min(res, DP(nex[idx][1], p)+1);
		return memo[idx][p] = res;
	}
}

bool f(int w)
{
	for(int i = 0;i < n;i++)
	{
		nex[i][0] = int(lower_bound(A, A+n, A[i]+w)-A);
		nex[i][1] = int(lower_bound(A, A+n, A[i]+min(inf, 2*w))-A);
		for(int j = 0;j <= p;j++) memo[i][j] = -1;
	}

	return (DP(0, p) <= q);
}

int main(void)
{
	scanf("%d%d%d", &n, &p, &q);
	p = min(p, n), q = min(q, n);
	for(int i = 0;i < n;i++) scanf("%d", &A[i]);
	sort(A, A+n);

	int L = 0, R = inf, ans = inf+5;
	while(L <= R)
	{
		int mid = (L+R)/2;
		if(f(mid))
		{
			ans = min(ans, mid);
			R = mid-1;
		}
		else L = mid+1;
	}
	printf("%d\n", ans);
}

Compilation message

watching.cpp: In function 'int main()':
watching.cpp:38:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d", &n, &p, &q);
                             ^
watching.cpp:40:45: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(int i = 0;i < n;i++) scanf("%d", &A[i]);
                                             ^

Subtask #1
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5976 KB Output is correct
2 Memory limit exceeded 23 ms 262144 KB Memory limit exceeded
3 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 66 ms 5976 KB Execution timed out (wall clock limit exceeded)
2 Halted 0 ms 0 KB -