oj.uz

Submission #716697

# Submission time Handle Problem Language Result Execution time Memory
716697 2023-03-30T20:08:05 Z four_specks Examination (JOI19_examination) C++17
100 / 100
 1291 ms 92284 KB 
#include <bits/extc++.h>

using namespace std;
using namespace __gnu_pbds;

namespace
{
    template <typename T, typename Cmp = less<T>>
    using OrderedSet = tree<T, null_type, Cmp, rb_tree_tag, tree_order_statistics_node_update>;

} // namespace

void solve()
{
    int n, q;
    cin >> n >> q;

    vector<array<long, 2>> a(n);
    for (auto &[u, v] : a)
        cin >> u >> v;

    sort(
        a.begin(), a.end(),
        [&](const array<long, 2> &lhs, const array<long, 2> &rhs) -> bool
        { return lhs[0] + lhs[1] > rhs[0] + rhs[1]; });

    vector<long> x(q), y(q), z(q);
    for (int i = 0; i < q; i++)
        cin >> x[i] >> y[i] >> z[i];

    vector<long> all;
    for (int i = 0; i < n; i++)
        all.push_back(a[i][0]);
    for (int i = 0; i < q; i++)
        all.push_back(x[i]);
    sort(all.begin(), all.end());

    int k = (int)all.size();

    auto idx = [&](long u) -> int
    { return (int)(lower_bound(all.begin(), all.end(), u) - all.begin()); };

    vector<int> order(q);
    iota(order.begin(), order.end(), 0);
    sort(order.begin(), order.end(),
         [&](int i, int j) -> bool
         { return z[i] > z[j]; });

    vector<int> res(q);

    vector<OrderedSet<pair<long, int>>> fenw(k + 1);

    int op = 0;

    auto upd = [&](long u, long v) -> void
    {
        for (int p = k - idx(u); p <= k; p += p & -p)
            fenw[p].insert(pair(-v, op++));
    };

    auto qry = [&](long u, long v) -> int
    {
        int ret = 0;
        for (int p = k - idx(u); p; p -= p & -p)
            ret += (int)fenw[p].order_of_key(pair(-v, op));

        return ret;
    };

    for (int l = 0, i = 0; i < q; i++)
    {
        int j = order[i];

        while (l < n && a[l][0] + a[l][1] >= z[j])
        {
            upd(a[l][0], a[l][1]);
            l++;
        }

        res[j] = qry(x[j], y[j]);
    }

    for (int i = 0; i < q; i++)
        cout << res[i] << '\n';
}

