제출 #707932

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
707932		Dan4Life	구경하기 (JOI13_watching)	C++17	100 / 100	366 ms	16112 KiB

watching

#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
//#define int long long
#define sz(a) (int)a.size()
const int mxN = (int)2e3+10;
const int LINF = (int)1e9;
int n, p, q;
vector<int> v;
int a[mxN], ip[mxN], iq[mxN], dp[mxN][mxN];

bool work(int w){
	v.clear(); v.pb(0);
	for(int i = 1, s=0; i <= n; i++){
		s+=a[i]-a[i-1]; v.pb(s);
		for(int j = 1; j < sz(v); j++){
			if(s-v[j]+1 <=w){ ip[i]=j-1; break;	}
		}
	}	
	v.clear(); v.pb(0);
	for(int i = 1, s=0; i <= n; i++){
		s+=a[i]-a[i-1]; v.pb(s);
		for(int j = 1; j < sz(v); j++){
			if(s-v[j]+1 <=2*w){ iq[i]=j-1; break;	}
		}
	}	
	ip[1]=iq[1]=0;
	for(int i = 0; i <= n; i++)
		for(int j = 0; j <= q; j++)
			dp[i][j]=LINF;
	dp[0][0]=0;
	for(int i = 1; i <= n; i++){
		for(int j = 0; j <= q; j++){
			dp[i][j] = min(dp[i][j], dp[ip[i]][j]+1);
			if(j) dp[i][j] = min(dp[i][j], dp[iq[i]][j-1]);
		}
	}
	for(int i = 0; i <= q; i++) 
		if(dp[n][i]<=p) return true;
	return false;
}

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 / 50
• Subtask 2: 50 / 50