oj.uz

Submission #1052841

# Submission time Handle Problem Language Result Execution time Memory
1052841 2024-08-11T04:32:58 Z amongus_pvp Distributing Candies (IOI21_candies) C++17
100 / 100
 729 ms 76624 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1000000 + 10;
const int MAXQ = 1000000 + 10;
const long long INF = (long long)(1e18);

struct SegmentTree {
    int n;
    long long vmin[(MAXN + MAXQ) * 4], vmax[(MAXN + MAXQ) * 4], lazy[(MAXN + MAXQ) * 4];

    void init(int _n) {
        n = _n;
        for(int i = 0; i <= 4 * n; ++i) vmin[i] = vmax[i] = lazy[i] = 0;
    }

    void lazy_update(int node, int from, int to) {
        vmin[node] += lazy[node]; vmax[node] += lazy[node];
        if (from < to) {
            lazy[node * 2] += lazy[node];
            lazy[node * 2 + 1] += lazy[node];
        }
        lazy[node] = 0;
    }

    void update(int node, int from, int to, int L, int R, int add) {
        lazy_update(node, from, to);
        if (from > R || to < L) return;
        if (L <= from && to <= R) {
            lazy[node] += add;
            lazy_update(node, from, to);
            return;
        }
        int mid = (from + to) / 2;
        update(node * 2, from, mid, L, R, add);
        update(node * 2 + 1, mid + 1, to, L, R, add);
        vmin[node] = min(vmin[node * 2], vmin[node * 2 + 1]);
        vmax[node] = max(vmax[node * 2], vmax[node * 2 + 1]);
    }

    long long get(int node, int from, int to, int lowerbound) {
        lazy_update(node, from, to);
        if (from == to) return vmin[node];
        int mid = (from + to) / 2;
        if (vmax[node * 2 + 1] + lazy[node * 2 + 1] >= lowerbound)
            return get(node * 2 + 1, mid + 1, to, lowerbound);
        return min( vmin[node * 2 + 1] + lazy[node * 2 + 1], get(node * 2, from, mid, lowerbound) );
    }

    void add_range(int L, int R, int add) {
        update(1, 0, n - 1, L, R, add);
    }

    long long min_suffix(int lowerbound) {
        if (vmax[1] < lowerbound) return -INF;
        return min(0LL, get(1, 0, n - 1, lowerbound));
    }
} T;

vector<int> distribute_candies(vector<int> C, vector<int> L, vector<int> R, vector<int> V) {
    int n = C.size();
    vector<int> A(n);
    int q = L.size();
    vector< vector<int> > begin_at(n, vector<int>()), end_at(n, vector<int>());
    for(int i = 0; i < q; ++i) {
        begin_at[L[i]].push_back(i);
        end_at[R[i]].push_back(i);
    }

    T.init(n + q);
    vector<int> final_A(n);
    for(int i = 0; i < n; ++i) {
        if (i > 0) {
            T.add_range(0, i - 1, -A[i - 1]);
            for(int j : end_at[i - 1]) T.add_range(0, n + j, -V[j]);
        }
        T.add_range(0, i, A[i]);
        for(int j : begin_at[i]) T.add_range(0, n + j, V[j]);

        int low = 1, high = C[i] + 1;
        while (low <= high) {
            int mid = (low + high) / 2;
            long long smin = T.min_suffix(mid);
            if (-smin + mid > C[i]) high = mid - 1;
            else low = mid + 1;
        }
        final_A[i] = high;
    }

    return final_A;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 3 ms 7004 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 583 ms 75008 KB Output is correct
2 Correct 498 ms 74068 KB Output is correct
3 Correct 517 ms 73960 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 124 ms 37724 KB Output is correct
3 Correct 343 ms 42076 KB Output is correct
4 Correct 709 ms 76084 KB Output is correct
5 Correct 645 ms 76368 KB Output is correct
6 Correct 729 ms 76624 KB Output is correct
7 Correct 316 ms 76112 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 66 ms 35424 KB Output is correct
4 Correct 240 ms 40612 KB Output is correct
5 Correct 349 ms 66748 KB Output is correct
6 Correct 343 ms 67004 KB Output is correct
7 Correct 527 ms 67168 KB Output is correct
8 Correct 319 ms 66828 KB Output is correct
9 Correct 569 ms 67428 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4700 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 3 ms 7004 KB Output is correct
6 Correct 583 ms 75008 KB Output is correct
7 Correct 498 ms 74068 KB Output is correct
8 Correct 517 ms 73960 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 124 ms 37724 KB Output is correct
11 Correct 343 ms 42076 KB Output is correct
12 Correct 709 ms 76084 KB Output is correct
13 Correct 645 ms 76368 KB Output is correct
14 Correct 729 ms 76624 KB Output is correct
15 Correct 316 ms 76112 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 66 ms 35424 KB Output is correct
19 Correct 240 ms 40612 KB Output is correct
20 Correct 349 ms 66748 KB Output is correct
21 Correct 343 ms 67004 KB Output is correct
22 Correct 527 ms 67168 KB Output is correct
23 Correct 319 ms 66828 KB Output is correct
24 Correct 569 ms 67428 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 178 ms 41188 KB Output is correct
27 Correct 125 ms 37460 KB Output is correct
28 Correct 404 ms 74488 KB Output is correct
29 Correct 493 ms 75088 KB Output is correct
30 Correct 478 ms 75236 KB Output is correct
31 Correct 507 ms 75348 KB Output is correct
32 Correct 599 ms 75716 KB Output is correct