# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
416419 | DEQK | Watching (JOI13_watching) | C++17 | 363 ms | 4104 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 300312;
int n, p, q;
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >> p >> q;
vector<int> a(n);
for(int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if(p + q >= n) {
cout << 1;
return 0;
}
int l = 0, r = 1e9, re;
while(r >= l) {
int m = l + r >> 1;
int ok = 1;
vector<vector<int>> dp(p + 1, vector<int> (q + 1));
for(int i = 0; i <= p; i++) {
int x = 0;
for(int j = 0; j <= q; j++) {
while(x < n && a[x] <= dp[i][j]) x++;
if(i < p) {
dp[i + 1][j] = max(dp[i][j], dp[i + 1][j]);
if(x < int(a.size())) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |