oj.uz

Submission #893448

# Submission time Handle Problem Language Result Execution time Memory
893448 2023-12-27T05:02:43 Z vjudge1 Event Hopping 2 (JOI21_event2) C++17
32 / 100
 579 ms 524288 KB 
#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, k; cin >> n >> k;
    vector <int> L(n), R(n);
    for ( int i = 0; i < n; i++ ){
        cin >> L[i] >> R[i];
    }
    { // compression
        vector <int> p_;
        for ( int i = 0; i < n; i++ ){
            p_.pb(L[i]);
            p_.pb(R[i]);
        }
        sort(all(p_));
        p_.resize(unique(all(p_)) - p_.begin());
        auto get = [&](int x){
            return lower_bound(all(p_), x) - p_.begin() + 1;
        };
        for ( int i = 0; i < n; i++ ){
            L[i] = get(L[i]);
            R[i] = get(R[i]);
        }
    }
    int m = n * 2;
    vector <vector<int>> quL(m + 1), quR(m + 1);
    for ( int i = 0; i < n; i++ ){
        quR[R[i]].pb(L[i]);
        quL[L[i]].pb(R[i]);
    }
    auto DpL = [&](int x){
        vector <int> dpL(m + 2);
        for ( int i = x; i > 0; i-- ){
            dpL[i] = dpL[i + 1];
            for ( auto &j: quL[i] ){
                if ( j <= x ){
                    chmax(dpL[i], dpL[j] + 1);
                }
            }
        }
        return dpL;
    };
    vector <vector<int>> dp(m + 1, vector <int> (m + 2));
    for ( int i = 1; i <= m; i++ ){
        auto q = DpL(i);
        for ( int j = 1; j <= m; j++ ){
            dp[j][i] = q[j];
        }
    }
    auto dpL = DpL(m);
    if ( dpL[1] < k ){
        return cout << "-1\n", 0;
    }
    if ( n > 3e3 ){
        int lst = -1;
        for ( int i = 0; i < n && k > 0; i++ ){
            if ( lst <= L[i] && dpL[R[i]] >= k - 1 ){
                cout << i + 1 << ln;
                k--; lst = R[i];
            }
        } exit(0);
    }
    vector <ar<int,2>> rng;
    rng.pb({1, m});
    for ( int i = 0; i < m && k > 0; i++ ){
        int cnt = 0, j = -1, it = 0;
        for ( auto &[l, r]: rng ){
            cnt += dp[l][r];
            if ( l <= L[i] && r >= R[i] ){
                j = it;
            } it++;
        }
        if ( j != -1 ){
            auto [l, r] = rng[j];
            if ( cnt - dp[l][r] + dp[l][L[i]] + dp[R[i]][r] + 1 >= k ){
                cout << i + 1 << ln;
                k--;
                rng[j] = {l, L[i]};
                rng.pb({R[i], r});
            }
        }
    }

    cout << '\n';
}

Subtask #1
0 / 7.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 Runtime error 213 ms 524288 KB Execution killed with signal 9
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 1 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 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 348 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 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 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 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 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 1 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 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 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 348 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 348 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 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 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 551 ms 283296 KB Output is correct
29 Correct 542 ms 282964 KB Output is correct
30 Correct 542 ms 283508 KB Output is correct
31 Correct 545 ms 283256 KB Output is correct
32 Correct 566 ms 283472 KB Output is correct
33 Correct 539 ms 283220 KB Output is correct
34 Correct 549 ms 283252 KB Output is correct
35 Correct 579 ms 283260 KB Output is correct
36 Correct 565 ms 283164 KB Output is correct
37 Correct 547 ms 283260 KB Output is correct
38 Correct 535 ms 283472 KB Output is correct
39 Correct 550 ms 283248 KB Output is correct
40 Correct 556 ms 283256 KB Output is correct
41 Correct 551 ms 283476 KB Output is correct
42 Correct 525 ms 283252 KB Output is correct
43 Correct 539 ms 283220 KB Output is correct
44 Correct 546 ms 283396 KB Output is correct
45 Correct 543 ms 283252 KB Output is correct
46 Correct 567 ms 283256 KB Output is correct
47 Correct 541 ms 283476 KB Output is correct
48 Correct 541 ms 283472 KB Output is correct
49 Correct 543 ms 283016 KB Output is correct
50 Correct 542 ms 283364 KB Output is correct
51 Correct 546 ms 283252 KB Output is correct
52 Correct 540 ms 283260 KB Output is correct
53 Correct 528 ms 283252 KB Output is correct
54 Correct 530 ms 283480 KB Output is correct
55 Correct 567 ms 283216 KB Output is correct
56 Correct 570 ms 283220 KB Output is correct
57 Correct 579 ms 283468 KB Output is correct
58 Correct 579 ms 283476 KB Output is correct
59 Correct 564 ms 283188 KB Output is correct
60 Correct 577 ms 283332 KB Output is correct
61 Correct 570 ms 283324 KB Output is correct
62 Correct 562 ms 283252 KB Output is correct
63 Correct 561 ms 283224 KB Output is correct
64 Correct 535 ms 283256 KB Output is correct

Subtask #4
0 / 61.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 Runtime error 213 ms 524288 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -