oj.uz

답안 #651642

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
651642 2022-10-19T13:39:34 Z Koful123 구경하기 (JOI13_watching) C++17
100 / 100
 429 ms 15468 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()

int n;
vector<int> v,a,b;
vector<vector<int>> dp;

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

void solve(){

	int p,q;
	cin >> n >> p >> q;

	v.assign(n,0),a.assign(n,0),b.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,2037));
		for(int i=0;i<n;i++){
			a[i] = lower_bound(all(v), v[i] + m) - v.begin();
			b[i] = lower_bound(all(v), v[i] + 2*m) - v.begin();
		}
		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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 212 KB Output is correct
6 Correct 0 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 0 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct

Subtask #2
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 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 4 ms 468 KB Output is correct
8 Correct 141 ms 6356 KB Output is correct
9 Correct 45 ms 1432 KB Output is correct
10 Correct 40 ms 1172 KB Output is correct
11 Correct 429 ms 15468 KB Output is correct
12 Correct 334 ms 8176 KB Output is correct
13 Correct 6 ms 588 KB Output is correct
14 Correct 6 ms 468 KB Output is correct
15 Correct 7 ms 460 KB Output is correct