oj.uz

답안 #384234

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
384234 2021-03-31T20:32:12 Z wind_reaper 구경하기 (JOI13_watching) C++17
50 / 100
 503 ms 80600 KB 
#include <bits/stdc++.h>

using namespace std;
	
const int MXN = 101;
const int MXP = 100001;
int dp[MXN][MXP], a[MXN];

int n, p, q;

bool check(int w){
	memset(dp, 0, sizeof dp);

	for(int i = 1; i <= n; i++){
		int l = 1, r = 1;
		while(a[i] - a[l] >= w) l++;
		while(a[i] - a[r] >= 2*w) r++;

		for(int j = 0; j <= p; j++)
			if(j == 0) dp[i][j] = dp[r-1][j] + 1;
			else dp[i][j] = min(dp[l-1][j-1], dp[r-1][j] + 1);
	}

	return dp[n][p] <= q;
}

int32_t main(){
	ios_base::sync_with_stdio(false); 
	cin.tie(NULL); 
	
	cin >> n >> p >> q;
	for(int i = 1; i <= n; i++)
		cin >> a[i];

	sort(a+1, a+n+1);

	int lo = 1, hi = 1000000001;
	while(lo < hi){
		int mid = (lo + hi) >> 1;
		if(check(mid))
			hi = mid;
		else lo = mid + 1;
	}

	cout << lo << '\n';
	return 0; 
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 164 ms 39928 KB Output is correct
2 Correct 164 ms 39916 KB Output is correct
3 Correct 164 ms 39808 KB Output is correct
4 Correct 503 ms 39936 KB Output is correct
5 Correct 165 ms 40044 KB Output is correct
6 Correct 495 ms 40044 KB Output is correct
7 Correct 165 ms 40044 KB Output is correct
8 Correct 168 ms 40044 KB Output is correct
9 Correct 173 ms 39916 KB Output is correct
10 Correct 168 ms 39928 KB Output is correct
11 Correct 165 ms 39916 KB Output is correct
12 Correct 163 ms 39916 KB Output is correct
13 Correct 159 ms 40044 KB Output is correct
14 Correct 165 ms 39916 KB Output is correct
15 Correct 164 ms 40064 KB Output is correct

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 73 ms 80600 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -