oj.uz

Submission #417031

# Submission time Handle Problem Language Result Execution time Memory
417031 2021-06-03T10:46:48 Z lyc Event Hopping 2 (JOI21_event2) C++14
32 / 100
 3000 ms 5156 KB 
#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
typedef long long ll;
typedef pair<int,int> ii;

const int mxN = 1e5+5;
const int mxK = 1e5+5;

int N, K;
struct Event { int L, R, I; };
vector<Event> events, byR;
int dp[mxN], used[mxN], ans[mxK];

int solve(int lb, int rb) {
    int ret = 0, ep = -1;
    for (auto& e : byR) if (lb <= e.L && e.R <= rb) {
        if (e.L >= ep) {
            ++ret;
            ep = e.R;
        }
    }

    return ret;
}

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

    cin >> N >> K;
    FOR(i,1,N){
        int L, R; cin >> L >> R;
        events.push_back({L,R,i});
        byR.push_back({L,R,i});
    }
    sort(ALL(byR), [&](Event a, Event b){ return a.R < b.R; });

    set<ii> cur;
    cur.insert(ii(-1,-1));
    cur.insert(ii(1e9+5,1e9+5));
    ll take = solve(-1,1e9+5);
    for (auto& e : events) {
        auto it = cur.lower_bound(ii(e.L, 0));
        if (e.R > it->first) continue;
        if (prev(it)->second > e.L) continue;

        ll take2 = take;
        take2 -= solve(prev(it)->second, it->first);
        take2 += solve(prev(it)->second, e.L);
        take2 += solve(e.R, it->first);
        take2 += 1;

        if (take2 >= K) {
            cur.insert(ii(e.L,e.R));
            take = take2;
            used[e.I] = 1;
        }

        if (SZ(cur)-2 >= K) break;
    }

    if (SZ(cur)-2 < K) {
        cout << -1 << '\n';
    }

    FOR(i,1,N) if (used[i] && K) {
        cout << i << '\n';
        --K;
    }
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Execution timed out 3045 ms 5156 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #2
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 236 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 236 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 7 ms 460 KB Output is correct
29 Correct 7 ms 460 KB Output is correct
30 Correct 4 ms 460 KB Output is correct
31 Correct 3 ms 460 KB Output is correct
32 Correct 2 ms 460 KB Output is correct
33 Correct 41 ms 460 KB Output is correct
34 Correct 40 ms 460 KB Output is correct
35 Correct 32 ms 576 KB Output is correct
36 Correct 29 ms 528 KB Output is correct
37 Correct 22 ms 460 KB Output is correct
38 Correct 52 ms 460 KB Output is correct
39 Correct 30 ms 460 KB Output is correct
40 Correct 25 ms 532 KB Output is correct
41 Correct 22 ms 520 KB Output is correct
42 Correct 57 ms 460 KB Output is correct
43 Correct 16 ms 524 KB Output is correct
44 Correct 11 ms 524 KB Output is correct
45 Correct 10 ms 460 KB Output is correct
46 Correct 67 ms 500 KB Output is correct
47 Correct 8 ms 460 KB Output is correct
48 Correct 5 ms 460 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 38 ms 460 KB Output is correct
51 Correct 9 ms 524 KB Output is correct
52 Correct 7 ms 460 KB Output is correct
53 Correct 2 ms 460 KB Output is correct
54 Correct 31 ms 460 KB Output is correct
55 Correct 29 ms 532 KB Output is correct
56 Correct 28 ms 536 KB Output is correct
57 Correct 36 ms 580 KB Output is correct
58 Correct 34 ms 576 KB Output is correct
59 Correct 39 ms 544 KB Output is correct
60 Correct 35 ms 524 KB Output is correct
61 Correct 34 ms 524 KB Output is correct
62 Correct 34 ms 528 KB Output is correct
63 Correct 32 ms 564 KB Output is correct
64 Correct 33 ms 460 KB Output is correct

Subtask #4
0 / 61.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Execution timed out 3045 ms 5156 KB Time limit exceeded
5 Halted 0 ms 0 KB -