oj.uz

Submission #898465

# Submission time Handle Problem Language Result Execution time Memory
898465 2024-01-04T17:15:00 Z LucaIlie Event Hopping 2 (JOI21_event2) C++17
32 / 100
 3000 ms 3520 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_VAL = 1e9 + 1;
event events[MAX_N + 1];
set<event> selectedEvents;

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

int main() {
    int n, k;

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

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

        selectedEvents.insert( events[i] );
        vector<event> queryEvents;
        for ( int j = i + 1; j <= n; j++ ) {
            if ( check( events[j] ) )
                queryEvents.push_back( events[j] );
        }
        sort( queryEvents.begin(), queryEvents.end(), []( event a, event b ) {
            if ( a.r == b.r )
                return a.l < b.l;
            return a.r < b.r;
        } );

        int x = 0, t = 0;
        for ( event e: queryEvents ) {
            if ( e.l >= t ) {
                x++;
                t = e.r;
            }
        }
        if ( x >= k - 1 ) {
            ans.push_back( i );
            k--;
        } else
            selectedEvents.erase( events[i] );
    }

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

    return 0;
}

Subtask #1
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 1 ms 348 KB Output is correct
4 Execution timed out 3078 ms 3520 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 344 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 0 ms 448 KB Output is correct
15 Correct 1 ms 344 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 344 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 1 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 0 ms 344 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 344 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 0 ms 448 KB Output is correct
15 Correct 1 ms 344 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 344 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 1 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 0 ms 344 KB Output is correct
28 Correct 13 ms 348 KB Output is correct
29 Correct 12 ms 512 KB Output is correct
30 Correct 7 ms 348 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 2 ms 348 KB Output is correct
33 Correct 111 ms 564 KB Output is correct
34 Correct 109 ms 560 KB Output is correct
35 Correct 432 ms 580 KB Output is correct
36 Correct 421 ms 852 KB Output is correct
37 Correct 341 ms 592 KB Output is correct
38 Correct 248 ms 592 KB Output is correct
39 Correct 361 ms 576 KB Output is correct
40 Correct 366 ms 636 KB Output is correct
41 Correct 351 ms 608 KB Output is correct
42 Correct 253 ms 564 KB Output is correct
43 Correct 168 ms 576 KB Output is correct
44 Correct 129 ms 344 KB Output is correct
45 Correct 122 ms 344 KB Output is correct
46 Correct 252 ms 568 KB Output is correct
47 Correct 66 ms 344 KB Output is correct
48 Correct 37 ms 588 KB Output is correct
49 Correct 18 ms 348 KB Output is correct
50 Correct 271 ms 564 KB Output is correct
51 Correct 49 ms 348 KB Output is correct
52 Correct 30 ms 572 KB Output is correct
53 Correct 5 ms 344 KB Output is correct
54 Correct 218 ms 348 KB Output is correct
55 Correct 134 ms 616 KB Output is correct
56 Correct 134 ms 616 KB Output is correct
57 Correct 134 ms 604 KB Output is correct
58 Correct 134 ms 652 KB Output is correct
59 Correct 136 ms 624 KB Output is correct
60 Correct 134 ms 600 KB Output is correct
61 Correct 132 ms 620 KB Output is correct
62 Correct 139 ms 600 KB Output is correct
63 Correct 129 ms 596 KB Output is correct
64 Correct 80 ms 348 KB Output is correct

Subtask #4
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 1 ms 348 KB Output is correct
4 Execution timed out 3078 ms 3520 KB Time limit exceeded
5 Halted 0 ms 0 KB -