oj.uz

Submission #590143

# Submission time Handle Problem Language Result Execution time Memory
590143 2022-07-05T14:54:20 Z lordlorinc Event Hopping 2 (JOI21_event2) C++17
100 / 100
 245 ms 23284 KB 
#include <bits/stdc++.h>

using namespace std;

int n, k;
vector<pair<pair<int, int>, int> > sor, events;
vector<vector<int> > nexts;
set<pair<pair<int, int>, int> > inter;
vector<int> eventidTosorid, soridToeventid;

int count(int l, int r){
    std::set<std::pair<std::pair<int, int>, int>>::iterator pos = inter.upper_bound(make_pair(make_pair(r, -1), -1));
    pos--;
    int ind = pos -> second;
    // cout << ind << endl;
    int db = 1, i = 0, res = 0;
    while (true){
        if (nexts[ind][i] == -1) break;
        if (sor[nexts[ind][i]].first.first > r) break;
        i++;
        db <<= 1;
    }
    // cout << db << endl;
    while (i >= 0){
        if (nexts[ind][i] == -1){
            i--;
            db >>= 1;
            continue;
        }
        if (sor[nexts[ind][i]].first.first <= r){
            res += db;
            ind = nexts[ind][i];
        }
        i--;
        db >>= 1;
    }
    // cout << l << " " << r << " " << res << endl;
    return res;
}


int main(){

    cin >> n >> k;
    sor.resize(n);
    events.resize(n);
    for (int i = 0; i < n; i++){
        int a, b; 
        cin >> a >> b;
        sor[i] = make_pair(make_pair(b, a), i);
        events[i] = make_pair(make_pair(a, b), i);
    }
    sor.push_back(make_pair(make_pair(0, -1), n));
    sor.push_back(make_pair(make_pair(1e9 + 2, 1e9 + 1), n + 1));

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


    eventidTosorid.assign(n + 2, 0);
    soridToeventid.assign(n + 2, 0);
    for (int i = 0; i < n + 2; i++){
        soridToeventid[i] = sor[i].second;
        eventidTosorid[sor[i].second] = i;
    }

    nexts.assign(n + 2, vector<int> (int(log2(n + 2)) + 2, -1));
    int l = 0;
    for (int i = 1; i < n + 2; i++){
        while (sor[l].first.first <= sor[i].first.second){
            nexts[l][0] = i;
            l++;
        }
    }
    // for (int i = 0; i < n + 2; i++){
    //     cout << sor[i].first.first << " " << sor[i].first.second << " " << sor[i].second << endl;
    // }
    // for (int i = 0; i < n + 2; i++){
    //     cout << nexts[i][0] << " ";
    // }
    // cout << endl;

    for (int i = 1; i < nexts[0].size(); i++){
        for (int j = 0; j < n + 2; j++){
            if (nexts[j][i - 1] == -1) continue;
            nexts[j][i] = nexts[nexts[j][i - 1]][i - 1];
        }
    }

    // for (int i = 0; i < n + 2; i++){
    //     cout << nexts[i][0] << " ";
    // }
    // cout << endl;
    // for (int i = 0; i < n + 2; i++){
    //     cout << nexts[i][1] << " ";
    // }
    // cout << endl;
    // for (int i = 0; i < n + 2; i++){
    //     cout << nexts[i][2] << " ";
    // }
    // cout << endl;
    // for (int i = 0; i < n + 2; i++){
    //     cout << nexts[i][2] << " ";
    // }
    // cout << endl;
    // cout << nexts[0].size() << endl;

    inter.insert(make_pair(make_pair(-1, 0), eventidTosorid[n]));
    inter.insert(make_pair(make_pair(1e9 + 1, 1e9 + 2), eventidTosorid[n + 1]));

    int db = count(0, 1e9);
    // cout << "db: " << db << endl;
    if (db < k){
        cout << -1 << endl;
        return 0;
    }

    for (int i = 0; i < n; i++){
        std::set<std::pair<std::pair<int, int>, int>>::iterator it = inter.upper_bound(make_pair(make_pair(events[i].first.second, -1), -1));
        int nextPos = it -> second;
        it--;
        int prevPos = it -> second;
        if (sor[prevPos].first.first > events[i].first.first) continue;
        // cout << "IND: " << i << endl;
        int a = count(sor[prevPos].first.first, sor[nextPos].first.second);
            inter.insert(make_pair(events[i].first, eventidTosorid[i]));
        int b = count(sor[prevPos].first.first, events[i].first.first);
        int c = count (events[i].first.second, sor[nextPos].first.second);
        if (db - a + b + c + 1 >= k){
            db = db - a + b + c + 1;
        }
        else inter.erase(make_pair(events[i].first, eventidTosorid[i]));
        if (inter.size() == k + 2) break;
    }

    vector<int> mo;
    for (auto x : inter){
        if (soridToeventid[x.second] < n){
            mo.push_back(soridToeventid[x.second]);
        }
    }
    sort(mo.begin(), mo.end());
    for (int x : mo) cout << x + 1 << "\n";

    return 0;
}

/*

4 3
1 4
3 5
4 9
7 10

*/

Compilation message

event2.cpp: In function 'int main()':
event2.cpp:82:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |     for (int i = 1; i < nexts[0].size(); i++){
      |                     ~~^~~~~~~~~~~~~~~~~
event2.cpp:132:26: warning: comparison of integer expressions of different signedness: 'std::set<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  132 |         if (inter.size() == k + 2) break;
      |             ~~~~~~~~~~~~~^~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 217 ms 22704 KB Output is correct
5 Correct 210 ms 22356 KB Output is correct
6 Correct 227 ms 22008 KB Output is correct
7 Correct 191 ms 21332 KB Output is correct
8 Correct 210 ms 22768 KB Output is correct
9 Correct 206 ms 22316 KB Output is correct
10 Correct 208 ms 22084 KB Output is correct
11 Correct 210 ms 21428 KB Output is correct
12 Correct 160 ms 19876 KB Output is correct
13 Correct 188 ms 19620 KB Output is correct
14 Correct 210 ms 19504 KB Output is correct
15 Correct 149 ms 19148 KB Output is correct
16 Correct 127 ms 16428 KB Output is correct
17 Correct 140 ms 16424 KB Output is correct
18 Correct 126 ms 16300 KB Output is correct
19 Correct 102 ms 15540 KB Output is correct
20 Correct 109 ms 15532 KB Output is correct
21 Correct 124 ms 15532 KB Output is correct
22 Correct 130 ms 15508 KB Output is correct
23 Correct 99 ms 15540 KB Output is correct
24 Correct 105 ms 15528 KB Output is correct
25 Correct 109 ms 15528 KB Output is correct
26 Correct 106 ms 15548 KB Output is correct
27 Correct 96 ms 15532 KB Output is correct
28 Correct 97 ms 15536 KB Output is correct
29 Correct 99 ms 15452 KB Output is correct
30 Correct 116 ms 15536 KB Output is correct
31 Correct 102 ms 15416 KB Output is correct
32 Correct 96 ms 15544 KB Output is correct
33 Correct 102 ms 15524 KB Output is correct
34 Correct 167 ms 18216 KB Output is correct
35 Correct 129 ms 17200 KB Output is correct
36 Correct 120 ms 16340 KB Output is correct
37 Correct 194 ms 19364 KB Output is correct
38 Correct 192 ms 19308 KB Output is correct
39 Correct 170 ms 19108 KB Output is correct
40 Correct 178 ms 18944 KB Output is correct
41 Correct 164 ms 18800 KB Output is correct
42 Correct 115 ms 15416 KB Output is correct
43 Correct 170 ms 19240 KB Output is correct
44 Correct 191 ms 19076 KB Output is correct
45 Correct 162 ms 18968 KB Output is correct
46 Correct 159 ms 18828 KB Output is correct

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 1 ms 304 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 0 ms 296 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 296 KB Output is correct
16 Correct 0 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 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 304 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 300 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 1 ms 304 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 0 ms 296 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 296 KB Output is correct
16 Correct 0 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 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 4 ms 596 KB Output is correct
29 Correct 4 ms 696 KB Output is correct
30 Correct 5 ms 724 KB Output is correct
31 Correct 4 ms 596 KB Output is correct
32 Correct 4 ms 596 KB Output is correct
33 Correct 6 ms 684 KB Output is correct
34 Correct 5 ms 684 KB Output is correct
35 Correct 9 ms 824 KB Output is correct
36 Correct 8 ms 852 KB Output is correct
37 Correct 5 ms 824 KB Output is correct
38 Correct 4 ms 596 KB Output is correct
39 Correct 6 ms 852 KB Output is correct
40 Correct 6 ms 884 KB Output is correct
41 Correct 5 ms 820 KB Output is correct
42 Correct 5 ms 596 KB Output is correct
43 Correct 4 ms 724 KB Output is correct
44 Correct 4 ms 724 KB Output is correct
45 Correct 6 ms 724 KB Output is correct
46 Correct 4 ms 724 KB Output is correct
47 Correct 4 ms 724 KB Output is correct
48 Correct 4 ms 724 KB Output is correct
49 Correct 4 ms 700 KB Output is correct
50 Correct 4 ms 596 KB Output is correct
51 Correct 5 ms 596 KB Output is correct
52 Correct 4 ms 596 KB Output is correct
53 Correct 4 ms 596 KB Output is correct
54 Correct 4 ms 596 KB Output is correct
55 Correct 5 ms 852 KB Output is correct
56 Correct 6 ms 852 KB Output is correct
57 Correct 5 ms 852 KB Output is correct
58 Correct 6 ms 852 KB Output is correct
59 Correct 5 ms 808 KB Output is correct
60 Correct 4 ms 852 KB Output is correct
61 Correct 6 ms 852 KB Output is correct
62 Correct 5 ms 852 KB Output is correct
63 Correct 5 ms 852 KB Output is correct
64 Correct 3 ms 596 KB Output is correct

Subtask #4
61.0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 217 ms 22704 KB Output is correct
5 Correct 210 ms 22356 KB Output is correct
6 Correct 227 ms 22008 KB Output is correct
7 Correct 191 ms 21332 KB Output is correct
8 Correct 210 ms 22768 KB Output is correct
9 Correct 206 ms 22316 KB Output is correct
10 Correct 208 ms 22084 KB Output is correct
11 Correct 210 ms 21428 KB Output is correct
12 Correct 160 ms 19876 KB Output is correct
13 Correct 188 ms 19620 KB Output is correct
14 Correct 210 ms 19504 KB Output is correct
15 Correct 149 ms 19148 KB Output is correct
16 Correct 127 ms 16428 KB Output is correct
17 Correct 140 ms 16424 KB Output is correct
18 Correct 126 ms 16300 KB Output is correct
19 Correct 102 ms 15540 KB Output is correct
20 Correct 109 ms 15532 KB Output is correct
21 Correct 124 ms 15532 KB Output is correct
22 Correct 130 ms 15508 KB Output is correct
23 Correct 99 ms 15540 KB Output is correct
24 Correct 105 ms 15528 KB Output is correct
25 Correct 109 ms 15528 KB Output is correct
26 Correct 106 ms 15548 KB Output is correct
27 Correct 96 ms 15532 KB Output is correct
28 Correct 97 ms 15536 KB Output is correct
29 Correct 99 ms 15452 KB Output is correct
30 Correct 116 ms 15536 KB Output is correct
31 Correct 102 ms 15416 KB Output is correct
32 Correct 96 ms 15544 KB Output is correct
33 Correct 102 ms 15524 KB Output is correct
34 Correct 167 ms 18216 KB Output is correct
35 Correct 129 ms 17200 KB Output is correct
36 Correct 120 ms 16340 KB Output is correct
37 Correct 194 ms 19364 KB Output is correct
38 Correct 192 ms 19308 KB Output is correct
39 Correct 170 ms 19108 KB Output is correct
40 Correct 178 ms 18944 KB Output is correct
41 Correct 164 ms 18800 KB Output is correct
42 Correct 115 ms 15416 KB Output is correct
43 Correct 170 ms 19240 KB Output is correct
44 Correct 191 ms 19076 KB Output is correct
45 Correct 162 ms 18968 KB Output is correct
46 Correct 159 ms 18828 KB Output is correct
47 Correct 1 ms 304 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 0 ms 300 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 300 KB Output is correct
53 Correct 2 ms 212 KB Output is correct
54 Correct 1 ms 304 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 0 ms 296 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 296 KB Output is correct
62 Correct 0 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 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 1 ms 212 KB Output is correct
73 Correct 1 ms 212 KB Output is correct
74 Correct 4 ms 596 KB Output is correct
75 Correct 4 ms 696 KB Output is correct
76 Correct 5 ms 724 KB Output is correct
77 Correct 4 ms 596 KB Output is correct
78 Correct 4 ms 596 KB Output is correct
79 Correct 6 ms 684 KB Output is correct
80 Correct 5 ms 684 KB Output is correct
81 Correct 9 ms 824 KB Output is correct
82 Correct 8 ms 852 KB Output is correct
83 Correct 5 ms 824 KB Output is correct
84 Correct 4 ms 596 KB Output is correct
85 Correct 6 ms 852 KB Output is correct
86 Correct 6 ms 884 KB Output is correct
87 Correct 5 ms 820 KB Output is correct
88 Correct 5 ms 596 KB Output is correct
89 Correct 4 ms 724 KB Output is correct
90 Correct 4 ms 724 KB Output is correct
91 Correct 6 ms 724 KB Output is correct
92 Correct 4 ms 724 KB Output is correct
93 Correct 4 ms 724 KB Output is correct
94 Correct 4 ms 724 KB Output is correct
95 Correct 4 ms 700 KB Output is correct
96 Correct 4 ms 596 KB Output is correct
97 Correct 5 ms 596 KB Output is correct
98 Correct 4 ms 596 KB Output is correct
99 Correct 4 ms 596 KB Output is correct
100 Correct 4 ms 596 KB Output is correct
101 Correct 5 ms 852 KB Output is correct
102 Correct 6 ms 852 KB Output is correct
103 Correct 5 ms 852 KB Output is correct
104 Correct 6 ms 852 KB Output is correct
105 Correct 5 ms 808 KB Output is correct
106 Correct 4 ms 852 KB Output is correct
107 Correct 6 ms 852 KB Output is correct
108 Correct 5 ms 852 KB Output is correct
109 Correct 5 ms 852 KB Output is correct
110 Correct 3 ms 596 KB Output is correct
111 Correct 120 ms 15656 KB Output is correct
112 Correct 110 ms 15664 KB Output is correct
113 Correct 109 ms 15520 KB Output is correct
114 Correct 104 ms 15528 KB Output is correct
115 Correct 113 ms 15536 KB Output is correct
116 Correct 105 ms 15544 KB Output is correct
117 Correct 101 ms 15528 KB Output is correct
118 Correct 232 ms 22796 KB Output is correct
119 Correct 245 ms 22056 KB Output is correct
120 Correct 171 ms 19120 KB Output is correct
121 Correct 108 ms 15416 KB Output is correct
122 Correct 198 ms 19944 KB Output is correct
123 Correct 187 ms 19496 KB Output is correct
124 Correct 200 ms 18980 KB Output is correct
125 Correct 123 ms 15532 KB Output is correct
126 Correct 152 ms 16428 KB Output is correct
127 Correct 146 ms 16424 KB Output is correct
128 Correct 129 ms 16348 KB Output is correct
129 Correct 110 ms 15528 KB Output is correct
130 Correct 131 ms 15660 KB Output is correct
131 Correct 118 ms 15532 KB Output is correct
132 Correct 121 ms 15616 KB Output is correct
133 Correct 111 ms 15532 KB Output is correct
134 Correct 118 ms 15524 KB Output is correct
135 Correct 114 ms 15548 KB Output is correct
136 Correct 119 ms 15540 KB Output is correct
137 Correct 107 ms 15536 KB Output is correct
138 Correct 110 ms 15536 KB Output is correct
139 Correct 108 ms 15464 KB Output is correct
140 Correct 110 ms 15524 KB Output is correct
141 Correct 105 ms 15532 KB Output is correct
142 Correct 206 ms 23280 KB Output is correct
143 Correct 204 ms 23264 KB Output is correct
144 Correct 206 ms 23284 KB Output is correct
145 Correct 186 ms 23208 KB Output is correct
146 Correct 167 ms 22964 KB Output is correct
147 Correct 167 ms 22884 KB Output is correct
148 Correct 170 ms 22832 KB Output is correct
149 Correct 174 ms 22648 KB Output is correct
150 Correct 162 ms 22408 KB Output is correct
151 Correct 153 ms 21676 KB Output is correct
152 Correct 101 ms 15528 KB Output is correct
153 Correct 185 ms 23220 KB Output is correct
154 Correct 164 ms 23064 KB Output is correct
155 Correct 174 ms 22924 KB Output is correct
156 Correct 202 ms 22824 KB Output is correct
157 Correct 160 ms 22680 KB Output is correct
158 Correct 169 ms 22452 KB Output is correct
159 Correct 168 ms 21808 KB Output is correct
160 Correct 107 ms 15416 KB Output is correct
161 Correct 178 ms 19372 KB Output is correct
162 Correct 174 ms 19264 KB Output is correct
163 Correct 169 ms 19112 KB Output is correct
164 Correct 162 ms 18856 KB Output is correct
165 Correct 159 ms 18816 KB Output is correct
166 Correct 106 ms 15444 KB Output is correct
167 Correct 174 ms 19236 KB Output is correct
168 Correct 159 ms 19112 KB Output is correct
169 Correct 161 ms 18904 KB Output is correct
170 Correct 158 ms 18740 KB Output is correct
171 Correct 130 ms 18720 KB Output is correct
172 Correct 154 ms 19544 KB Output is correct
173 Correct 190 ms 19368 KB Output is correct
174 Correct 207 ms 19308 KB Output is correct
175 Correct 190 ms 19252 KB Output is correct
176 Correct 161 ms 18600 KB Output is correct