oj.uz

답안 #1001674

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1001674 2024-06-19T06:55:22 Z coolboy19521 구경하기 (JOI13_watching) C++17
0 / 100
 7 ms 604 KB 
#pragma GCC optimize("Ofast")
#include"bits/stdc++.h"

#define int long long

using namespace std;

const int sz = 2e3 + 6;
const int inf = 1e18;

int a[sz];
int n, p, q;
bool f;

void dfs(int v, vector<vector<int>> aj[], int cl, int cr) {
    if (cl > p || cr > q) return;
    if (v == n + 1) {
        f |= (cl <= p && cr <= q);
    } else {
        for (auto& u : aj[v]) {
            if (f) return;
            dfs(u[0], aj, cl + u[1], cr + u[2]);
        }
    }
}

bool che(int mi) {
    vector<vector<int>> aj[sz];
    for (int i = 1; i <= n; i ++) {
        int d = lower_bound(a + 1, a + n + 1, a[i] + mi) - &a[i];
        int c = lower_bound(a + 1, a + n + 1, a[i] + 2 * mi) - &a[i];
        aj[i].push_back({i + d, 1, 0});
        aj[i].push_back({i + c, 0, 1});
    }
    f = false;
    dfs(1, aj, 0, 0);
    return f;
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    cin >> n >> p >> q;

    for (int i = 1; i <= n; i ++) {
        cin >> a[i];
    }

    sort(a + 1, a + n + 1);
    a[n + 1] = inf;

    int mn = inf;

    for (int i = 2; i <= n; i ++) {
        mn = min(mn, a[i] - a[i - 1]);
    }

    int le, ri;
    le = max(0ll, mn / (p + q) - 3), ri = (a[n] - a[1]) / (p + q) + 10;

    while (1 < ri - le) {
        int mi = le + (ri - le) / 2;

        if (che(mi)) {
            ri = mi;
        } else {
            le = mi;
        }
    }

    cout << ri << '\n';
}

Subtask #1
0 / 50.0

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

Subtask #2
0 / 50.0

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