oj.uz

답안 #898515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
898515 2024-01-04T19:48:09 Z LucaIlie Event Hopping 2 (JOI21_event2) C++17
100 / 100
 1035 ms 32492 KB 
#include <bits/stdc++.h>

using namespace std;

struct event {
    int l, r;

    bool operator < ( const event e ) const {
        if ( l == e.l )
            return r < e.r;
        return l < e.l;
    }
};

const int MAX_N = 1e5;
const int MAX_M = 2 * MAX_N;
int bucket[MAX_M + 2], leftBucket[MAX_M + 1], rightBucket[MAX_M + 1], maxEvents[MAX_M + 1], eventRightEnd[MAX_M + 1], minR[MAX_M + 2];
event events[MAX_N + 1];
set<int> rightEnds[MAX_M + 1];
set<event> selectedEvents;
map<int, int> normal;

bool check ( event e ) {
    auto p = selectedEvents.lower_bound( e );
    if ( e.r <= p->l && (--p)->r <= e.l )
        return true;
    return false;
}

void calcBucket( int b ) {
    for ( int i = rightBucket[b]; i >= leftBucket[b]; i-- ) {
        maxEvents[i] = 0;
        eventRightEnd[i] = i;
        if ( bucket[i + 1] == b ) {
            if ( maxEvents[i + 1] > maxEvents[i] ) {
                maxEvents[i] = maxEvents[i + 1];
                eventRightEnd[i] = eventRightEnd[i + 1];
            }
        }
        if ( !rightEnds[i].empty() && bucket[*rightEnds[i].begin()] == b ) {
            if ( maxEvents[*rightEnds[i].begin()] + 1 > maxEvents[i] ) {
                maxEvents[i] = maxEvents[*rightEnds[i].begin()] + 1;
                eventRightEnd[i] = eventRightEnd[*rightEnds[i].begin()];
            } else if ( maxEvents[*rightEnds[i].begin()] + 1 == maxEvents[i] )
                eventRightEnd[i] = min( eventRightEnd[i], eventRightEnd[*rightEnds[i].begin()] );
        }
    }
}

int query( int l, int r ) {
    int nrEvents = 0;
    while ( eventRightEnd[l] <= r ) {
        nrEvents += maxEvents[l];
        l = eventRightEnd[l];
        nrEvents++;
        l = minR[l];
    }
    while ( l <= r ) {
        nrEvents++;
        l = minR[l];
    }

    return nrEvents - 1;
}

int main() {
    int n, k;

    cin >> n >> k;
    for ( int i = 1; i <= n; i++ ) {
        cin >> events[i].l >> events[i].r;
        normal[events[i].l] = 1;
        normal[events[i].r] = 1;
    }

    int m = 0;
    for ( auto p: normal )
        normal[p.first] = ++m;
    for ( int i = 1; i <= n; i++ ) {
        events[i].l = normal[events[i].l];
        events[i].r = normal[events[i].r];
        rightEnds[events[i].l].insert( events[i].r );
    }

    minR[m + 1] = m + 1;
    for ( int i = m; i >= 1; i-- )
        minR[i] = min( minR[i + 1], (!rightEnds[i].empty() ? *rightEnds[i].begin() : m + 1) );

    int bucketSize = sqrt( m ), nrBuckets = 0;
    for ( int i = 1; i <= m; i += bucketSize )  {
        nrBuckets++;
        leftBucket[nrBuckets] = i;
        rightBucket[nrBuckets] = min( i + bucketSize - 1, m );
        for ( int j = i; j < i + bucketSize && j <= m; j++ )
            bucket[j] = nrBuckets;
        calcBucket( nrBuckets );
    }
    eventRightEnd[m + 1] = m + 1;

    selectedEvents.insert( { 1, 1 } );
    selectedEvents.insert( { m, m } );
    vector<int> ans;
    int nrEvents = query( 1, m );
    for ( int i = 1; i <= n && k > 0; i++ ) {
        if ( !check( events[i] ) )
            continue;

        auto p = selectedEvents.lower_bound( events[i] );
        int r = p->l;
        p--;
        int l = p->r;

        int copyNrEvents = nrEvents;
        nrEvents -= query( l, r );
        rightEnds[events[i].l].erase( events[i].r );
        calcBucket( bucket[events[i].l] );
        nrEvents += query( l, events[i].l ) + query( events[i].r, r );

        if ( nrEvents >= k - 1 ) {
            selectedEvents.insert( events[i] );
            ans.push_back( i );
            k--;
        } else
            nrEvents = copyNrEvents;
    }

    if ( k > 0 ) {
        cout << -1;
        return 0;
    }
    for ( int i: ans )
        cout << i << "\n";

    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 2 ms 14940 KB Output is correct
3 Correct 4 ms 14940 KB Output is correct
4 Correct 586 ms 31596 KB Output is correct
5 Correct 656 ms 32204 KB Output is correct
6 Correct 594 ms 32452 KB Output is correct
7 Correct 625 ms 32492 KB Output is correct
8 Correct 620 ms 32460 KB Output is correct
9 Correct 661 ms 32268 KB Output is correct
10 Correct 567 ms 32208 KB Output is correct
11 Correct 645 ms 32212 KB Output is correct
12 Correct 422 ms 32452 KB Output is correct
13 Correct 403 ms 31956 KB Output is correct
14 Correct 400 ms 31960 KB Output is correct
15 Correct 387 ms 31700 KB Output is correct
16 Correct 225 ms 31416 KB Output is correct
17 Correct 183 ms 31316 KB Output is correct
18 Correct 181 ms 31312 KB Output is correct
19 Correct 144 ms 31316 KB Output is correct
20 Correct 134 ms 31312 KB Output is correct
21 Correct 131 ms 31572 KB Output is correct
22 Correct 137 ms 31464 KB Output is correct
23 Correct 127 ms 31212 KB Output is correct
24 Correct 151 ms 31316 KB Output is correct
25 Correct 146 ms 31252 KB Output is correct
26 Correct 141 ms 31308 KB Output is correct
27 Correct 141 ms 31312 KB Output is correct
28 Correct 582 ms 32216 KB Output is correct
29 Correct 409 ms 31640 KB Output is correct
30 Correct 201 ms 31428 KB Output is correct
31 Correct 174 ms 31320 KB Output is correct
32 Correct 516 ms 31312 KB Output is correct
33 Correct 233 ms 31312 KB Output is correct
34 Correct 378 ms 31876 KB Output is correct
35 Correct 288 ms 31460 KB Output is correct
36 Correct 212 ms 31320 KB Output is correct
37 Correct 330 ms 31696 KB Output is correct
38 Correct 330 ms 31704 KB Output is correct
39 Correct 332 ms 31900 KB Output is correct
40 Correct 333 ms 31700 KB Output is correct
41 Correct 320 ms 31852 KB Output is correct
42 Correct 418 ms 31572 KB Output is correct
43 Correct 361 ms 31952 KB Output is correct
44 Correct 379 ms 31696 KB Output is correct
45 Correct 350 ms 31728 KB Output is correct
46 Correct 334 ms 31860 KB Output is correct

Subtask #2
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14940 KB Output is correct
2 Correct 2 ms 14936 KB Output is correct
3 Correct 3 ms 14972 KB Output is correct
4 Correct 2 ms 14940 KB Output is correct
5 Correct 2 ms 14936 KB Output is correct
6 Correct 2 ms 14936 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 2 ms 14940 KB Output is correct
9 Correct 2 ms 14968 KB Output is correct
10 Correct 2 ms 14940 KB Output is correct
11 Correct 2 ms 14988 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 2 ms 14964 KB Output is correct
14 Correct 2 ms 14940 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 3 ms 14940 KB Output is correct
17 Correct 3 ms 14936 KB Output is correct
18 Correct 3 ms 14936 KB Output is correct
19 Correct 3 ms 14948 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 3 ms 14936 KB Output is correct
22 Correct 3 ms 14936 KB Output is correct
23 Correct 2 ms 14940 KB Output is correct
24 Correct 3 ms 14940 KB Output is correct
25 Correct 3 ms 14940 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 3 ms 14940 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14940 KB Output is correct
2 Correct 2 ms 14936 KB Output is correct
3 Correct 3 ms 14972 KB Output is correct
4 Correct 2 ms 14940 KB Output is correct
5 Correct 2 ms 14936 KB Output is correct
6 Correct 2 ms 14936 KB Output is correct
7 Correct 3 ms 14940 KB Output is correct
8 Correct 2 ms 14940 KB Output is correct
9 Correct 2 ms 14968 KB Output is correct
10 Correct 2 ms 14940 KB Output is correct
11 Correct 2 ms 14988 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 2 ms 14964 KB Output is correct
14 Correct 2 ms 14940 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 3 ms 14940 KB Output is correct
17 Correct 3 ms 14936 KB Output is correct
18 Correct 3 ms 14936 KB Output is correct
19 Correct 3 ms 14948 KB Output is correct
20 Correct 3 ms 14940 KB Output is correct
21 Correct 3 ms 14936 KB Output is correct
22 Correct 3 ms 14936 KB Output is correct
23 Correct 2 ms 14940 KB Output is correct
24 Correct 3 ms 14940 KB Output is correct
25 Correct 3 ms 14940 KB Output is correct
26 Correct 3 ms 14940 KB Output is correct
27 Correct 3 ms 14940 KB Output is correct
28 Correct 7 ms 15452 KB Output is correct
29 Correct 6 ms 15440 KB Output is correct
30 Correct 7 ms 15448 KB Output is correct
31 Correct 6 ms 15452 KB Output is correct
32 Correct 6 ms 15300 KB Output is correct
33 Correct 8 ms 15452 KB Output is correct
34 Correct 10 ms 15324 KB Output is correct
35 Correct 8 ms 15448 KB Output is correct
36 Correct 10 ms 15452 KB Output is correct
37 Correct 8 ms 15452 KB Output is correct
38 Correct 9 ms 15452 KB Output is correct
39 Correct 8 ms 15704 KB Output is correct
40 Correct 8 ms 15452 KB Output is correct
41 Correct 8 ms 15448 KB Output is correct
42 Correct 8 ms 15452 KB Output is correct
43 Correct 7 ms 15456 KB Output is correct
44 Correct 7 ms 15452 KB Output is correct
45 Correct 8 ms 15452 KB Output is correct
46 Correct 7 ms 15452 KB Output is correct
47 Correct 7 ms 15452 KB Output is correct
48 Correct 7 ms 15452 KB Output is correct
49 Correct 7 ms 15236 KB Output is correct
50 Correct 8 ms 15304 KB Output is correct
51 Correct 6 ms 15452 KB Output is correct
52 Correct 7 ms 15452 KB Output is correct
53 Correct 7 ms 15452 KB Output is correct
54 Correct 9 ms 15452 KB Output is correct
55 Correct 7 ms 15204 KB Output is correct
56 Correct 8 ms 15452 KB Output is correct
57 Correct 7 ms 15196 KB Output is correct
58 Correct 9 ms 15196 KB Output is correct
59 Correct 7 ms 15192 KB Output is correct
60 Correct 8 ms 15196 KB Output is correct
61 Correct 7 ms 15192 KB Output is correct
62 Correct 6 ms 15196 KB Output is correct
63 Correct 6 ms 15196 KB Output is correct
64 Correct 6 ms 15196 KB Output is correct

Subtask #4
61.0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14940 KB Output is correct
2 Correct 2 ms 14940 KB Output is correct
3 Correct 4 ms 14940 KB Output is correct
4 Correct 586 ms 31596 KB Output is correct
5 Correct 656 ms 32204 KB Output is correct
6 Correct 594 ms 32452 KB Output is correct
7 Correct 625 ms 32492 KB Output is correct
8 Correct 620 ms 32460 KB Output is correct
9 Correct 661 ms 32268 KB Output is correct
10 Correct 567 ms 32208 KB Output is correct
11 Correct 645 ms 32212 KB Output is correct
12 Correct 422 ms 32452 KB Output is correct
13 Correct 403 ms 31956 KB Output is correct
14 Correct 400 ms 31960 KB Output is correct
15 Correct 387 ms 31700 KB Output is correct
16 Correct 225 ms 31416 KB Output is correct
17 Correct 183 ms 31316 KB Output is correct
18 Correct 181 ms 31312 KB Output is correct
19 Correct 144 ms 31316 KB Output is correct
20 Correct 134 ms 31312 KB Output is correct
21 Correct 131 ms 31572 KB Output is correct
22 Correct 137 ms 31464 KB Output is correct
23 Correct 127 ms 31212 KB Output is correct
24 Correct 151 ms 31316 KB Output is correct
25 Correct 146 ms 31252 KB Output is correct
26 Correct 141 ms 31308 KB Output is correct
27 Correct 141 ms 31312 KB Output is correct
28 Correct 582 ms 32216 KB Output is correct
29 Correct 409 ms 31640 KB Output is correct
30 Correct 201 ms 31428 KB Output is correct
31 Correct 174 ms 31320 KB Output is correct
32 Correct 516 ms 31312 KB Output is correct
33 Correct 233 ms 31312 KB Output is correct
34 Correct 378 ms 31876 KB Output is correct
35 Correct 288 ms 31460 KB Output is correct
36 Correct 212 ms 31320 KB Output is correct
37 Correct 330 ms 31696 KB Output is correct
38 Correct 330 ms 31704 KB Output is correct
39 Correct 332 ms 31900 KB Output is correct
40 Correct 333 ms 31700 KB Output is correct
41 Correct 320 ms 31852 KB Output is correct
42 Correct 418 ms 31572 KB Output is correct
43 Correct 361 ms 31952 KB Output is correct
44 Correct 379 ms 31696 KB Output is correct
45 Correct 350 ms 31728 KB Output is correct
46 Correct 334 ms 31860 KB Output is correct
47 Correct 3 ms 14940 KB Output is correct
48 Correct 2 ms 14936 KB Output is correct
49 Correct 3 ms 14972 KB Output is correct
50 Correct 2 ms 14940 KB Output is correct
51 Correct 2 ms 14936 KB Output is correct
52 Correct 2 ms 14936 KB Output is correct
53 Correct 3 ms 14940 KB Output is correct
54 Correct 2 ms 14940 KB Output is correct
55 Correct 2 ms 14968 KB Output is correct
56 Correct 2 ms 14940 KB Output is correct
57 Correct 2 ms 14988 KB Output is correct
58 Correct 3 ms 14940 KB Output is correct
59 Correct 2 ms 14964 KB Output is correct
60 Correct 2 ms 14940 KB Output is correct
61 Correct 3 ms 14940 KB Output is correct
62 Correct 3 ms 14940 KB Output is correct
63 Correct 3 ms 14936 KB Output is correct
64 Correct 3 ms 14936 KB Output is correct
65 Correct 3 ms 14948 KB Output is correct
66 Correct 3 ms 14940 KB Output is correct
67 Correct 3 ms 14936 KB Output is correct
68 Correct 3 ms 14936 KB Output is correct
69 Correct 2 ms 14940 KB Output is correct
70 Correct 3 ms 14940 KB Output is correct
71 Correct 3 ms 14940 KB Output is correct
72 Correct 3 ms 14940 KB Output is correct
73 Correct 3 ms 14940 KB Output is correct
74 Correct 7 ms 15452 KB Output is correct
75 Correct 6 ms 15440 KB Output is correct
76 Correct 7 ms 15448 KB Output is correct
77 Correct 6 ms 15452 KB Output is correct
78 Correct 6 ms 15300 KB Output is correct
79 Correct 8 ms 15452 KB Output is correct
80 Correct 10 ms 15324 KB Output is correct
81 Correct 8 ms 15448 KB Output is correct
82 Correct 10 ms 15452 KB Output is correct
83 Correct 8 ms 15452 KB Output is correct
84 Correct 9 ms 15452 KB Output is correct
85 Correct 8 ms 15704 KB Output is correct
86 Correct 8 ms 15452 KB Output is correct
87 Correct 8 ms 15448 KB Output is correct
88 Correct 8 ms 15452 KB Output is correct
89 Correct 7 ms 15456 KB Output is correct
90 Correct 7 ms 15452 KB Output is correct
91 Correct 8 ms 15452 KB Output is correct
92 Correct 7 ms 15452 KB Output is correct
93 Correct 7 ms 15452 KB Output is correct
94 Correct 7 ms 15452 KB Output is correct
95 Correct 7 ms 15236 KB Output is correct
96 Correct 8 ms 15304 KB Output is correct
97 Correct 6 ms 15452 KB Output is correct
98 Correct 7 ms 15452 KB Output is correct
99 Correct 7 ms 15452 KB Output is correct
100 Correct 9 ms 15452 KB Output is correct
101 Correct 7 ms 15204 KB Output is correct
102 Correct 8 ms 15452 KB Output is correct
103 Correct 7 ms 15196 KB Output is correct
104 Correct 9 ms 15196 KB Output is correct
105 Correct 7 ms 15192 KB Output is correct
106 Correct 8 ms 15196 KB Output is correct
107 Correct 7 ms 15192 KB Output is correct
108 Correct 6 ms 15196 KB Output is correct
109 Correct 6 ms 15196 KB Output is correct
110 Correct 6 ms 15196 KB Output is correct
111 Correct 210 ms 31072 KB Output is correct
112 Correct 217 ms 31064 KB Output is correct
113 Correct 245 ms 31316 KB Output is correct
114 Correct 200 ms 31316 KB Output is correct
115 Correct 204 ms 31224 KB Output is correct
116 Correct 1035 ms 31300 KB Output is correct
117 Correct 887 ms 31384 KB Output is correct
118 Correct 449 ms 32308 KB Output is correct
119 Correct 482 ms 32484 KB Output is correct
120 Correct 381 ms 31712 KB Output is correct
121 Correct 463 ms 31680 KB Output is correct
122 Correct 485 ms 31960 KB Output is correct
123 Correct 397 ms 31888 KB Output is correct
124 Correct 366 ms 31668 KB Output is correct
125 Correct 437 ms 31588 KB Output is correct
126 Correct 310 ms 31324 KB Output is correct
127 Correct 288 ms 31312 KB Output is correct
128 Correct 259 ms 31316 KB Output is correct
129 Correct 344 ms 31568 KB Output is correct
130 Correct 270 ms 31188 KB Output is correct
131 Correct 234 ms 31316 KB Output is correct
132 Correct 213 ms 31304 KB Output is correct
133 Correct 297 ms 31308 KB Output is correct
134 Correct 247 ms 31464 KB Output is correct
135 Correct 236 ms 31260 KB Output is correct
136 Correct 203 ms 31072 KB Output is correct
137 Correct 809 ms 31312 KB Output is correct
138 Correct 223 ms 31232 KB Output is correct
139 Correct 211 ms 31312 KB Output is correct
140 Correct 199 ms 31316 KB Output is correct
141 Correct 470 ms 31320 KB Output is correct
142 Correct 359 ms 27340 KB Output is correct
143 Correct 370 ms 27232 KB Output is correct
144 Correct 366 ms 27336 KB Output is correct
145 Correct 337 ms 27340 KB Output is correct
146 Correct 340 ms 27336 KB Output is correct
147 Correct 333 ms 27336 KB Output is correct
148 Correct 337 ms 27340 KB Output is correct
149 Correct 329 ms 27344 KB Output is correct
150 Correct 335 ms 27336 KB Output is correct
151 Correct 307 ms 27008 KB Output is correct
152 Correct 338 ms 26828 KB Output is correct
153 Correct 343 ms 27308 KB Output is correct
154 Correct 348 ms 27148 KB Output is correct
155 Correct 334 ms 27160 KB Output is correct
156 Correct 349 ms 27176 KB Output is correct
157 Correct 329 ms 27084 KB Output is correct
158 Correct 341 ms 27104 KB Output is correct
159 Correct 324 ms 27180 KB Output is correct
160 Correct 342 ms 26832 KB Output is correct
161 Correct 293 ms 29244 KB Output is correct
162 Correct 291 ms 29352 KB Output is correct
163 Correct 280 ms 29652 KB Output is correct
164 Correct 336 ms 29140 KB Output is correct
165 Correct 260 ms 29128 KB Output is correct
166 Correct 373 ms 31564 KB Output is correct
167 Correct 364 ms 32064 KB Output is correct
168 Correct 343 ms 31648 KB Output is correct
169 Correct 322 ms 31688 KB Output is correct
170 Correct 309 ms 31640 KB Output is correct
171 Correct 311 ms 31204 KB Output is correct
172 Correct 326 ms 31940 KB Output is correct
173 Correct 319 ms 26732 KB Output is correct
174 Correct 295 ms 26920 KB Output is correct
175 Correct 274 ms 26828 KB Output is correct
176 Correct 255 ms 27132 KB Output is correct