int main()
{
    ios_base::sync_with_stdio(false), cin.tie(NULL);

    solve();

    return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 8 ms 2260 KB Output is correct
8 Correct 8 ms 2260 KB Output is correct
9 Correct 8 ms 2260 KB Output is correct
10 Correct 8 ms 2368 KB Output is correct
11 Correct 8 ms 2352 KB Output is correct
12 Correct 9 ms 2260 KB Output is correct
13 Correct 9 ms 2388 KB Output is correct
14 Correct 9 ms 2368 KB Output is correct
15 Correct 9 ms 2388 KB Output is correct
16 Correct 4 ms 1260 KB Output is correct
17 Correct 7 ms 2388 KB Output is correct
18 Correct 3 ms 1232 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1214 ms 84152 KB Output is correct
2 Correct 1201 ms 86592 KB Output is correct
3 Correct 1216 ms 86580 KB Output is correct
4 Correct 834 ms 85776 KB Output is correct
5 Correct 616 ms 80576 KB Output is correct
6 Correct 516 ms 74196 KB Output is correct
7 Correct 1043 ms 89956 KB Output is correct
8 Correct 1163 ms 86464 KB Output is correct
9 Correct 932 ms 89968 KB Output is correct
10 Correct 171 ms 33772 KB Output is correct
11 Correct 577 ms 85648 KB Output is correct
12 Correct 129 ms 32832 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1214 ms 84152 KB Output is correct
2 Correct 1201 ms 86592 KB Output is correct
3 Correct 1216 ms 86580 KB Output is correct
4 Correct 834 ms 85776 KB Output is correct
5 Correct 616 ms 80576 KB Output is correct
6 Correct 516 ms 74196 KB Output is correct
7 Correct 1043 ms 89956 KB Output is correct
8 Correct 1163 ms 86464 KB Output is correct
9 Correct 932 ms 89968 KB Output is correct
10 Correct 171 ms 33772 KB Output is correct
11 Correct 577 ms 85648 KB Output is correct
12 Correct 129 ms 32832 KB Output is correct
13 Correct 1058 ms 86956 KB Output is correct
14 Correct 1240 ms 86972 KB Output is correct
15 Correct 1209 ms 86612 KB Output is correct
16 Correct 721 ms 86132 KB Output is correct
17 Correct 637 ms 79340 KB Output is correct
18 Correct 637 ms 82332 KB Output is correct
19 Correct 1088 ms 87124 KB Output is correct
20 Correct 1140 ms 86920 KB Output is correct
21 Correct 1012 ms 89232 KB Output is correct
22 Correct 158 ms 33856 KB Output is correct
23 Correct 594 ms 85700 KB Output is correct
24 Correct 132 ms 32888 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 8 ms 2260 KB Output is correct
8 Correct 8 ms 2260 KB Output is correct
9 Correct 8 ms 2260 KB Output is correct
10 Correct 8 ms 2368 KB Output is correct
11 Correct 8 ms 2352 KB Output is correct
12 Correct 9 ms 2260 KB Output is correct
13 Correct 9 ms 2388 KB Output is correct
14 Correct 9 ms 2368 KB Output is correct
15 Correct 9 ms 2388 KB Output is correct
16 Correct 4 ms 1260 KB Output is correct
17 Correct 7 ms 2388 KB Output is correct
18 Correct 3 ms 1232 KB Output is correct
19 Correct 1214 ms 84152 KB Output is correct
20 Correct 1201 ms 86592 KB Output is correct
21 Correct 1216 ms 86580 KB Output is correct
22 Correct 834 ms 85776 KB Output is correct
23 Correct 616 ms 80576 KB Output is correct
24 Correct 516 ms 74196 KB Output is correct
25 Correct 1043 ms 89956 KB Output is correct
26 Correct 1163 ms 86464 KB Output is correct
27 Correct 932 ms 89968 KB Output is correct
28 Correct 171 ms 33772 KB Output is correct
29 Correct 577 ms 85648 KB Output is correct
30 Correct 129 ms 32832 KB Output is correct
31 Correct 1058 ms 86956 KB Output is correct
32 Correct 1240 ms 86972 KB Output is correct
33 Correct 1209 ms 86612 KB Output is correct
34 Correct 721 ms 86132 KB Output is correct
35 Correct 637 ms 79340 KB Output is correct
36 Correct 637 ms 82332 KB Output is correct
37 Correct 1088 ms 87124 KB Output is correct
38 Correct 1140 ms 86920 KB Output is correct
39 Correct 1012 ms 89232 KB Output is correct
40 Correct 158 ms 33856 KB Output is correct
41 Correct 594 ms 85700 KB Output is correct
42 Correct 132 ms 32888 KB Output is correct
43 Correct 1291 ms 88876 KB Output is correct
44 Correct 1080 ms 89004 KB Output is correct
45 Correct 1194 ms 88960 KB Output is correct
46 Correct 664 ms 87512 KB Output is correct
47 Correct 634 ms 81488 KB Output is correct
48 Correct 459 ms 77440 KB Output is correct
49 Correct 1120 ms 92284 KB Output is correct
50 Correct 1008 ms 88872 KB Output is correct
51 Correct 983 ms 92152 KB Output is correct
52 Correct 176 ms 35264 KB Output is correct
53 Correct 580 ms 86636 KB Output is correct