oj.uz

답안 #1097097

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1097097 2024-10-06T04:04:10 Z TrinhKhanhDung 구경하기 (JOI13_watching) C++14
100 / 100
 179 ms 16216 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18 + 10
#define INF (ll)1e9
#define MOD (ll)(998244353)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 2e3 + 10;

int N, P, Q;
int a[MAX], dp[MAX][MAX], small[MAX], large[MAX];

void solve(){
    cin >> N >> P >> Q;
    for(int i = 1; i <= N; i++) cin >> a[i];
    sort(a + 1, a + N + 1);

    minimize(P, N);
    minimize(Q, N);

    auto OK = [&](int range) -> bool{
        int j = N, k = N;
        for(int i = N; i >= 1; i--){
            while(a[j] - a[i] + 1 > range) j--;
            while(a[k] - a[i] + 1 > 2 * range) k--;
            small[i] = j;
            large[i] = k;
        }
        small[N + 1] = large[N + 1] = N;
        for(int i = 0; i <= P; i++){
            memset(dp[i], 0, (Q + 3) * sizeof(int));
        }
        for(int i = 0; i <= P; i++) for(int j = 0; j <= Q; j++){
            if(i < P){
                maximize(dp[i + 1][j], small[dp[i][j] + 1]);
            }
            if(j < Q){
                maximize(dp[i][j + 1], large[dp[i][j] + 1]);
            }
        }
        return dp[P][Q] >= N;
    };

    int l = 1, r = (int)1e9;
    while(l < r){
        int m = (l + r) >> 1;
        if(OK(m)) r = m;
        else l = m + 1;
    }

    cout << r << "\n";
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//    freopen("task.inp","r",stdin);
//    freopen("task.out","w",stdout);

    int T = 1;
//    cin >> T;
    for(; T; T--) solve();

    return 0;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 352 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 856 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 860 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct

Subtask #2
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 105 ms 12124 KB Output is correct
4 Correct 12 ms 9148 KB Output is correct
5 Correct 8 ms 1128 KB Output is correct
6 Correct 179 ms 16216 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 6 ms 1372 KB Output is correct
9 Correct 7 ms 3820 KB Output is correct
10 Correct 13 ms 8792 KB Output is correct
11 Correct 9 ms 1116 KB Output is correct
12 Correct 48 ms 8196 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct