oj.uz

답안 #893452

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
893452 2023-12-27T05:04:35 Z vjudge1 Event Hopping 2 (JOI21_event2) C++17
39 / 100
 586 ms 283568 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;
    };
    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 <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];
        }
    }
    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
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 592 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 43 ms 19788 KB Output is correct
5 Correct 44 ms 19528 KB Output is correct
6 Correct 44 ms 19632 KB Output is correct
7 Correct 44 ms 19628 KB Output is correct
8 Correct 44 ms 19780 KB Output is correct
9 Correct 46 ms 19632 KB Output is correct
10 Correct 43 ms 19632 KB Output is correct
11 Correct 43 ms 19580 KB Output is correct
12 Correct 43 ms 19372 KB Output is correct
13 Correct 43 ms 19572 KB Output is correct
14 Correct 45 ms 19528 KB Output is correct
15 Correct 43 ms 19328 KB Output is correct
16 Correct 45 ms 19120 KB Output is correct
17 Correct 42 ms 19128 KB Output is correct
18 Correct 42 ms 19248 KB Output is correct
19 Correct 52 ms 19116 KB Output is correct
20 Correct 44 ms 19116 KB Output is correct
21 Correct 43 ms 19120 KB Output is correct
22 Correct 46 ms 19116 KB Output is correct
23 Correct 47 ms 19120 KB Output is correct
24 Correct 47 ms 19120 KB Output is correct
25 Correct 57 ms 19168 KB Output is correct
26 Correct 50 ms 19244 KB Output is correct
27 Correct 50 ms 19116 KB Output is correct
28 Correct 40 ms 19028 KB Output is correct
29 Correct 42 ms 19120 KB Output is correct
30 Correct 45 ms 19116 KB Output is correct
31 Correct 46 ms 19200 KB Output is correct
32 Correct 51 ms 19120 KB Output is correct
33 Correct 55 ms 19048 KB Output is correct
34 Correct 43 ms 19372 KB Output is correct
35 Correct 40 ms 19372 KB Output is correct
36 Correct 42 ms 19288 KB Output is correct
37 Correct 40 ms 19524 KB Output is correct
38 Correct 40 ms 19372 KB Output is correct
39 Correct 40 ms 19400 KB Output is correct
40 Correct 40 ms 19372 KB Output is correct
41 Correct 41 ms 19376 KB Output is correct
42 Correct 50 ms 19248 KB Output is correct
43 Correct 56 ms 19296 KB Output is correct
44 Correct 50 ms 19276 KB Output is correct
45 Correct 50 ms 19320 KB Output is correct
46 Correct 52 ms 19372 KB Output is correct

Subtask #2
1.0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 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 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 0 ms 348 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 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 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 0 ms 348 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 548 ms 283216 KB Output is correct
29 Correct 546 ms 283344 KB Output is correct
30 Correct 547 ms 283480 KB Output is correct
31 Correct 543 ms 283216 KB Output is correct
32 Correct 544 ms 283216 KB Output is correct
33 Correct 2 ms 860 KB Output is correct
34 Correct 2 ms 860 KB Output is correct
35 Correct 585 ms 283272 KB Output is correct
36 Correct 571 ms 283220 KB Output is correct
37 Correct 555 ms 283220 KB Output is correct
38 Correct 2 ms 860 KB Output is correct
39 Correct 565 ms 283240 KB Output is correct
40 Correct 556 ms 283368 KB Output is correct
41 Correct 555 ms 283216 KB Output is correct
42 Correct 2 ms 860 KB Output is correct
43 Correct 552 ms 283220 KB Output is correct
44 Correct 548 ms 283248 KB Output is correct
45 Correct 541 ms 283220 KB Output is correct
46 Correct 2 ms 860 KB Output is correct
47 Correct 546 ms 283020 KB Output is correct
48 Correct 546 ms 283244 KB Output is correct
49 Correct 541 ms 283220 KB Output is correct
50 Correct 2 ms 860 KB Output is correct
51 Correct 541 ms 283368 KB Output is correct
52 Correct 536 ms 283240 KB Output is correct
53 Correct 541 ms 283244 KB Output is correct
54 Correct 2 ms 856 KB Output is correct
55 Correct 581 ms 283084 KB Output is correct
56 Correct 572 ms 283408 KB Output is correct
57 Correct 561 ms 283568 KB Output is correct
58 Correct 568 ms 283132 KB Output is correct
59 Correct 580 ms 283252 KB Output is correct
60 Correct 571 ms 283476 KB Output is correct
61 Correct 553 ms 283244 KB Output is correct
62 Correct 586 ms 283244 KB Output is correct
63 Correct 547 ms 283240 KB Output is correct
64 Correct 2 ms 860 KB Output is correct

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 592 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 43 ms 19788 KB Output is correct
5 Correct 44 ms 19528 KB Output is correct
6 Correct 44 ms 19632 KB Output is correct
7 Correct 44 ms 19628 KB Output is correct
8 Correct 44 ms 19780 KB Output is correct
9 Correct 46 ms 19632 KB Output is correct
10 Correct 43 ms 19632 KB Output is correct
11 Correct 43 ms 19580 KB Output is correct
12 Correct 43 ms 19372 KB Output is correct
13 Correct 43 ms 19572 KB Output is correct
14 Correct 45 ms 19528 KB Output is correct
15 Correct 43 ms 19328 KB Output is correct
16 Correct 45 ms 19120 KB Output is correct
17 Correct 42 ms 19128 KB Output is correct
18 Correct 42 ms 19248 KB Output is correct
19 Correct 52 ms 19116 KB Output is correct
20 Correct 44 ms 19116 KB Output is correct
21 Correct 43 ms 19120 KB Output is correct
22 Correct 46 ms 19116 KB Output is correct
23 Correct 47 ms 19120 KB Output is correct
24 Correct 47 ms 19120 KB Output is correct
25 Correct 57 ms 19168 KB Output is correct
26 Correct 50 ms 19244 KB Output is correct
27 Correct 50 ms 19116 KB Output is correct
28 Correct 40 ms 19028 KB Output is correct
29 Correct 42 ms 19120 KB Output is correct
30 Correct 45 ms 19116 KB Output is correct
31 Correct 46 ms 19200 KB Output is correct
32 Correct 51 ms 19120 KB Output is correct
33 Correct 55 ms 19048 KB Output is correct
34 Correct 43 ms 19372 KB Output is correct
35 Correct 40 ms 19372 KB Output is correct
36 Correct 42 ms 19288 KB Output is correct
37 Correct 40 ms 19524 KB Output is correct
38 Correct 40 ms 19372 KB Output is correct
39 Correct 40 ms 19400 KB Output is correct
40 Correct 40 ms 19372 KB Output is correct
41 Correct 41 ms 19376 KB Output is correct
42 Correct 50 ms 19248 KB Output is correct
43 Correct 56 ms 19296 KB Output is correct
44 Correct 50 ms 19276 KB Output is correct
45 Correct 50 ms 19320 KB Output is correct
46 Correct 52 ms 19372 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 600 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 0 ms 348 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 0 ms 348 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 0 ms 344 KB Output is correct
74 Correct 548 ms 283216 KB Output is correct
75 Correct 546 ms 283344 KB Output is correct
76 Correct 547 ms 283480 KB Output is correct
77 Correct 543 ms 283216 KB Output is correct
78 Correct 544 ms 283216 KB Output is correct
79 Correct 2 ms 860 KB Output is correct
80 Correct 2 ms 860 KB Output is correct
81 Correct 585 ms 283272 KB Output is correct
82 Correct 571 ms 283220 KB Output is correct
83 Correct 555 ms 283220 KB Output is correct
84 Correct 2 ms 860 KB Output is correct
85 Correct 565 ms 283240 KB Output is correct
86 Correct 556 ms 283368 KB Output is correct
87 Correct 555 ms 283216 KB Output is correct
88 Correct 2 ms 860 KB Output is correct
89 Correct 552 ms 283220 KB Output is correct
90 Correct 548 ms 283248 KB Output is correct
91 Correct 541 ms 283220 KB Output is correct
92 Correct 2 ms 860 KB Output is correct
93 Correct 546 ms 283020 KB Output is correct
94 Correct 546 ms 283244 KB Output is correct
95 Correct 541 ms 283220 KB Output is correct
96 Correct 2 ms 860 KB Output is correct
97 Correct 541 ms 283368 KB Output is correct
98 Correct 536 ms 283240 KB Output is correct
99 Correct 541 ms 283244 KB Output is correct
100 Correct 2 ms 856 KB Output is correct
101 Correct 581 ms 283084 KB Output is correct
102 Correct 572 ms 283408 KB Output is correct
103 Correct 561 ms 283568 KB Output is correct
104 Correct 568 ms 283132 KB Output is correct
105 Correct 580 ms 283252 KB Output is correct
106 Correct 571 ms 283476 KB Output is correct
107 Correct 553 ms 283244 KB Output is correct
108 Correct 586 ms 283244 KB Output is correct
109 Correct 547 ms 283240 KB Output is correct
110 Correct 2 ms 860 KB Output is correct
111 Incorrect 68 ms 21168 KB Output isn't correct
112 Halted 0 ms 0 KB -