oj.uz

Submission #875587

# Submission time Handle Problem Language Result Execution time Memory
875587 2023-11-20T06:01:02 Z vjudge1 Event Hopping 2 (JOI21_event2) C++17
100 / 100
 228 ms 34300 KB 
// https://oj.uz/problem/view/JOI21_event2

#include <bits/stdc++.h>
using namespace std;

const int inf = 1e9 + 1e8;

int32_t main() {
        ios_base::sync_with_stdio(0);
        cin.tie(0);

        int n, k;
        cin >> n >> k;
        vector<int> l(n), r(n);
        for (int i = 0; i < n; i++) cin >> l[i] >> r[i];
        vector<int> ord(n);
        iota(ord.begin(), ord.end(), 0);

        // calc nxt

        sort(ord.begin(), ord.end(), [&](int i, int j) {
                return l[i] < l[j];
        });
        vector<int> suff(n);
        suff.back() = ord.back();
        for (int i = n - 1; i > 0; i--) suff[i - 1] = r[ord[i - 1]] < r[suff[i]] ? ord[i - 1] : suff[i];
        auto sl = l;
        vector<vector<int>> nxt(__lg(n) + 1, vector<int>(n + 1, n));
        sort(sl.begin(), sl.end());
        for (int i = 0; i < n; i++) {
                int j = lower_bound(sl.begin(), sl.end(), r[i]) - sl.begin();
                if (j == n) {
                        nxt[0][i] = n;
                } else {
                        nxt[0][i] = suff[j];
                }
        }

        // calc prv

        sort(ord.begin(), ord.end(), [&](int i, int j) {
                return r[i] < r[j];
        });
        vector<int> pref(n);
        pref[0] = ord[0];
        for (int i = 1; i < n; i++) pref[i] = l[ord[i]] > l[pref[i - 1]] ? ord[i] : pref[i - 1];
        auto sr = r;
        vector<vector<int>> prv(__lg(n) + 1, vector<int>(n + 1, n));
        sort(sr.begin(), sr.end());
        for (int i = 0; i < n; i++) {
                int j = upper_bound(sr.begin(), sr.end(), l[i]) - sr.begin() - 1;
                if (j == -1) {
                        prv[0][i] = n;
                } else {
                        prv[0][i] = pref[j];
                }
        }

        for (int i = 1; i <= __lg(n); i++) {
                for (int j = 0; j < n; j++) {
                        nxt[i][j] = nxt[i - 1][nxt[i - 1][j]];
                        prv[i][j] = prv[i - 1][prv[i - 1][j]];
                }
        }

        vector<int> cnt_left(n), cnt_right(n);
        int cnt_all = 0;

        auto try_first = [&](int x) {
                int cnt = 1;
                int l = x, r = x;
                for (int i = __lg(n); i >= 0; i--) {
                        if (nxt[i][r] != n) r = nxt[i][r], cnt += 1 << i, cnt_right[x] += 1 << i;
                        if (prv[i][l] != n) l = prv[i][l], cnt += 1 << i, cnt_left[x] += 1 << i;
                }
                return cnt >= k;
        };

        vector<int> ans;

        set<int> s, set_left, set_right;
        set<pair<int, int>> set_point;

        auto intersect = [&](int x) {
                auto ll = set_left.upper_bound(l[x]);
                auto lr = set_right.upper_bound(l[x]);
                if (ll != set_left.end() && *ll < r[x]) return 1;
                if (lr != set_right.end() && *lr <= r[x]) return 1;
                int pos_left, pos_right;
                if (ll == set_left.begin()) {
                        pos_left = -inf - 1;
                } else {
                        pos_left = *prev(ll);
                }
                if (lr == set_right.begin()) {
                        pos_right = -inf + 1;
                } else {
                        pos_right = *prev(lr);
                }
                if (pos_right <= pos_left) return 1;
                auto rl = set_left.lower_bound(r[x]);
                auto rr = set_right.lower_bound(r[x]);
                if (rl == set_left.end()) {
                        pos_left = inf - 1;
                } else {
                        pos_left = *rl;
                }
                if (rr == set_right.end()) {
                        pos_right = inf + 1;
                } else {
                        pos_right = *rr;
                }
                if (pos_left >= pos_right) return 1;
                return 0;
        };

        auto try_add = [&](int x) {
                auto L = set_right.upper_bound(l[x]);
                auto R = set_left.lower_bound(r[x]);
                int limit_left, limit_right;
                if (L == set_right.begin()) {
                        limit_left = -inf;
                } else {
                        limit_left = *prev(L);
                }
                if (R == set_left.end()) {
                        limit_right = +inf;
                } else {
                        limit_right = *R;
                }

                auto right_it = set_point.lower_bound(make_pair(l[x], +inf));
                int cur = right_it == set_point.end() ? cnt_right[(prev(right_it))->second] : cnt_left[right_it->second];
                int le = x, ri = x;
                cnt_left[x] = cnt_right[x] = 0;
                for (int i = __lg(n); i >= 0; i--) {
                        if (nxt[i][ri] != n && r[nxt[i][ri]] <= limit_right) {
                                ri = nxt[i][ri];
                                cnt_right[x] += 1 << i;
                        }
                        if (prv[i][le] != n && l[prv[i][le]] >= limit_left) {
                                le = prv[i][le];
                                cnt_left[x] += 1 << i;
                        }
                }
                if (cnt_all + cnt_left[x] + cnt_right[x] + 1 - cur < k) return 0;
                cnt_all -= cur;
                cnt_all += cnt_left[x] + cnt_right[x] + 1;
                if (right_it != set_point.begin()) {
                        auto left_it = prev(right_it);
                        cnt_right[left_it->second] = cnt_left[x];
                }
                if (right_it != set_point.end()) {
                        cnt_left[right_it->second] = cnt_right[x];
                }
                return 1;
        };

        for (int i = 0; i < n; i++) {
                if (try_first(i)) {
                        ans.emplace_back(i);
                        set_left.emplace(l[i]), set_right.emplace(r[i]);
                        set_point.emplace(l[i], i);
                        cnt_all = cnt_left[i] + cnt_right[i] + 1;
                        break;
                }
        }

        if (ans.size() == 0) return cout << -1, 0;

        for (int i = 0; i < n; i++) {
                if (intersect(i)) continue;
                if (set_point.size() < k && try_add(i)) {
                        ans.emplace_back(i);
                        set_left.emplace(l[i]);
                        set_right.emplace(r[i]);
                        set_point.emplace(l[i], i);
                }
        }

        for (int i : ans) cout << i + 1 << '\n';
}

Compilation message

event2.cpp: In function 'int32_t main()':
event2.cpp:173:38: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  173 |                 if (set_point.size() < k && try_add(i)) {
      |                     ~~~~~~~~~~~~~~~~~^~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 143 ms 31104 KB Output is correct
5 Correct 144 ms 30412 KB Output is correct
6 Correct 139 ms 29900 KB Output is correct
7 Correct 129 ms 28360 KB Output is correct
8 Correct 145 ms 31296 KB Output is correct
9 Correct 147 ms 31016 KB Output is correct
10 Correct 132 ms 29724 KB Output is correct
11 Correct 124 ms 28364 KB Output is correct
12 Correct 104 ms 25768 KB Output is correct
13 Correct 116 ms 25696 KB Output is correct
14 Correct 99 ms 25036 KB Output is correct
15 Correct 93 ms 24208 KB Output is correct
16 Correct 55 ms 19052 KB Output is correct
17 Correct 55 ms 18832 KB Output is correct
18 Correct 62 ms 18700 KB Output is correct
19 Correct 51 ms 17424 KB Output is correct
20 Correct 45 ms 17324 KB Output is correct
21 Correct 45 ms 17352 KB Output is correct
22 Correct 47 ms 17100 KB Output is correct
23 Correct 48 ms 17244 KB Output is correct
24 Correct 49 ms 17364 KB Output is correct
25 Correct 49 ms 17096 KB Output is correct
26 Correct 49 ms 17100 KB Output is correct
27 Correct 48 ms 17292 KB Output is correct
28 Correct 46 ms 17104 KB Output is correct
29 Correct 44 ms 17100 KB Output is correct
30 Correct 46 ms 17108 KB Output is correct
31 Correct 49 ms 17440 KB Output is correct
32 Correct 51 ms 17100 KB Output is correct
33 Correct 52 ms 17096 KB Output is correct
34 Correct 85 ms 22472 KB Output is correct
35 Correct 75 ms 20684 KB Output is correct
36 Correct 68 ms 18992 KB Output is correct
37 Correct 94 ms 24776 KB Output is correct
38 Correct 93 ms 24536 KB Output is correct
39 Correct 91 ms 24044 KB Output is correct
40 Correct 91 ms 23904 KB Output is correct
41 Correct 91 ms 23656 KB Output is correct
42 Correct 53 ms 17100 KB Output is correct
43 Correct 102 ms 24500 KB Output is correct
44 Correct 96 ms 24148 KB Output is correct
45 Correct 94 ms 23872 KB Output is correct
46 Correct 96 ms 23432 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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 456 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 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 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 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 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 456 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 724 KB Output is correct
31 Correct 2 ms 860 KB Output is correct
32 Correct 2 ms 864 KB Output is correct
33 Correct 2 ms 860 KB Output is correct
34 Correct 3 ms 720 KB Output is correct
35 Correct 5 ms 1116 KB Output is correct
36 Correct 5 ms 1152 KB Output is correct
37 Correct 4 ms 1116 KB Output is correct
38 Correct 2 ms 860 KB Output is correct
39 Correct 4 ms 1116 KB Output is correct
40 Correct 4 ms 1056 KB Output is correct
41 Correct 4 ms 1048 KB Output is correct
42 Correct 3 ms 860 KB Output is correct
43 Correct 3 ms 860 KB Output is correct
44 Correct 3 ms 860 KB Output is correct
45 Correct 3 ms 860 KB Output is correct
46 Correct 2 ms 796 KB Output is correct
47 Correct 2 ms 720 KB Output is correct
48 Correct 2 ms 860 KB Output is correct
49 Correct 2 ms 860 KB Output is correct
50 Correct 2 ms 860 KB Output is correct
51 Correct 2 ms 860 KB Output is correct
52 Correct 2 ms 860 KB Output is correct
53 Correct 3 ms 860 KB Output is correct
54 Correct 2 ms 764 KB Output is correct
55 Correct 3 ms 1116 KB Output is correct
56 Correct 3 ms 1116 KB Output is correct
57 Correct 3 ms 1116 KB Output is correct
58 Correct 3 ms 1116 KB Output is correct
59 Correct 3 ms 1320 KB Output is correct
60 Correct 3 ms 1116 KB Output is correct
61 Correct 3 ms 1116 KB Output is correct
62 Correct 3 ms 1116 KB Output is correct
63 Correct 3 ms 1116 KB Output is correct
64 Correct 2 ms 796 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 600 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 143 ms 31104 KB Output is correct
5 Correct 144 ms 30412 KB Output is correct
6 Correct 139 ms 29900 KB Output is correct
7 Correct 129 ms 28360 KB Output is correct
8 Correct 145 ms 31296 KB Output is correct
9 Correct 147 ms 31016 KB Output is correct
10 Correct 132 ms 29724 KB Output is correct
11 Correct 124 ms 28364 KB Output is correct
12 Correct 104 ms 25768 KB Output is correct
13 Correct 116 ms 25696 KB Output is correct
14 Correct 99 ms 25036 KB Output is correct
15 Correct 93 ms 24208 KB Output is correct
16 Correct 55 ms 19052 KB Output is correct
17 Correct 55 ms 18832 KB Output is correct
18 Correct 62 ms 18700 KB Output is correct
19 Correct 51 ms 17424 KB Output is correct
20 Correct 45 ms 17324 KB Output is correct
21 Correct 45 ms 17352 KB Output is correct
22 Correct 47 ms 17100 KB Output is correct
23 Correct 48 ms 17244 KB Output is correct
24 Correct 49 ms 17364 KB Output is correct
25 Correct 49 ms 17096 KB Output is correct
26 Correct 49 ms 17100 KB Output is correct
27 Correct 48 ms 17292 KB Output is correct
28 Correct 46 ms 17104 KB Output is correct
29 Correct 44 ms 17100 KB Output is correct
30 Correct 46 ms 17108 KB Output is correct
31 Correct 49 ms 17440 KB Output is correct
32 Correct 51 ms 17100 KB Output is correct
33 Correct 52 ms 17096 KB Output is correct
34 Correct 85 ms 22472 KB Output is correct
35 Correct 75 ms 20684 KB Output is correct
36 Correct 68 ms 18992 KB Output is correct
37 Correct 94 ms 24776 KB Output is correct
38 Correct 93 ms 24536 KB Output is correct
39 Correct 91 ms 24044 KB Output is correct
40 Correct 91 ms 23904 KB Output is correct
41 Correct 91 ms 23656 KB Output is correct
42 Correct 53 ms 17100 KB Output is correct
43 Correct 102 ms 24500 KB Output is correct
44 Correct 96 ms 24148 KB Output is correct
45 Correct 94 ms 23872 KB Output is correct
46 Correct 96 ms 23432 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 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 0 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 0 ms 456 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 1 ms 348 KB Output is correct
74 Correct 2 ms 860 KB Output is correct
75 Correct 2 ms 860 KB Output is correct
76 Correct 2 ms 724 KB Output is correct
77 Correct 2 ms 860 KB Output is correct
78 Correct 2 ms 864 KB Output is correct
79 Correct 2 ms 860 KB Output is correct
80 Correct 3 ms 720 KB Output is correct
81 Correct 5 ms 1116 KB Output is correct
82 Correct 5 ms 1152 KB Output is correct
83 Correct 4 ms 1116 KB Output is correct
84 Correct 2 ms 860 KB Output is correct
85 Correct 4 ms 1116 KB Output is correct
86 Correct 4 ms 1056 KB Output is correct
87 Correct 4 ms 1048 KB Output is correct
88 Correct 3 ms 860 KB Output is correct
89 Correct 3 ms 860 KB Output is correct
90 Correct 3 ms 860 KB Output is correct
91 Correct 3 ms 860 KB Output is correct
92 Correct 2 ms 796 KB Output is correct
93 Correct 2 ms 720 KB Output is correct
94 Correct 2 ms 860 KB Output is correct
95 Correct 2 ms 860 KB Output is correct
96 Correct 2 ms 860 KB Output is correct
97 Correct 2 ms 860 KB Output is correct
98 Correct 2 ms 860 KB Output is correct
99 Correct 3 ms 860 KB Output is correct
100 Correct 2 ms 764 KB Output is correct
101 Correct 3 ms 1116 KB Output is correct
102 Correct 3 ms 1116 KB Output is correct
103 Correct 3 ms 1116 KB Output is correct
104 Correct 3 ms 1116 KB Output is correct
105 Correct 3 ms 1320 KB Output is correct
106 Correct 3 ms 1116 KB Output is correct
107 Correct 3 ms 1116 KB Output is correct
108 Correct 3 ms 1116 KB Output is correct
109 Correct 3 ms 1116 KB Output is correct
110 Correct 2 ms 796 KB Output is correct
111 Correct 85 ms 19148 KB Output is correct
112 Correct 80 ms 19112 KB Output is correct
113 Correct 77 ms 19216 KB Output is correct
114 Correct 75 ms 19108 KB Output is correct
115 Correct 72 ms 19148 KB Output is correct
116 Correct 100 ms 19148 KB Output is correct
117 Correct 88 ms 19044 KB Output is correct
118 Correct 228 ms 33108 KB Output is correct
119 Correct 216 ms 31692 KB Output is correct
120 Correct 155 ms 26036 KB Output is correct
121 Correct 116 ms 19196 KB Output is correct
122 Correct 171 ms 27680 KB Output is correct
123 Correct 170 ms 27024 KB Output is correct
124 Correct 152 ms 26044 KB Output is correct
125 Correct 104 ms 19112 KB Output is correct
126 Correct 136 ms 21264 KB Output is correct
127 Correct 104 ms 20756 KB Output is correct
128 Correct 101 ms 20644 KB Output is correct
129 Correct 89 ms 19148 KB Output is correct
130 Correct 88 ms 19316 KB Output is correct
131 Correct 89 ms 19364 KB Output is correct
132 Correct 83 ms 19404 KB Output is correct
133 Correct 90 ms 19148 KB Output is correct
134 Correct 80 ms 19168 KB Output is correct
135 Correct 79 ms 19152 KB Output is correct
136 Correct 76 ms 19148 KB Output is correct
137 Correct 81 ms 19240 KB Output is correct
138 Correct 74 ms 19256 KB Output is correct
139 Correct 76 ms 19148 KB Output is correct
140 Correct 74 ms 19236 KB Output is correct
141 Correct 77 ms 19148 KB Output is correct
142 Correct 156 ms 34252 KB Output is correct
143 Correct 154 ms 34252 KB Output is correct
144 Correct 156 ms 34300 KB Output is correct
145 Correct 147 ms 33996 KB Output is correct
146 Correct 144 ms 33740 KB Output is correct
147 Correct 140 ms 33324 KB Output is correct
148 Correct 137 ms 33256 KB Output is correct
149 Correct 142 ms 32836 KB Output is correct
150 Correct 142 ms 32800 KB Output is correct
151 Correct 118 ms 31056 KB Output is correct
152 Correct 47 ms 19132 KB Output is correct
153 Correct 151 ms 33996 KB Output is correct
154 Correct 149 ms 33728 KB Output is correct
155 Correct 136 ms 33444 KB Output is correct
156 Correct 145 ms 33184 KB Output is correct
157 Correct 147 ms 32972 KB Output is correct
158 Correct 137 ms 32716 KB Output is correct
159 Correct 129 ms 31184 KB Output is correct
160 Correct 46 ms 19148 KB Output is correct
161 Correct 166 ms 26952 KB Output is correct
162 Correct 151 ms 26224 KB Output is correct
163 Correct 151 ms 26060 KB Output is correct
164 Correct 153 ms 26044 KB Output is correct
165 Correct 145 ms 25380 KB Output is correct
166 Correct 56 ms 19232 KB Output is correct
167 Correct 104 ms 26436 KB Output is correct
168 Correct 101 ms 26140 KB Output is correct
169 Correct 97 ms 25872 KB Output is correct
170 Correct 95 ms 25548 KB Output is correct
171 Correct 90 ms 26060 KB Output is correct
172 Correct 97 ms 26828 KB Output is correct
173 Correct 161 ms 26572 KB Output is correct
174 Correct 176 ms 26584 KB Output is correct
175 Correct 157 ms 26828 KB Output is correct
176 Correct 138 ms 25036 KB Output is correct