oj.uz

답안 #1101615

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1101615 2024-10-16T11:47:11 Z stdfloat 구경하기 (JOI13_watching) C++17
50 / 100
 1000 ms 19028 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define ff	first
#define ss	second
#define pii	pair<int, int>

#define sz(v)	(int)(v).size()
#define all(v)	(v).begin(), (v).end()

int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);

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

	p = min(n, p); q = min(n, q);

	vector<int> a(n + 1, INT_MIN);
	for (int i = 1; i <= n; i++)
		cin >> a[i];

	sort(1 + all(a));

	int l = 0, r = (int)1e9;
	while (l <= r) {
		int md = (l + r) >> 1;

		vector<pii> dp[n + 1];
		dp[0] = {{0, 0}};
		for (int i = 1; i <= n; i++) {
			vector<pii> v;
			for (auto j : dp[upper_bound(all(a), a[i] - md) - a.begin() - 1])
				if (j.ff < p) v.push_back({j.ff + 1, j.ss});
			for (auto j : dp[upper_bound(all(a), a[i] - (md << 1)) - a.begin() - 1])
				if (j.ss < q) v.push_back({j.ff, j.ss + 1});

			if (v.empty()) continue;

			sort(v.begin(), v.end());
			for (int j = 0; j < sz(v); j++)
				if (!j || dp[i].back().ss > v[j].ss) dp[i].push_back(v[j]);
		}

		if (dp[n].empty()) l = md + 1;
		else r = md - 1;
	}

	cout << l;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 2 ms 508 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 5 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 2 ms 336 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Correct 4 ms 504 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 508 KB Output is correct
15 Correct 1 ms 336 KB Output is correct

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Execution timed out 1028 ms 19028 KB Time limit exceeded
4 Halted 0 ms 0 KB -