답안 #707948

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
707948	2023-03-10T14:58:13 Z	Dan4Life	구경하기 (JOI13_watching)	C++17	100 / 100	65 ms	8536 KB

watching

#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], v[mxN], dp[mxN][mxN];

bool work(int w){
	for(int i=1,j=1,k=1; i <= n; i++){
		while(j<=n and a[j]-a[i]<w)j++;
		while(k<=n and a[k]-a[i]<2*w)k++;
		P[i]=--j, Q[i]=--k;
	}
	for(int i = 0; i <= p; i++){
		for(int j = 0; j <= q; j++){
			dp[i][j]=0;
			if(i) dp[i][j] = max(dp[i][j], P[dp[i-1][j]+1]);
			if(j) dp[i][j] = max(dp[i][j], Q[dp[i][j-1]+1]);
			if(dp[i][j]>=n) return 1;
		}
	}
	return 0;
}

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;
}

Subtask #1

50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	340 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	328 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	324 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	328 KB	Output is correct
10	Correct	1 ms	340 KB	Output is correct
11	Correct	1 ms	468 KB	Output is correct
12	Correct	1 ms	468 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	1 ms	332 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct

Subtask #2

50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	340 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	336 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	2 ms	340 KB	Output is correct
8	Correct	10 ms	1236 KB	Output is correct
9	Correct	13 ms	3668 KB	Output is correct
10	Correct	18 ms	8536 KB	Output is correct
11	Correct	7 ms	980 KB	Output is correct
12	Correct	65 ms	7960 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	2 ms	340 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct