제출 #828982

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
828982		OAleksa	구경하기 (JOI13_watching)	C++14	100 / 100	833 ms	31836 KiB

watching

#include <bits/stdc++.h>
#define f first
#define s second
using namespace std; 
#define int long long
const int maxn = 2010;
int dp[maxn][maxn];
signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int tt = 1;
	//cin >> tt;
	while(tt--) {
		int n, p, q;
		cin >> n >> p >> q;
		int a[n + 1];
		for(int i = 1;i <= n;i++)
			cin >> a[i];
		sort(a + 1, a + n + 1);
		p = min(p, n);
		q = min(q, n);
		auto idiUkurac = [&](int x, int z) {
			int l = x, r = n, res = x;
			while(l <= r) {
				int mid = (l + r) / 2;
				if(a[mid] - a[x] + 1 <= z)	{
					res = mid;
					l = mid + 1;
				}
				else
					r = mid - 1;
			}
			return res;
		};
		
		auto check = [&](int x) {
			for(int i = 0;i <= p;i++)
				for(int j = 0;j <= q;j++)
					dp[i][j] = 0;
			for(int i = 0;i <= p;i++) {
				for(int j = 0;j <= q;j++) {
					dp[i + 1][j] = max(dp[i + 1][j], idiUkurac(dp[i][j] + 1, x));
					dp[i][j + 1] = max(dp[i][j + 1], idiUkurac(dp[i][j] + 1, 2 * x));
				}
			}
			return dp[p][q] >= n;
		};
		int l = 1, r = 1e9, ans = -1;
		while(l <= r) {
			int mid = (l + r) / 2;
			if(check(mid)) {
				ans = mid;
				r = mid - 1;
			}
			else
				l = mid + 1;
		}
		//TEBI U KRILU KURVA A MENI MALO PRASE????
		cout << ans << "\n";
	}
   return 0;
}

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