oj.uz

Submission #929897

# Submission time Handle Problem Language Result Execution time Memory
929897 2024-02-18T08:35:14 Z Pannda Event Hopping 2 (JOI21_event2) C++17
100 / 100
 386 ms 49388 KB 
#include <bits/stdc++.h>
using namespace std;

const int INF = 1e9 + 12345;

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

    int n, k;
    cin >> n >> k;

    vector<array<int, 2>> a(n);
    for (int i = 0; i < n; i++) {
        int l, r;
        cin >> l >> r;
        a[i] = {l, r};
    }

    auto [next, prev] = [](int n, vector<array<int, 2>> a) {
        int log = 32 - __builtin_clz(n);
        vector<vector<int>> next(n, vector<int>(log, -1));
        vector<vector<int>> prev(n, vector<int>(log, -1));
        vector<array<int, 3>> events;
        for (int i = 0; i < n; i++) {
            events.push_back({ a[i][0], +1, i });
            events.push_back({ a[i][1], -1, i });
        }
        sort(events.begin(), events.end());
        priority_queue<array<int, 2>, vector<array<int, 2>>, less<>> mx_pq;
        for (auto [x, type, i] : events) {
            if (type == -1) {
                mx_pq.push({ a[i][0], i });
            } else {
                prev[i][0] = mx_pq.empty() ? -1 : mx_pq.top()[1];
            }
        }
        reverse(events.begin(), events.end());
        priority_queue<array<int, 2>, vector<array<int, 2>>, greater<>> mn_pq;
        for (auto [x, type, i] : events) {
            if (type == +1) {
                mn_pq.push({ a[i][1], i });
            } else {
                next[i][0] = mn_pq.empty() ? -1 : mn_pq.top()[1];
            }
        }
        for (int t = 1; t < log; t++) {
            for (int i = 0; i < n; i++) {
                next[i][t] = next[i][t - 1] == -1 ? -1 : next[next[i][t - 1]][t - 1];
                prev[i][t] = prev[i][t - 1] == -1 ? -1 : prev[prev[i][t - 1]][t - 1];
            }
        }
        return make_pair(next, prev);
    }(n, a);

    auto forward_lift = [&](int i, int bound) {
        int lifted = 0;
        for (int t = next[i].size() - 1; t >= 0; t--) {
            int j = next[i][t];
            if (j != -1 && a[j][1] <= bound) {
                i = j;
                lifted += 1 << t;
            }
        }
        return lifted;
    };

    auto backward_lift = [&](int i, int bound) {
        int lifted = 0;
        for (int t = prev[i].size() - 1; t >= 0; t--) {
            int j = prev[i][t];
            if (j != -1 && bound <= a[j][0]) {
                i = j;
                lifted += 1 << t;
            }
        }
        return lifted;
    };

    set<array<int, 2>> cut = { {-INF, -1}, {INF, -1} };
    auto intersect = [&](int i, int j) {
        if (i == -1 || j == -1) return false;
        if (a[i] == a[j]) return true;
        return (a[j][0] < a[i][0] && a[i][0] < a[j][1]) || (a[i][0] < a[j][0] && a[j][0] < a[i][1]) || (a[j][0] < a[i][1] && a[i][1] < a[j][1]) || (a[i][0] < a[j][1] && a[j][1] < a[i][1]);
    };

    vector<int> key;
    int cur;
    for (int i = 0; i < n; i++) {
        auto [m1, im1] = *cut.lower_bound(array<int, 2>{a[i][0], -INF});
        auto [m2, im2] = *cut.upper_bound(array<int, 2>{a[i][0], INF});
        auto [l, il] = *--cut.upper_bound(array<int, 2>{a[i][0], INF});
        auto [r, ir] = *cut.lower_bound(array<int, 2>{a[i][1], -INF});
        if (intersect(i, im1) || intersect(i, im2) || intersect(i, il) || intersect(i, ir)) {
            continue;
        }
        int cur_try;
        if (il == -1 && ir == -1) {
            cur_try = forward_lift(i, INF) + backward_lift(i, -INF) + 1;
        } else if (il == -1) {
            cur_try = cur - backward_lift(ir, -INF) + forward_lift(i, r) + backward_lift(i, -INF) + 1;
        } else if (ir == -1) {
            cur_try = cur - forward_lift(il, INF) + forward_lift(i, INF) + backward_lift(i, l) + 1;
        } else {
            cur_try = cur - forward_lift(il, r) + forward_lift(i, r) + backward_lift(i, l) + 1;
        }
        if (cur_try < k) continue;
        cur = cur_try;
        key.push_back(i);
        cut.insert({a[i][0], i});
        cut.insert({a[i][1], i});
    }

    if (key.empty()) {
        cout << -1 << '\n';
    } else {
        assert(key.size() >= k);
        key.resize(k);
        for (int i : key) {
            cout << i + 1 << '\n';
        }
    }
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from event2.cpp:1:
event2.cpp: In function 'int main()':
event2.cpp:117:27: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  117 |         assert(key.size() >= k);
      |                ~~~~~~~~~~~^~~~
