답안 #707950

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
707950 2023-03-10T15:00:03 Z Dan4Life 구경하기 (JOI13_watching) C++17
100 / 100
255 ms 16064 KB
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
const int mxN = (int)2e3+10;
const int LINF = (int)1e9;
int n, p, q;
int a[mxN], P[mxN], Q[mxN], dp[mxN][mxN];
 
bool work(int w){
	for(int i=2,j=1,k=1; i <= n; i++){
		while(a[i]-a[j]+1>w) j++;
		while(a[i]-a[k]+1>2*w) k++;
		P[i]=j-1,Q[i]=k-1;
	}
	for(int i = 1; i <= n; i++){
		for(int j = 0; j <= q; j++){
			dp[i][j] = min(LINF, dp[P[i]][j]+1);
			if(j) dp[i][j] = min(dp[i][j], dp[Q[i]][j-1]);
		}
	}
	return dp[n][q]<=p;
}
 
int32_t main() {
	ios_base::sync_with_stdio(false); cin.tie(0);
	cin >> n >> p >> q;
	for(int i = 1; i <= n; i++) cin >> a[i];
	sort(a+1,a+n+1);
	if(p+q>=n){cout<<1;return 0;}
	int l = 1, r = (int)1e9;
	while(l<r){
		int mid = (l+r)/2;
		if(work(mid)) r=mid;
		else l=mid+1;
	}
	cout << l;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 724 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 724 KB Output is correct
8 Correct 1 ms 724 KB Output is correct
9 Correct 1 ms 724 KB Output is correct
10 Correct 1 ms 724 KB Output is correct
11 Correct 1 ms 724 KB Output is correct
12 Correct 1 ms 724 KB Output is correct
13 Correct 1 ms 724 KB Output is correct
14 Correct 0 ms 724 KB Output is correct
15 Correct 1 ms 724 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 8276 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 6 ms 8404 KB Output is correct
8 Correct 111 ms 14240 KB Output is correct
9 Correct 22 ms 9300 KB Output is correct
10 Correct 20 ms 8984 KB Output is correct
11 Correct 255 ms 16064 KB Output is correct
12 Correct 138 ms 16020 KB Output is correct
13 Correct 6 ms 8404 KB Output is correct
14 Correct 7 ms 8404 KB Output is correct
15 Correct 7 ms 8404 KB Output is correct