oj.uz

Submission #918839

# Submission time Handle Problem Language Result Execution time Memory
918839 2024-01-30T14:02:00 Z SalihSahin Watching (JOI13_watching) C++14
0 / 100
 1 ms 604 KB 
#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
using namespace std;
 
const int mod = 1e9 + 7;
const int inf = 1e9;
const int N = 2e3 + 5;

int32_t main(){
    cin.tie(0); cout.tie(0);
    ios_base::sync_with_stdio(false);
    int n, p, q;
    cin>>n>>p>>q;

    p = min(p, n);
    q = min(q, n);
    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<<endl;
        return 0;
    }

    int l = 1, r = inf + 5;
    while(l < r){
        int m = (l + r)/2;
        vector<vector<int> > dp(p+1, vector<int>(q+1, 0));
        dp[p][q] = 0;

        vector<int> sm(n+1), bg(n+1);
        int x = 0;
        for(int i = 0; i < n; i++){
            while(x < n && a[x] - a[i] + 1 <= m) x++;
            sm[i] = x;
        }
        sm[n] = n;
        x = 0;

        for(int i = 0; i < n; i++){
            while(x < n && a[x] - a[i] + 1 <= m * 2) x++;
            bg[i] = x;
        }
        bg[n] = n;

        for(int s = p + q - 1; s >= 0; s--){
            for(int small = min(s, p); small >= 0; small--){
                int big = s - small;

                if(small < p) dp[small][big] = max(dp[small][big], sm[dp[small+1][big]]);
                if(big < q) dp[small][big] = max(dp[small][big], bg[dp[small][big+1]]);
            }
        }

        if(dp[0][0] == n) r = m;
        else l = m + 1;
    }

    cout<<l<<endl;
    return 0;
}

Subtask #1
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Runtime error 1 ms 344 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #2
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 1 ms 344 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Runtime error 1 ms 604 KB Execution killed with signal 6
8 Halted 0 ms 0 KB -