oj.uz

답안 #358301

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
358301 2021-01-25T09:56:35 Z Vladth11 구경하기 (JOI13_watching) C++14
0 / 100
 101 ms 15980 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define debug(x) cerr << #x << " " << x << "\n"
#define debug_with_space(x) cerr << #x << " " << x << " "

using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef pair <ll, ll> pii;
typedef pair <ll, pii> piii;
typedef tree <pii, null_type, less <pii>, rb_tree_tag, tree_order_statistics_node_update> OST;

const ll NMAX = 2001;
const ll INF = (1LL << 60);
const ll MOD = 1000000007;
const ll BLOCK = 101;
const ll nr_of_bits = 35;

int n, p, q, pp, qq;
int v[NMAX];
int dp[2001][2001];

bool OK(int w) {
    for(int i = 0; i < NMAX; i++) {
        for(int j = 0; j < NMAX; j++) {
            dp[i][j] = 0;
        }
    }
    for(int i = 0; i <= min(p, n); i++) {
        for(int j = 0; j <= min(q, n); j++) {
            if(i != 0) {
                dp[i][j] = max(dp[i][j], dp[i - 1][j]);
                int unde = dp[i - 1][j];
                unde++;
                int r = 0, pas = (1 << 11);
                while(pas) {
                    if(r + pas <= n && v[r + pas] < v[unde] + w) {
                        r += pas;
                    }
                    pas /= 2;
                }
                dp[i][j] = max(dp[i][j], dp[i - 1][j] + (r - unde + 1));
            }
            if(j != 0){
                int unde = dp[i][j - 1];
                dp[i][j] = max(dp[i][j], dp[i][j - 1]);
                unde++;
                int r = 0, pas = (1 << 11);
                while(pas) {
                    if(r + pas <= n && v[r + pas] < v[unde] + 2 * w) {
                        r += pas;
                    }
                    pas /= 2;
                }
                dp[i][j] = max(dp[i][j], dp[i][j - 1] + (r - unde + 1));
            }
        }
    }
    return (dp[min(p,n)][min(q,n)] >= n);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int i;
    cin >> n >> p >> q;
    pp = p;
    qq = q;
    v[0] = -2e9;
    for(i = 1; i <= n; i++) {
        cin >> v[i];
    }
    sort(v + 1, v + n + 1);
    int r = 0, pas = (1 << 20);
    while(pas) {
        if(!OK(r + pas))
            r += pas;
        pas /= 2;
    }
    cout << r + 1;
    return 0;
}

Subtask #1
0 / 50.0

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

Subtask #2
0 / 50.0

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