oj.uz

Submission #746188

# Submission time Handle Problem Language Result Execution time Memory
746188 2023-05-21T19:25:19 Z piOOE Constellation 3 (JOI20_constellation3) C++17
100 / 100
 183 ms 30544 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

struct DSU {
    vector<int> fa, sz;

    explicit DSU(int n) : fa(n), sz(n, 1) {
        iota(fa.begin(), fa.end(), 0);
    }
    DSU() = default;

    int leader(int x) {
        return fa[x] == x ? x : fa[x] = leader(fa[x]);
    }
};

template<typename T>
struct Fenwick {
    int n;
    vector<T> a;

    Fenwick() = default;

    explicit Fenwick(int n) : n(n), a(n + 1) {}

    void modify(int x, T v) {
        for (int i = x + 1; i <= n; i += i & -i) {
            a[i] += v;
        }
    }

    void modify(int l, int r, T v) {
        if (l >= r) return;
        modify(l, v), modify(r, -v);
    }

    T sum(int x) {
        T ans = 0;
        for (int i = x + 1; i > 0; i -= i & -i) {
            ans += a[i];
        }
        return ans;
    }
};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    vector<int> a(n);
    vector<vector<int>> buildings(n + 1);
    vector<vector<pair<int, int>>> queries(n + 1);

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

    int m;
    cin >> m;

    for (int i = 0; i < m; ++i) {
        int x, y, c;
        cin >> x >> y >> c;
        queries[y].emplace_back(x, c);
    }

    DSU l(n + 2), r(n + 2);
    Fenwick<ll> fn(n + 2);

    ll ans = 0;

    for (int y = 1; y <= n; ++y) {
        for (auto [x, c] : queries[y]) {
            ans += c;
            ll diff = c - fn.sum(x);
            if (diff > 0) {
                ans -= diff;
                fn.modify(l.leader(x) + 1, r.leader(x), diff);
            }
        }

        for (int i : buildings[y]) {
            l.fa[i] = i - 1;
            r.fa[i] = i + 1;
        }
    }

    cout << ans << '\n';

    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 284 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct

Subtask #2
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 284 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 508 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 588 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 2 ms 592 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 596 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 532 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 588 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 1 ms 464 KB Output is correct
42 Correct 1 ms 484 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct

Subtask #3
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 1 ms 328 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 284 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 2 ms 508 KB Output is correct
25 Correct 2 ms 468 KB Output is correct
26 Correct 2 ms 588 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 2 ms 592 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 596 KB Output is correct
33 Correct 1 ms 596 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 532 KB Output is correct
36 Correct 2 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 588 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 1 ms 464 KB Output is correct
42 Correct 1 ms 484 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 1 ms 468 KB Output is correct
45 Correct 164 ms 28208 KB Output is correct
46 Correct 165 ms 27944 KB Output is correct
47 Correct 166 ms 27944 KB Output is correct
48 Correct 160 ms 28108 KB Output is correct
49 Correct 173 ms 27544 KB Output is correct
50 Correct 156 ms 27504 KB Output is correct
51 Correct 183 ms 27616 KB Output is correct
52 Correct 173 ms 28188 KB Output is correct
53 Correct 164 ms 27992 KB Output is correct
54 Correct 123 ms 30544 KB Output is correct
55 Correct 123 ms 30224 KB Output is correct
56 Correct 113 ms 29776 KB Output is correct
57 Correct 128 ms 29788 KB Output is correct
58 Correct 115 ms 24592 KB Output is correct
59 Correct 107 ms 24604 KB Output is correct
60 Correct 100 ms 29136 KB Output is correct
61 Correct 81 ms 23540 KB Output is correct
62 Correct 135 ms 27344 KB Output is correct
63 Correct 81 ms 23264 KB Output is correct
64 Correct 79 ms 22704 KB Output is correct
65 Correct 130 ms 27408 KB Output is correct
66 Correct 84 ms 22852 KB Output is correct