oj.uz

Submission #924111

# Submission time Handle Problem Language Result Execution time Memory
924111 2024-02-08T13:18:46 Z mariaclara Watching (JOI13_watching) C++17
100 / 100
 326 ms 16184 KB 
#include<bits/stdc++.h>
#pragma GCC optimize ("O3")

using namespace std;

typedef long long ll;
typedef tuple<int,int,int> trio;
typedef pair<int,int> pii;
const int MAXN = 2e5+5;
const int MOD = 1e9+7;
#define all(x) x.begin(), x.end()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second

int n, p, q, v[2005], jump1[2005], jump2[2005], dp[2005][2005];

bool ok(int w) {
    for(int i = 1, j = 1, k = 1; i <= n; i++) {
        while(j <= n and v[j] - v[i] < w) j++;
        jump1[i] = j;

        while(k <= n and v[k] - v[i] < 2*w) k++;
        jump2[i] = k;
    }
    jump1[n+1] = jump2[n+1] = n+1;

    dp[0][0] = 1;
    for(int i = 1; i <= p; i++) dp[i][0] = jump1[dp[i-1][0]];
    for(int i = 1; i <= q; i++) dp[0][i] = jump2[dp[0][i-1]];

    for(int i = 1; i <= p; i++)
        for(int j = 1; j <= q; j++)
            dp[i][j] = max(jump1[dp[i-1][j]], jump2[dp[i][j-1]]);

    return dp[p][q] == n+1;
}

int busca() {
    int l = 1, r = 1e9;
    while(l <= r) {
        int meio = (l+r)/2;
        if(ok(meio)) r = meio-1;
        else l = meio+1;
    }
    return r+1;
}
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

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

    for(int i = 1; i <= n; i++)
        cin >> v[i];

    sort(v+1, v+1+n);

    cout << busca() << "\n";
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 500 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #2
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 185 ms 12952 KB Output is correct
4 Correct 14 ms 15572 KB Output is correct
5 Correct 14 ms 2652 KB Output is correct
6 Correct 326 ms 16184 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 9 ms 2716 KB Output is correct
9 Correct 9 ms 6748 KB Output is correct
10 Correct 16 ms 14940 KB Output is correct
11 Correct 15 ms 2904 KB Output is correct
12 Correct 83 ms 8864 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct