Submission #1153809

#	Time	Username	Problem	Language	Result	Execution time	Memory
1153809		ezzzay	Watching (JOI13_watching)	C++20	0 / 100	1 ms	324 KiB

watching

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
vector<string>ans;
int n,p,q;
vector<int>a;
bool check(int mid){
	vector< vector<int>  > dp(p+2,vector<int>(q+2,-1));
	bool u=0;
	for(int i=p;i>=0;i--){
		for(int j=q;j>=0;j--){
			if(i==p and j==q)continue;
			int h=dp[i][j+1]+1;
			int x=a[h];
			while(h+1 <n and a[h+1 ]-x+1<= 2*mid){
				h++;
			}
			dp[i][j]=max(dp[i][j],h);
			h=dp[i+1][j]+1;
			x=a[h];
			while(h+1 <n and a[h+1 ]-x+1<=mid){
				h++;
			}
			dp[i][j]=max(dp[i][j],h);
			if(dp[i][j]==n-1)u=1;
		}
	}
	return u;
}
signed main(){
	cin>>n>>p>>q;
	p=min(p,n);
	q=min(q,n);
	a.resize(n);
	for(int i=0;i<n;i++){
		cin>>a[i];
	}
	sort(a.begin(),a.end());
	a.pb(0);
	int lo=0,hi=1e9;
	while(hi>=lo){
		int mid=(hi+lo)/2;
		
		if(check(mid))hi=mid-1;
		else lo=mid+1;
		
	}
	cout<<lo;
}

• Subtask 1: 0 / 50
• Subtask 2: 0 / 50