oj.uz

Submission #651619

# Submission time Handle Problem Language Result Execution time Memory
651619 2022-10-19T13:09:38 Z Koful123 Watching (JOI13_watching) C++17
50 / 100
 1000 ms 74704 KB 
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define pb push_back
#define ff first
#define ss second
#define mod 1000000007
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

#define int long long

int n,p,q;
vector<int> v;
vector<vector<vector<bool>>> dp,ok;

bool f(int pos,int p,int q,int w){
	if(p < 0 || q < 0) return false;
	if(pos >= n) return true;
	if(ok[pos][p][q]) return dp[pos][p][q];
	int a = lower_bound(all(v),v[pos] + w) - v.begin();
	int b = lower_bound(all(v),v[pos] + 2*w) - v.begin();
	dp[pos][p][q] = (f(a,p-1,q,w) || f(b,p,q-1,w)); ok[pos][p][q] = true;
	return dp[pos][p][q];
}

bool check(int m){
	for(int i=0;i<n;i++){
		for(int j=0;j<=p;j++){
			for(int k=0;k<=q;k++){
				dp[i][j][k] = ok[i][j][k] = false;
			}
		}
	}
	return f(0,p,q,m);
}

void solve(){

	cin >> n >> p >> q;
	v.assign(n,0);
	for(int i=0;i<n;i++){
		cin >> v[i];
	}

	if(p + q >= n){
		cout << 1 << endl;
		return;
	}

	dp.assign(n,vector<vector<bool>>(p+1,vector<bool>(q+1,false)));
	ok.assign(n,vector<vector<bool>>(p+1,vector<bool>(q+1,false)));

	sort(all(v));
	int l = 1,r = 1e9;
	while(l < r){
		int m = (l + r) / 2;
		if(check(m)) r = m;
		else l = m + 1;
	}

	cout << l << endl;
}	

signed main(){

	ios::sync_with_stdio(0);
	cin.tie(0);

	int t = 1;
//	cin >> t;

	while(t--)
		solve();

	return 0;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 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 1 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 2 ms 468 KB Output is correct
10 Correct 13 ms 468 KB Output is correct
11 Correct 16 ms 1184 KB Output is correct
12 Correct 30 ms 980 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 980 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 40 ms 4564 KB Output is correct
8 Execution timed out 1094 ms 74704 KB Time limit exceeded
9 Halted 0 ms 0 KB -