oj.uz

Submission #651638

# Submission time Handle Problem Language Result Execution time Memory
651638 2022-10-19T13:35:54 Z Koful123 Watching (JOI13_watching) C++17
50 / 100
 1000 ms 30348 KB 
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#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()

int n;
vector<int> v;
vector<vector<int>> dp;

int f(int pos,int q,int w){
	if(q < 0) return 1e18;
	if(pos >= n) return 0;
	if(dp[pos][q] != 1e18) return dp[pos][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][q] = min(f(a,q,w) + 1,f(b,q-1,w));
	return dp[pos][q];
}

void solve(){

	int p,q;
	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;
	}

	auto check = [&](int m){
		dp.assign(n,vector<int>(q+1,1e18));
		return f(0,q,m) <= p;
	};

	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 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 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 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 3 ms 340 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct

Subtask #2
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 224 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 3 ms 596 KB Output is correct
8 Correct 697 ms 12408 KB Output is correct
9 Correct 210 ms 2444 KB Output is correct
10 Correct 223 ms 1960 KB Output is correct
11 Execution timed out 1094 ms 30348 KB Time limit exceeded
12 Halted 0 ms 0 KB -