oj.uz

답안 #726132

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
726132 2023-04-18T14:02:33 Z piOOE Event Hopping 2 (JOI21_event2) C++17
100 / 100
 142 ms 10936 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

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

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

    vector<array<int, 2>> a(n);

    vector<int> yy(2 * n);

    for (int i = 0; i < n; ++i) {
        cin >> a[i][0] >> a[i][1];
        a[i][1] -= 1;
        yy[i * 2] = a[i][0];
        yy[i * 2 + 1] = a[i][1];
    }

    sort(yy.begin(), yy.end());
    yy.resize(unique(yy.begin(), yy.end()) - yy.begin());

    const int m = yy.size();

    for (auto &[l, r] : a) {
        l = lower_bound(yy.begin(), yy.end(), l) - yy.begin();
        r = lower_bound(yy.begin(), yy.end(), r) - yy.begin();
    }

    vector<array<int, 3>> s(n);
    vector<int> inv(n);

    for (int i = 0; i < n; ++i) {
        s[i] = {a[i][1], i, a[i][0]};
    }

    sort(s.begin(), s.end());

    for (int i = 0; i < n; ++i) {
        inv[s[i][1]] = i;
    }

    a.push_back({m + 1, m + 1});
    s.push_back({m + 1, n, m + 1});

    vector<int> par(n + 1, n), depth(n + 1), jump(n + 1, n), dp(m, n);
    for (int i = n - 1; i >= 0; --i) {
        par[i] = par[i + 1];
        if (i + 1 < n) {
            for (int t = s[i][0] + 1; t <= s[i + 1][0]; ++t) {
                par[i] = min(par[i], dp[t]);
            }
        }
        dp[s[i][2]] = i;

        depth[i] = depth[par[i]] + 1;
        int p = jump[par[i]], pp = jump[p];
        if (depth[pp] - depth[p] == depth[p] - depth[par[i]]) {
            jump[i] = pp;
        } else {
            jump[i] = par[i];
        }
    }

    auto rangeQuery = [&](int l, int r) {
        l = max(l, 0);
        int ans = depth[l];
        while (l < n && s[l][0] < s[r][2]) {
            if (jump[l] < n && s[jump[l]][0] < s[r][2]) {
                l = jump[l];
            } else {
                l = par[l];
            }
        }
        ans -= depth[l];
        return ans;
    };

    int best = rangeQuery(0, n);

    if (best < k) {
        cout << "-1\n";
        return 0;
    }

    set<int> alive;

    for (int i = 0; i < n && alive.size() < k; ++i) {
        int p = inv[i];
        auto it = alive.lower_bound(p);
        int r = it == alive.end() ? n : *it;
        int l = it == alive.begin() ? -1 : *prev(it);

        if (r != n && s[p][0] >= s[r][2] || l != -1 && s[l][0] >= a[i][0]) {
            continue;
        }

        int now = best - rangeQuery(l, r) + rangeQuery(l, p) + rangeQuery(p, r);
        if (now < k) {
            continue;
        }

        best = now;
        alive.insert(p);

        cout << i + 1 << "\n";
    }

    return 0;
}

Compilation message

