oj.uz

답안 #651634

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

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")

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

bool f(int pos,int p,int q){
	if(p < 0 || q < 0) return false;
	if(pos >= n) return true;
	if(ok[pos][p][q]) return dp[pos][p][q];
	dp[pos][p][q] = (f(a[pos],p-1,q) || f(b[pos],p,q-1)); ok[pos][p][q] = true;
	return dp[pos][p][q];
}

bool check(int m){
	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)));
	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,p,q);
}

void solve(){

	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;
	}

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

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 1064 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 101 ms 4676 KB Output is correct
8 Execution timed out 1086 ms 74848 KB Time limit exceeded
9 Halted 0 ms 0 KB -