event2.cpp:105:27: warning: 'cur' may be used uninitialized in this function [-Wmaybe-uninitialized]
  105 |             cur_try = cur - forward_lift(il, r) + forward_lift(i, r) + backward_lift(i, l) + 1;
      |                       ~~~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 161 ms 46428 KB Output is correct
5 Correct 194 ms 46608 KB Output is correct
6 Correct 234 ms 46408 KB Output is correct
7 Correct 160 ms 46416 KB Output is correct
8 Correct 214 ms 47080 KB Output is correct
9 Correct 191 ms 46524 KB Output is correct
10 Correct 190 ms 46528 KB Output is correct
11 Correct 167 ms 47048 KB Output is correct
12 Correct 151 ms 46508 KB Output is correct
13 Correct 162 ms 46912 KB Output is correct
14 Correct 162 ms 46644 KB Output is correct
15 Correct 142 ms 46528 KB Output is correct
16 Correct 118 ms 46600 KB Output is correct
17 Correct 112 ms 46536 KB Output is correct
18 Correct 147 ms 46528 KB Output is correct
19 Correct 99 ms 46612 KB Output is correct
20 Correct 108 ms 46668 KB Output is correct
21 Correct 107 ms 46912 KB Output is correct
22 Correct 104 ms 46516 KB Output is correct
23 Correct 97 ms 46504 KB Output is correct
24 Correct 91 ms 46536 KB Output is correct
25 Correct 91 ms 47056 KB Output is correct
26 Correct 112 ms 46528 KB Output is correct
27 Correct 121 ms 46512 KB Output is correct
28 Correct 92 ms 46632 KB Output is correct
29 Correct 110 ms 46528 KB Output is correct
30 Correct 127 ms 46948 KB Output is correct
31 Correct 98 ms 46532 KB Output is correct
32 Correct 93 ms 46500 KB Output is correct
33 Correct 118 ms 46616 KB Output is correct
34 Correct 217 ms 46884 KB Output is correct
35 Correct 151 ms 46396 KB Output is correct
36 Correct 161 ms 46628 KB Output is correct
37 Correct 171 ms 46596 KB Output is correct
38 Correct 144 ms 46492 KB Output is correct
39 Correct 172 ms 46604 KB Output is correct
40 Correct 153 ms 46664 KB Output is correct
41 Correct 160 ms 46528 KB Output is correct
42 Correct 109 ms 47088 KB Output is correct
43 Correct 147 ms 46628 KB Output is correct
44 Correct 161 ms 47120 KB Output is correct
45 Correct 164 ms 46616 KB Output is correct
46 Correct 140 ms 46528 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 508 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 508 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 4 ms 1628 KB Output is correct
29 Correct 3 ms 1624 KB Output is correct
30 Correct 3 ms 1628 KB Output is correct
31 Correct 3 ms 1624 KB Output is correct
32 Correct 3 ms 1624 KB Output is correct
33 Correct 3 ms 1628 KB Output is correct
34 Correct 3 ms 1628 KB Output is correct
35 Correct 5 ms 1628 KB Output is correct
36 Correct 5 ms 1556 KB Output is correct
37 Correct 7 ms 1628 KB Output is correct
38 Correct 5 ms 1624 KB Output is correct
39 Correct 5 ms 1628 KB Output is correct
40 Correct 5 ms 1732 KB Output is correct
41 Correct 5 ms 1624 KB Output is correct
42 Correct 3 ms 1628 KB Output is correct
43 Correct 4 ms 1500 KB Output is correct
44 Correct 4 ms 1624 KB Output is correct
45 Correct 4 ms 1568 KB Output is correct
46 Correct 3 ms 1780 KB Output is correct
47 Correct 4 ms 1628 KB Output is correct
48 Correct 3 ms 1628 KB Output is correct
49 Correct 3 ms 1484 KB Output is correct
50 Correct 4 ms 1884 KB Output is correct
51 Correct 3 ms 1628 KB Output is correct
52 Correct 4 ms 1560 KB Output is correct
53 Correct 3 ms 1628 KB Output is correct
54 Correct 3 ms 1492 KB Output is correct
55 Correct 4 ms 1564 KB Output is correct
56 Correct 5 ms 1628 KB Output is correct
57 Correct 5 ms 1628 KB Output is correct
58 Correct 4 ms 1780 KB Output is correct
59 Correct 4 ms 1884 KB Output is correct
60 Correct 5 ms 1636 KB Output is correct
61 Correct 4 ms 1624 KB Output is correct
62 Correct 6 ms 1628 KB Output is correct
63 Correct 4 ms 1880 KB Output is correct
64 Correct 2 ms 1628 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 161 ms 46428 KB Output is correct
5 Correct 194 ms 46608 KB Output is correct
6 Correct 234 ms 46408 KB Output is correct
7 Correct 160 ms 46416 KB Output is correct
8 Correct 214 ms 47080 KB Output is correct
9 Correct 191 ms 46524 KB Output is correct
10 Correct 190 ms 46528 KB Output is correct
11 Correct 167 ms 47048 KB Output is correct
12 Correct 151 ms 46508 KB Output is correct
13 Correct 162 ms 46912 KB Output is correct
14 Correct 162 ms 46644 KB Output is correct
15 Correct 142 ms 46528 KB Output is correct
16 Correct 118 ms 46600 KB Output is correct
17 Correct 112 ms 46536 KB Output is correct
18 Correct 147 ms 46528 KB Output is correct
19 Correct 99 ms 46612 KB Output is correct
20 Correct 108 ms 46668 KB Output is correct
21 Correct 107 ms 46912 KB Output is correct
22 Correct 104 ms 46516 KB Output is correct
23 Correct 97 ms 46504 KB Output is correct
24 Correct 91 ms 46536 KB Output is correct
25 Correct 91 ms 47056 KB Output is correct
26 Correct 112 ms 46528 KB Output is correct
27 Correct 121 ms 46512 KB Output is correct
28 Correct 92 ms 46632 KB Output is correct
29 Correct 110 ms 46528 KB Output is correct
30 Correct 127 ms 46948 KB Output is correct
31 Correct 98 ms 46532 KB Output is correct
32 Correct 93 ms 46500 KB Output is correct
33 Correct 118 ms 46616 KB Output is correct
34 Correct 217 ms 46884 KB Output is correct
35 Correct 151 ms 46396 KB Output is correct
36 Correct 161 ms 46628 KB Output is correct
37 Correct 171 ms 46596 KB Output is correct
38 Correct 144 ms 46492 KB Output is correct
39 Correct 172 ms 46604 KB Output is correct
40 Correct 153 ms 46664 KB Output is correct
41 Correct 160 ms 46528 KB Output is correct
42 Correct 109 ms 47088 KB Output is correct
43 Correct 147 ms 46628 KB Output is correct
44 Correct 161 ms 47120 KB Output is correct
45 Correct 164 ms 46616 KB Output is correct
46 Correct 140 ms 46528 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 1 ms 600 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 1 ms 344 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 1 ms 508 KB Output is correct
69 Correct 1 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 0 ms 348 KB Output is correct
74 Correct 4 ms 1628 KB Output is correct
75 Correct 3 ms 1624 KB Output is correct
76 Correct 3 ms 1628 KB Output is correct
77 Correct 3 ms 1624 KB Output is correct
78 Correct 3 ms 1624 KB Output is correct
79 Correct 3 ms 1628 KB Output is correct
80 Correct 3 ms 1628 KB Output is correct
81 Correct 5 ms 1628 KB Output is correct
82 Correct 5 ms 1556 KB Output is correct
83 Correct 7 ms 1628 KB Output is correct
84 Correct 5 ms 1624 KB Output is correct
85 Correct 5 ms 1628 KB Output is correct
86 Correct 5 ms 1732 KB Output is correct
87 Correct 5 ms 1624 KB Output is correct
88 Correct 3 ms 1628 KB Output is correct
89 Correct 4 ms 1500 KB Output is correct
90 Correct 4 ms 1624 KB Output is correct
91 Correct 4 ms 1568 KB Output is correct
92 Correct 3 ms 1780 KB Output is correct
93 Correct 4 ms 1628 KB Output is correct
94 Correct 3 ms 1628 KB Output is correct
95 Correct 3 ms 1484 KB Output is correct
96 Correct 4 ms 1884 KB Output is correct
97 Correct 3 ms 1628 KB Output is correct
98 Correct 4 ms 1560 KB Output is correct
99 Correct 3 ms 1628 KB Output is correct
100 Correct 3 ms 1492 KB Output is correct
101 Correct 4 ms 1564 KB Output is correct
102 Correct 5 ms 1628 KB Output is correct
103 Correct 5 ms 1628 KB Output is correct
104 Correct 4 ms 1780 KB Output is correct
105 Correct 4 ms 1884 KB Output is correct
106 Correct 5 ms 1636 KB Output is correct
107 Correct 4 ms 1624 KB Output is correct
108 Correct 6 ms 1628 KB Output is correct
109 Correct 4 ms 1880 KB Output is correct
110 Correct 2 ms 1628 KB Output is correct
111 Correct 116 ms 48544 KB Output is correct
112 Correct 116 ms 48452 KB Output is correct
113 Correct 121 ms 48572 KB Output is correct
114 Correct 111 ms 48620 KB Output is correct
115 Correct 106 ms 48348 KB Output is correct
116 Correct 116 ms 48328 KB Output is correct
117 Correct 134 ms 48440 KB Output is correct
118 Correct 336 ms 48580 KB Output is correct
119 Correct 386 ms 48568 KB Output is correct
120 Correct 267 ms 48440 KB Output is correct
121 Correct 205 ms 48432 KB Output is correct
122 Correct 283 ms 48468 KB Output is correct
123 Correct 330 ms 48576 KB Output is correct
124 Correct 270 ms 48452 KB Output is correct
125 Correct 198 ms 49156 KB Output is correct
126 Correct 201 ms 48404 KB Output is correct
127 Correct 184 ms 48456 KB Output is correct
128 Correct 175 ms 48640 KB Output is correct
129 Correct 245 ms 48552 KB Output is correct
130 Correct 161 ms 48452 KB Output is correct
131 Correct 146 ms 48552 KB Output is correct
132 Correct 149 ms 48560 KB Output is correct
133 Correct 149 ms 48572 KB Output is correct
134 Correct 125 ms 48456 KB Output is correct
135 Correct 124 ms 48456 KB Output is correct
136 Correct 117 ms 48444 KB Output is correct
137 Correct 139 ms 49096 KB Output is correct
138 Correct 114 ms 49388 KB Output is correct
139 Correct 120 ms 48580 KB Output is correct
140 Correct 118 ms 48552 KB Output is correct
141 Correct 122 ms 48392 KB Output is correct
142 Correct 171 ms 48444 KB Output is correct
143 Correct 208 ms 48452 KB Output is correct
144 Correct 167 ms 48688 KB Output is correct
145 Correct 148 ms 48572 KB Output is correct
146 Correct 155 ms 49252 KB Output is correct
147 Correct 151 ms 48576 KB Output is correct
148 Correct 146 ms 48532 KB Output is correct
149 Correct 167 ms 48320 KB Output is correct
150 Correct 150 ms 48544 KB Output is correct
151 Correct 160 ms 48356 KB Output is correct
152 Correct 93 ms 48448 KB Output is correct
153 Correct 167 ms 48448 KB Output is correct
154 Correct 153 ms 48452 KB Output is correct
155 Correct 157 ms 48848 KB Output is correct
156 Correct 153 ms 48576 KB Output is correct
157 Correct 160 ms 48328 KB Output is correct
158 Correct 161 ms 48652 KB Output is correct
159 Correct 144 ms 48564 KB Output is correct
160 Correct 89 ms 49168 KB Output is correct
161 Correct 266 ms 48580 KB Output is correct
162 Correct 235 ms 48456 KB Output is correct
163 Correct 275 ms 48460 KB Output is correct
164 Correct 267 ms 49076 KB Output is correct
165 Correct 240 ms 48544 KB Output is correct
166 Correct 116 ms 48568 KB Output is correct
167 Correct 168 ms 48572 KB Output is correct
168 Correct 148 ms 48896 KB Output is correct
169 Correct 147 ms 48808 KB Output is correct
170 Correct 158 ms 48528 KB Output is correct
171 Correct 150 ms 47684 KB Output is correct
172 Correct 151 ms 48576 KB Output is correct
173 Correct 268 ms 48448 KB Output is correct
174 Correct 278 ms 48452 KB Output is correct
175 Correct 313 ms 48844 KB Output is correct
176 Correct 346 ms 48404 KB Output is correct