oj.uz

답안 #705546

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
705546 2023-03-04T15:33:34 Z dooompy Sparklers (JOI17_sparklers) C++17
100 / 100
 570 ms 7032 KB 
#include "bits/stdc++.h"

using namespace std;

void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.first >> a.second;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.first << ", " << a.second << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    bool is = false;
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}

#ifdef local
#define test(args...) abc("[" + string(#args) + "]", args)
#else
#define test(args...) void(0)
#endif

using ll = long long;

#define int ll

int a[100005];

struct node {
    ll mn, mx;
};

node tree[4 * 100005];
int ans = 2e9;

void comb(int x) {
    tree[x].mn = min(tree[2 * x].mn, tree[2 * x + 1].mn);
    tree[x].mx = max(tree[2 * x].mx, tree[2 * x + 1].mx);
}

void sett(int x, int l, int r, int p, ll v) {
    if (l == r) {
        tree[x].mn = tree[x].mx = v;
        return;
    }

    int mid = (l + r) / 2;

    if (p <= mid) sett(2 * x, l, mid, p, v);
    else sett(2 * x + 1, mid + 1, r, p, v);

    comb(x);
}

int n, k, t;
int x[100005];

int bigger(int x, int l, int r, int ql, int qr, int v) {
    if (ql <= l && r <= qr) {
        if (tree[x].mx >= v) {
            if (l == r) return l;
            int mid = (l + r) / 2;
            if (tree[2 * x].mx >= v) return bigger(2 * x, l, mid, ql, qr, v);
            else return bigger(2 * x + 1, mid + 1, r, ql, qr, v);
        } else {
            return -1;
        }
    }

    if (ql > r || l > qr) return -1;

    int mid = (l + r) / 2;
    int res = bigger(2 * x, l, mid, ql, qr, v);
    if (res == -1) res = bigger(2 * x + 1, mid + 1, r, ql, qr, v);
    return res;
}

int smaller(int x, int l, int r, int ql, int qr, int v) {
    if (ql <= l && r <= qr) {
        if (tree[x].mn <= v) {
            if (l == r) return l;
            int mid = (l + r) / 2;
            if (tree[2 * x + 1].mn <= v) return smaller(2 * x + 1, mid + 1, r, ql, qr, v);
            else return smaller(2 * x, l, mid, ql, qr, v);
        } else {
            return -1;
        }
    }

    if (ql > r || l > qr) return -1;

    int mid = (l + r) / 2;
    int res = smaller(2 * x + 1, mid + 1, r, ql, qr, v);
    if (res == -1) return smaller(2 * x, l, mid, ql, qr, v);
    return res;
}

bool check(int s) {
    int dist = s * t * 2; // in one sec

    for (int i = 1; i <= n; i++) {
        x[i] = a[i] - dist * i;
        sett(1, 1, n + 1, i, x[i]);
    }

    int tochange = bigger(1, 1, n + 1, k, n + 1, x[k] + 1) - 1;

    for (int i = k - 1; i >= 1; i--) {
        if (x[i + 1] <= x[i]) {
            // dont need help

            tochange = bigger(1, 1, n + 1, tochange, n + 1, x[i] + 1) - 1;
        } else {
            tochange = smaller(1, 1, n + 1, k, tochange, x[i]);
            if (tochange == -1) return false;
        }
    }

    return (tochange == n);
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
//    freopen("", "r", stdin);
//    freopen("", "w", stdout);
    cin >> n >> k >> t;
    for (int i = 1; i <= n; i++) cin >> a[i];
    a[n + 1] = a[n];
    sett(1, 1, n + 1, n + 1, 1e18);

    int lo = 0, hi = 1e10;

    while (lo <= hi) {
        int mid = (lo + hi) / 2;
        if (check(mid)) {
            ans = min(ans, mid);
            hi = mid - 1;
        } else lo = mid + 1;
    }

    cout << ans;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 0 ms 340 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 3 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 3 ms 340 KB Output is correct
31 Correct 3 ms 340 KB Output is correct
32 Correct 3 ms 400 KB Output is correct
33 Correct 3 ms 340 KB Output is correct
34 Correct 5 ms 340 KB Output is correct
35 Correct 4 ms 340 KB Output is correct
36 Correct 3 ms 340 KB Output is correct
37 Correct 3 ms 340 KB Output is correct
38 Correct 3 ms 336 KB Output is correct
39 Correct 4 ms 340 KB Output is correct
40 Correct 3 ms 340 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 1 ms 328 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 2 ms 340 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 2 ms 340 KB Output is correct
25 Correct 3 ms 340 KB Output is correct
26 Correct 3 ms 340 KB Output is correct
27 Correct 3 ms 340 KB Output is correct
28 Correct 3 ms 340 KB Output is correct
29 Correct 4 ms 340 KB Output is correct
30 Correct 3 ms 340 KB Output is correct
31 Correct 3 ms 340 KB Output is correct
32 Correct 3 ms 400 KB Output is correct
33 Correct 3 ms 340 KB Output is correct
34 Correct 5 ms 340 KB Output is correct
35 Correct 4 ms 340 KB Output is correct
36 Correct 3 ms 340 KB Output is correct
37 Correct 3 ms 340 KB Output is correct
38 Correct 3 ms 336 KB Output is correct
39 Correct 4 ms 340 KB Output is correct
40 Correct 3 ms 340 KB Output is correct
41 Correct 353 ms 4080 KB Output is correct
42 Correct 7 ms 468 KB Output is correct
43 Correct 82 ms 1820 KB Output is correct
44 Correct 354 ms 6944 KB Output is correct
45 Correct 458 ms 6964 KB Output is correct
46 Correct 439 ms 6944 KB Output is correct
47 Correct 393 ms 6872 KB Output is correct
48 Correct 426 ms 6936 KB Output is correct
49 Correct 330 ms 6944 KB Output is correct
50 Correct 448 ms 6940 KB Output is correct
51 Correct 386 ms 6952 KB Output is correct
52 Correct 491 ms 6956 KB Output is correct
53 Correct 345 ms 6944 KB Output is correct
54 Correct 505 ms 6940 KB Output is correct
55 Correct 475 ms 6940 KB Output is correct
56 Correct 370 ms 6940 KB Output is correct
57 Correct 531 ms 6888 KB Output is correct
58 Correct 430 ms 6940 KB Output is correct
59 Correct 499 ms 6220 KB Output is correct
60 Correct 562 ms 6936 KB Output is correct
61 Correct 492 ms 6860 KB Output is correct
62 Correct 381 ms 7020 KB Output is correct
63 Correct 496 ms 6908 KB Output is correct
64 Correct 494 ms 7032 KB Output is correct
65 Correct 429 ms 6944 KB Output is correct
66 Correct 474 ms 6920 KB Output is correct
67 Correct 410 ms 6936 KB Output is correct
68 Correct 570 ms 6868 KB Output is correct
69 Correct 537 ms 6924 KB Output is correct