oj.uz

답안 #1001718

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1001718 2024-06-19T07:13:46 Z vjudge1 구경하기 (JOI13_watching) C++17
0 / 100
 57 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 1000000000
int n, p, q;
vector<int> a;
int main(){
    cin>>n>>p>>q;
    a.assign(n + 1, 0);
    for (int i = 1; i <= n; i++){
        cin>>a[i];
    }
    sort(a.begin(), a.end());
    if (n <= p + 1){
        cout<<1;
        return 0;
    }
    ll dp[n + 1][q + 1][p + 1];
    for (int i = 0; i <= n; i++){
        for (int j = 0; j <= p; j++){
            for (int k = 0; k <= q; k++){
                dp[i][j][k] = 0;
            }
        }
    }
    for (int i = 1; i <= n; i++){
        for (int j = 0; j <= p; j++){
            for (int k = 0; k <= q; k++){
                dp[i][j][k] = INF;
                for (int l = 0; l <= i; l++){
                    if (l == i){
                        for (int m = 0; m <= l; m++){
                            if (j != 0){
                                dp[i][j][k] = min(dp[i][j][k], max(1ll, dp[i][j - 1][k]));
                            }
                            if (k != 0){
                                dp[i][j][k] = min(dp[i][j][k], max(1ll, dp[i][j][k - 1]));
                            }
                        }
                    }
                    ll dist = ceil((double)(a[i] - a[l] + 1) / (double)2);
                    ll bi = ceil((double)dist / (double)2);
                    if (j != 0){
                        dp[i][j][k] = min(max(dp[l][j - 1][k], dist), dp[i][j][k]);
                    }
                    if (k != 0){
                        dp[i][j][k] = min(max(dp[l][j][k - 1], bi), dp[i][j][k]);
                    }
                }
            }
        }
    }
    cout<<dp[n][p][q];
}

Subtask #1
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 57 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -