oj.uz

Submission #659793

# Submission time Handle Problem Language Result Execution time Memory
659793 2022-11-19T09:30:21 Z tibinyte Osumnjičeni (COCI21_osumnjiceni) C++14
60 / 110
 1000 ms 62824 KB 
#include <bits/stdc++.h>
using namespace std;

const int maxlog = 20;

struct aint
{
    vector<int> a;
    vector<int> lazy;
    void resize(int n)
    {
        a = lazy = vector<int>(4 * n);
    }
    void prop(int node, int left, int right)
    {
        a[node] += lazy[node];
        if (left != right)
        {
            lazy[2 * node] += lazy[node];
            lazy[2 * node + 1] += lazy[node];
        }
        lazy[node] = 0;
    }
    void update(int node, int left, int right, int st, int dr, int val)
    {
        prop(node, left, right);
        if (right < st || left > dr)
        {
            return;
        }
        if (st <= left && dr >= right)
        {
            lazy[node] += val;
            prop(node, left, right);
            return;
        }
        int mid = (left + right) / 2;
        update(2 * node, left, mid, st, dr, val);
        update(2 * node + 1, mid + 1, right, st, dr, val);
        a[node] = a[2 * node] + a[2 * node + 1];
    }
    int query(int node, int left, int right, int st, int dr)
    {
        prop(node, left, right);
        if (right < st || left > dr)
        {
            return 0;
        }
        if (st <= left && dr >= right)
        {
            return a[node];
        }
        int mid = (left + right) / 2;
        return query(2 * node, left, mid, st, dr) + query(2 * node + 1, mid + 1, right, st, dr);
    }
};
int32_t main()
{
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    vector<pair<int, int>> a(n + 1);
    vector<int> norm;
    for (int i = 1; i <= n; ++i)
    {
        cin >> a[i].first >> a[i].second;
        norm.push_back(a[i].first);
        norm.push_back(a[i].second);
    }
    sort(norm.begin(), norm.end());
    map<int, int> qui;
    int p = 0;
    for (auto i : norm)
    {
        if (qui.find(i) == qui.end())
        {
            qui[i] = ++p;
        }
    }
    for (int i = 1; i <= n; ++i)
    {
        a[i].first = qui[a[i].first];
        a[i].second = qui[a[i].second];
    }
    aint tree;
    tree.resize(p);
    vector<int> next(n + 2);
    next[n + 1] = n + 1;
    int p2 = 1;
    for (int i = 1; i <= n; ++i)
    {
        if (i != 1)
        {
            tree.update(1, 1, p, a[i - 1].first, a[i - 1].second, -1);
        }
        while (p2 <= n && tree.query(1, 1, p, a[p2].first, a[p2].second) == 0)
        {
            tree.update(1, 1, p, a[p2].first, a[p2].second, 1);
            p2++;
        }
        next[i] = p2;
    }
    vector<vector<int>> jump(n + 2, vector<int>(maxlog + 1));
    for (int i = 1; i <= n + 1; ++i)
    {
        jump[i][0] = next[i];
    }
    for (int j = 1; j <= maxlog; ++j)
    {
        for (int i = 1; i <= n + 1; ++i)
        {
            jump[i][j] = jump[jump[i][j - 1]][j - 1];
        }
    }
    int q;
    cin >> q;
    while (q--)
    {
        int st, dr;
        cin >> st >> dr;
        int ans = 0;
        int wh = st;
        for (int i = maxlog; i >= 0; --i)
        {
            if (jump[wh][i] <= dr)
            {
                wh = jump[wh][i];
                ans += (1 << i);
            }
        }
        cout << ans + 1 << '\n';
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 926 ms 56460 KB Output is correct
2 Correct 873 ms 59164 KB Output is correct
3 Correct 903 ms 59368 KB Output is correct
4 Correct 979 ms 60104 KB Output is correct
5 Correct 931 ms 62824 KB Output is correct
6 Correct 104 ms 28600 KB Output is correct
7 Correct 111 ms 29160 KB Output is correct
8 Correct 134 ms 29380 KB Output is correct
9 Correct 151 ms 30096 KB Output is correct
10 Correct 146 ms 29056 KB Output is correct
11 Correct 622 ms 60920 KB Output is correct
12 Correct 577 ms 57128 KB Output is correct
13 Correct 553 ms 57024 KB Output is correct
14 Correct 637 ms 60880 KB Output is correct
15 Correct 601 ms 59204 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 107 ms 30608 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1716 KB Output is correct
2 Correct 15 ms 1808 KB Output is correct
3 Correct 14 ms 1744 KB Output is correct
4 Correct 15 ms 1868 KB Output is correct
5 Correct 13 ms 1788 KB Output is correct
6 Correct 4 ms 1108 KB Output is correct
7 Correct 4 ms 1100 KB Output is correct
8 Correct 5 ms 1116 KB Output is correct
9 Correct 5 ms 1100 KB Output is correct
10 Correct 5 ms 1108 KB Output is correct
11 Correct 10 ms 1824 KB Output is correct
12 Correct 9 ms 1760 KB Output is correct
13 Correct 10 ms 1748 KB Output is correct
14 Correct 10 ms 1876 KB Output is correct
15 Correct 10 ms 1832 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 5 ms 1136 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 1716 KB Output is correct
2 Correct 15 ms 1808 KB Output is correct
3 Correct 14 ms 1744 KB Output is correct
4 Correct 15 ms 1868 KB Output is correct
5 Correct 13 ms 1788 KB Output is correct
6 Correct 4 ms 1108 KB Output is correct
7 Correct 4 ms 1100 KB Output is correct
8 Correct 5 ms 1116 KB Output is correct
9 Correct 5 ms 1100 KB Output is correct
10 Correct 5 ms 1108 KB Output is correct
11 Correct 10 ms 1824 KB Output is correct
12 Correct 9 ms 1760 KB Output is correct
13 Correct 10 ms 1748 KB Output is correct
14 Correct 10 ms 1876 KB Output is correct
15 Correct 10 ms 1832 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 5 ms 1136 KB Output is correct
18 Correct 84 ms 4496 KB Output is correct
19 Correct 76 ms 4164 KB Output is correct
20 Correct 83 ms 4544 KB Output is correct
21 Correct 75 ms 4192 KB Output is correct
22 Correct 79 ms 4376 KB Output is correct
23 Correct 68 ms 3532 KB Output is correct
24 Correct 74 ms 3720 KB Output is correct
25 Correct 87 ms 3708 KB Output is correct
26 Correct 68 ms 3552 KB Output is correct
27 Correct 61 ms 3376 KB Output is correct
28 Correct 64 ms 3844 KB Output is correct
29 Correct 56 ms 3860 KB Output is correct
30 Correct 62 ms 3912 KB Output is correct
31 Correct 53 ms 3804 KB Output is correct
32 Correct 54 ms 3876 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 53 ms 3372 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 926 ms 59060 KB Output is correct
2 Correct 926 ms 61584 KB Output is correct
3 Correct 813 ms 57352 KB Output is correct
4 Correct 832 ms 56784 KB Output is correct
5 Correct 872 ms 58444 KB Output is correct
6 Correct 104 ms 28844 KB Output is correct
7 Correct 107 ms 28532 KB Output is correct
8 Correct 118 ms 28756 KB Output is correct
9 Correct 128 ms 28620 KB Output is correct
10 Correct 149 ms 30764 KB Output is correct
11 Correct 565 ms 56704 KB Output is correct
12 Correct 590 ms 62244 KB Output is correct
13 Correct 575 ms 56668 KB Output is correct
14 Correct 597 ms 58456 KB Output is correct
15 Correct 645 ms 61840 KB Output is correct
16 Correct 1 ms 320 KB Output is correct
17 Correct 101 ms 29336 KB Output is correct

Subtask #5
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 926 ms 56460 KB Output is correct
2 Correct 873 ms 59164 KB Output is correct
3 Correct 903 ms 59368 KB Output is correct
4 Correct 979 ms 60104 KB Output is correct
5 Correct 931 ms 62824 KB Output is correct
6 Correct 104 ms 28600 KB Output is correct
7 Correct 111 ms 29160 KB Output is correct
8 Correct 134 ms 29380 KB Output is correct
9 Correct 151 ms 30096 KB Output is correct
10 Correct 146 ms 29056 KB Output is correct
11 Correct 622 ms 60920 KB Output is correct
12 Correct 577 ms 57128 KB Output is correct
13 Correct 553 ms 57024 KB Output is correct
14 Correct 637 ms 60880 KB Output is correct
15 Correct 601 ms 59204 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 107 ms 30608 KB Output is correct
18 Correct 17 ms 1716 KB Output is correct
19 Correct 15 ms 1808 KB Output is correct
20 Correct 14 ms 1744 KB Output is correct
21 Correct 15 ms 1868 KB Output is correct
22 Correct 13 ms 1788 KB Output is correct
23 Correct 4 ms 1108 KB Output is correct
24 Correct 4 ms 1100 KB Output is correct
25 Correct 5 ms 1116 KB Output is correct
26 Correct 5 ms 1100 KB Output is correct
27 Correct 5 ms 1108 KB Output is correct
28 Correct 10 ms 1824 KB Output is correct
29 Correct 9 ms 1760 KB Output is correct
30 Correct 10 ms 1748 KB Output is correct
31 Correct 10 ms 1876 KB Output is correct
32 Correct 10 ms 1832 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 5 ms 1136 KB Output is correct
35 Correct 84 ms 4496 KB Output is correct
36 Correct 76 ms 4164 KB Output is correct
37 Correct 83 ms 4544 KB Output is correct
38 Correct 75 ms 4192 KB Output is correct
39 Correct 79 ms 4376 KB Output is correct
40 Correct 68 ms 3532 KB Output is correct
41 Correct 74 ms 3720 KB Output is correct
42 Correct 87 ms 3708 KB Output is correct
43 Correct 68 ms 3552 KB Output is correct
44 Correct 61 ms 3376 KB Output is correct
45 Correct 64 ms 3844 KB Output is correct
46 Correct 56 ms 3860 KB Output is correct
47 Correct 62 ms 3912 KB Output is correct
48 Correct 53 ms 3804 KB Output is correct
49 Correct 54 ms 3876 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 53 ms 3372 KB Output is correct
52 Correct 926 ms 59060 KB Output is correct
53 Correct 926 ms 61584 KB Output is correct
54 Correct 813 ms 57352 KB Output is correct
55 Correct 832 ms 56784 KB Output is correct
56 Correct 872 ms 58444 KB Output is correct
57 Correct 104 ms 28844 KB Output is correct
58 Correct 107 ms 28532 KB Output is correct
59 Correct 118 ms 28756 KB Output is correct
60 Correct 128 ms 28620 KB Output is correct
61 Correct 149 ms 30764 KB Output is correct
62 Correct 565 ms 56704 KB Output is correct
63 Correct 590 ms 62244 KB Output is correct
64 Correct 575 ms 56668 KB Output is correct
65 Correct 597 ms 58456 KB Output is correct
66 Correct 645 ms 61840 KB Output is correct
67 Correct 1 ms 320 KB Output is correct
68 Correct 101 ms 29336 KB Output is correct
69 Execution timed out 1067 ms 61944 KB Time limit exceeded
70 Halted 0 ms 0 KB -