event2.cpp: In function 'int main()':
event2.cpp:92:43: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   92 |     for (int i = 0; i < n && alive.size() < k; ++i) {
      |                              ~~~~~~~~~~~~~^~~
event2.cpp:98:20: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   98 |         if (r != n && s[p][0] >= s[r][2] || l != -1 && s[l][0] >= a[i][0]) {

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 97 ms 10408 KB Output is correct
5 Correct 95 ms 10252 KB Output is correct
6 Correct 89 ms 10024 KB Output is correct
7 Correct 89 ms 9716 KB Output is correct
8 Correct 97 ms 10552 KB Output is correct
9 Correct 91 ms 10280 KB Output is correct
10 Correct 88 ms 10012 KB Output is correct
11 Correct 92 ms 9504 KB Output is correct
12 Correct 76 ms 8636 KB Output is correct
13 Correct 74 ms 8556 KB Output is correct
14 Correct 73 ms 8376 KB Output is correct
15 Correct 74 ms 7976 KB Output is correct
16 Correct 53 ms 6336 KB Output is correct
17 Correct 53 ms 6196 KB Output is correct
18 Correct 51 ms 6168 KB Output is correct
19 Correct 49 ms 5720 KB Output is correct
20 Correct 52 ms 5724 KB Output is correct
21 Correct 53 ms 5700 KB Output is correct
22 Correct 54 ms 5672 KB Output is correct
23 Correct 53 ms 5620 KB Output is correct
24 Correct 56 ms 5564 KB Output is correct
25 Correct 65 ms 5556 KB Output is correct
26 Correct 62 ms 5576 KB Output is correct
27 Correct 59 ms 5572 KB Output is correct
28 Correct 39 ms 5628 KB Output is correct
29 Correct 40 ms 5584 KB Output is correct
30 Correct 44 ms 5560 KB Output is correct
31 Correct 47 ms 5572 KB Output is correct
32 Correct 52 ms 5556 KB Output is correct
33 Correct 58 ms 5560 KB Output is correct
34 Correct 63 ms 7424 KB Output is correct
35 Correct 55 ms 6836 KB Output is correct
36 Correct 46 ms 6172 KB Output is correct
37 Correct 85 ms 8232 KB Output is correct
38 Correct 73 ms 8116 KB Output is correct
39 Correct 73 ms 7996 KB Output is correct
40 Correct 72 ms 7876 KB Output is correct
41 Correct 70 ms 7848 KB Output is correct
42 Correct 54 ms 5568 KB Output is correct
43 Correct 88 ms 8132 KB Output is correct
44 Correct 85 ms 8064 KB Output is correct
45 Correct 87 ms 7876 KB Output is correct
46 Correct 83 ms 7848 KB Output is correct

Subtask #2
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 224 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 256 KB Output is correct
23 Correct 1 ms 224 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 3 ms 468 KB Output is correct
29 Correct 3 ms 468 KB Output is correct
30 Correct 3 ms 460 KB Output is correct
31 Correct 3 ms 468 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 2 ms 468 KB Output is correct
34 Correct 2 ms 468 KB Output is correct
35 Correct 4 ms 596 KB Output is correct
36 Correct 5 ms 552 KB Output is correct
37 Correct 4 ms 596 KB Output is correct
38 Correct 2 ms 560 KB Output is correct
39 Correct 3 ms 596 KB Output is correct
40 Correct 4 ms 596 KB Output is correct
41 Correct 3 ms 588 KB Output is correct
42 Correct 2 ms 460 KB Output is correct
43 Correct 3 ms 556 KB Output is correct
44 Correct 3 ms 468 KB Output is correct
45 Correct 3 ms 468 KB Output is correct
46 Correct 3 ms 456 KB Output is correct
47 Correct 2 ms 468 KB Output is correct
48 Correct 2 ms 468 KB Output is correct
49 Correct 3 ms 468 KB Output is correct
50 Correct 2 ms 476 KB Output is correct
51 Correct 3 ms 468 KB Output is correct
52 Correct 3 ms 556 KB Output is correct
53 Correct 2 ms 464 KB Output is correct
54 Correct 3 ms 468 KB Output is correct
55 Correct 3 ms 588 KB Output is correct
56 Correct 3 ms 684 KB Output is correct
57 Correct 3 ms 596 KB Output is correct
58 Correct 3 ms 596 KB Output is correct
59 Correct 3 ms 596 KB Output is correct
60 Correct 3 ms 596 KB Output is correct
61 Correct 3 ms 684 KB Output is correct
62 Correct 3 ms 584 KB Output is correct
63 Correct 3 ms 596 KB Output is correct
64 Correct 2 ms 468 KB Output is correct

Subtask #4
61.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 97 ms 10408 KB Output is correct
5 Correct 95 ms 10252 KB Output is correct
6 Correct 89 ms 10024 KB Output is correct
7 Correct 89 ms 9716 KB Output is correct
8 Correct 97 ms 10552 KB Output is correct
9 Correct 91 ms 10280 KB Output is correct
10 Correct 88 ms 10012 KB Output is correct
11 Correct 92 ms 9504 KB Output is correct
12 Correct 76 ms 8636 KB Output is correct
13 Correct 74 ms 8556 KB Output is correct
14 Correct 73 ms 8376 KB Output is correct
15 Correct 74 ms 7976 KB Output is correct
16 Correct 53 ms 6336 KB Output is correct
17 Correct 53 ms 6196 KB Output is correct
18 Correct 51 ms 6168 KB Output is correct
19 Correct 49 ms 5720 KB Output is correct
20 Correct 52 ms 5724 KB Output is correct
21 Correct 53 ms 5700 KB Output is correct
22 Correct 54 ms 5672 KB Output is correct
23 Correct 53 ms 5620 KB Output is correct
24 Correct 56 ms 5564 KB Output is correct
25 Correct 65 ms 5556 KB Output is correct
26 Correct 62 ms 5576 KB Output is correct
27 Correct 59 ms 5572 KB Output is correct
28 Correct 39 ms 5628 KB Output is correct
29 Correct 40 ms 5584 KB Output is correct
30 Correct 44 ms 5560 KB Output is correct
31 Correct 47 ms 5572 KB Output is correct
32 Correct 52 ms 5556 KB Output is correct
33 Correct 58 ms 5560 KB Output is correct
34 Correct 63 ms 7424 KB Output is correct
35 Correct 55 ms 6836 KB Output is correct
36 Correct 46 ms 6172 KB Output is correct
37 Correct 85 ms 8232 KB Output is correct
38 Correct 73 ms 8116 KB Output is correct
39 Correct 73 ms 7996 KB Output is correct
40 Correct 72 ms 7876 KB Output is correct
41 Correct 70 ms 7848 KB Output is correct
42 Correct 54 ms 5568 KB Output is correct
43 Correct 88 ms 8132 KB Output is correct
44 Correct 85 ms 8064 KB Output is correct
45 Correct 87 ms 7876 KB Output is correct
46 Correct 83 ms 7848 KB Output is correct
47 Correct 1 ms 320 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 1 ms 212 KB Output is correct
58 Correct 1 ms 212 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 212 KB Output is correct
67 Correct 1 ms 212 KB Output is correct
68 Correct 1 ms 256 KB Output is correct
69 Correct 1 ms 224 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 324 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 3 ms 468 KB Output is correct
75 Correct 3 ms 468 KB Output is correct
76 Correct 3 ms 460 KB Output is correct
77 Correct 3 ms 468 KB Output is correct
78 Correct 2 ms 460 KB Output is correct
79 Correct 2 ms 468 KB Output is correct
80 Correct 2 ms 468 KB Output is correct
81 Correct 4 ms 596 KB Output is correct
82 Correct 5 ms 552 KB Output is correct
83 Correct 4 ms 596 KB Output is correct
84 Correct 2 ms 560 KB Output is correct
85 Correct 3 ms 596 KB Output is correct
86 Correct 4 ms 596 KB Output is correct
87 Correct 3 ms 588 KB Output is correct
88 Correct 2 ms 460 KB Output is correct
89 Correct 3 ms 556 KB Output is correct
90 Correct 3 ms 468 KB Output is correct
91 Correct 3 ms 468 KB Output is correct
92 Correct 3 ms 456 KB Output is correct
93 Correct 2 ms 468 KB Output is correct
94 Correct 2 ms 468 KB Output is correct
95 Correct 3 ms 468 KB Output is correct
96 Correct 2 ms 476 KB Output is correct
97 Correct 3 ms 468 KB Output is correct
98 Correct 3 ms 556 KB Output is correct
99 Correct 2 ms 464 KB Output is correct
100 Correct 3 ms 468 KB Output is correct
101 Correct 3 ms 588 KB Output is correct
102 Correct 3 ms 684 KB Output is correct
103 Correct 3 ms 596 KB Output is correct
104 Correct 3 ms 596 KB Output is correct
105 Correct 3 ms 596 KB Output is correct
106 Correct 3 ms 596 KB Output is correct
107 Correct 3 ms 684 KB Output is correct
108 Correct 3 ms 584 KB Output is correct
109 Correct 3 ms 596 KB Output is correct
110 Correct 2 ms 468 KB Output is correct
111 Correct 80 ms 5684 KB Output is correct
112 Correct 76 ms 5660 KB Output is correct
113 Correct 77 ms 5560 KB Output is correct
114 Correct 76 ms 5636 KB Output is correct
115 Correct 73 ms 5624 KB Output is correct
116 Correct 71 ms 5568 KB Output is correct
117 Correct 74 ms 5584 KB Output is correct
118 Correct 132 ms 10560 KB Output is correct
119 Correct 142 ms 10180 KB Output is correct
120 Correct 102 ms 7992 KB Output is correct
121 Correct 70 ms 5556 KB Output is correct
122 Correct 114 ms 8628 KB Output is correct
123 Correct 110 ms 8292 KB Output is correct
124 Correct 98 ms 7984 KB Output is correct
125 Correct 70 ms 5672 KB Output is correct
126 Correct 93 ms 6324 KB Output is correct
127 Correct 94 ms 6200 KB Output is correct
128 Correct 101 ms 6144 KB Output is correct
129 Correct 72 ms 5572 KB Output is correct
130 Correct 85 ms 5688 KB Output is correct
131 Correct 87 ms 5692 KB Output is correct
132 Correct 81 ms 5720 KB Output is correct
133 Correct 78 ms 5568 KB Output is correct
134 Correct 86 ms 5664 KB Output is correct
135 Correct 78 ms 5692 KB Output is correct
136 Correct 79 ms 5652 KB Output is correct
137 Correct 72 ms 5592 KB Output is correct
138 Correct 78 ms 5672 KB Output is correct
139 Correct 87 ms 5668 KB Output is correct
140 Correct 73 ms 5592 KB Output is correct
141 Correct 76 ms 5588 KB Output is correct
142 Correct 105 ms 10936 KB Output is correct
143 Correct 110 ms 10916 KB Output is correct
144 Correct 102 ms 10920 KB Output is correct
145 Correct 101 ms 10820 KB Output is correct
146 Correct 99 ms 10796 KB Output is correct
147 Correct 94 ms 10612 KB Output is correct
148 Correct 91 ms 10524 KB Output is correct
149 Correct 101 ms 10420 KB Output is correct
150 Correct 96 ms 10304 KB Output is correct
151 Correct 90 ms 9780 KB Output is correct
152 Correct 38 ms 5608 KB Output is correct
153 Correct 99 ms 10816 KB Output is correct
154 Correct 96 ms 10720 KB Output is correct
155 Correct 95 ms 10660 KB Output is correct
156 Correct 103 ms 10608 KB Output is correct
157 Correct 108 ms 10444 KB Output is correct
158 Correct 96 ms 10344 KB Output is correct
159 Correct 92 ms 9796 KB Output is correct
160 Correct 38 ms 5548 KB Output is correct
161 Correct 103 ms 8232 KB Output is correct
162 Correct 101 ms 8196 KB Output is correct
163 Correct 100 ms 8040 KB Output is correct
164 Correct 104 ms 7984 KB Output is correct
165 Correct 97 ms 7808 KB Output is correct
166 Correct 46 ms 5544 KB Output is correct
167 Correct 78 ms 8112 KB Output is correct
168 Correct 88 ms 8008 KB Output is correct
169 Correct 77 ms 7916 KB Output is correct
170 Correct 82 ms 7812 KB Output is correct
171 Correct 69 ms 8120 KB Output is correct
172 Correct 70 ms 8148 KB Output is correct
173 Correct 101 ms 8248 KB Output is correct
174 Correct 113 ms 8192 KB Output is correct
175 Correct 105 ms 8260 KB Output is correct
176 Correct 96 ms 7736 KB Output is correct