oj.uz

답안 #321029

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
321029 2020-11-10T16:59:30 Z w4123 구경하기 (JOI13_watching) C++17
50 / 100
 729 ms 262148 KB 
#include <algorithm>
#include <iostream>
using namespace std;
int arr[2005];
int n, p, q;
 
int dp[2005][100005];
bool check(int mid)
{
	for (int i = 1; i <= n; i++)
	{
		for (int j = 0; j <= p; j++)
		{
			dp[i][j] = 1000000000;
		}
	}
	
	for (int i = 1; i <= n; i++)
	{
		int j1 = i - 1;
		while (j1 >= 1 && arr[i] - arr[j1] + 1 <= mid) j1--;
		int j2 = j1;
		while (j2 >= 1 && arr[i] - arr[j2] + 1 <= 2 * mid)j2--;
		// cout << j1 << " " << j2 << endl;
		for (int c = 0; c <= p; c++)
		{
			if (c > 0)dp[i][c] = min(dp[i][c], dp[j1][c - 1]);
			dp[i][c] = min(dp[i][c], dp[j2][c] + 1);
		}
	}
	return dp[n][p] <= q; 
}
 
int main()
{
 
	cin >> n >> p >> q;
	for (int i = 1; i <= n; i++)
	{
		cin >> arr[i];
	}
	sort(arr + 1, arr + n + 1);
 
	int l = 1, r = 1000000000;
	while(l < r)
	{
		int mid = l + (r - l) / 2;
		if (check(mid))
		{
			r = mid;
		}
		else
		{
			l = mid + 1;
		}
		//cout << l << " " << r << endl;
	}
	cout << r;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 692 ms 39652 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 729 ms 39532 KB Output is correct
7 Correct 1 ms 748 KB Output is correct
8 Correct 1 ms 876 KB Output is correct
9 Correct 1 ms 876 KB Output is correct
10 Correct 1 ms 748 KB Output is correct
11 Correct 1 ms 876 KB Output is correct
12 Correct 1 ms 876 KB Output is correct
13 Correct 1 ms 748 KB Output is correct
14 Correct 1 ms 748 KB Output is correct
15 Correct 1 ms 876 KB Output is correct

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 9836 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 262 ms 21624 KB Output is correct
4 Runtime error 166 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -