oj.uz

답안 #893417

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
893417 2023-12-27T04:37:55 Z vjudge1 Event Hopping 2 (JOI21_event2) C++17
7 / 100
 49 ms 13748 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>> qu(m + 1);
    for ( int i = 0; i < n; i++ ){
        qu[L[i]].pb(R[i]);
    }
    vector <int> dp(m + 2);
    for ( int i = m; i > 0; i-- ){
        dp[i] = dp[i + 1];
        for ( auto &j: qu[i] ){
            chmax(dp[i], dp[j] + 1);
        }
    }
    if ( dp[1] < k ){
        return cout << "-1\n", 0;
    }
    vector <int> ans;
    if ( n > 3e3 ){
        int lst = -1;
        for ( int i = 0; i < n && k > 0; i++ ){
            if ( lst <= L[i] && dp[R[i]] >= k - 1 ){
                cout << i + 1 << ln;
                k--; lst = R[i];
            }
        }
    } else{
        int lst = -1;
        for ( int t = 1; t <= k; t++ ){
            int j = -1;
            for ( int i = 0; i < n; i++ ){
                if ( lst > L[i] ){
                    continue;
                }
                if ( dp[R[i]] >= k - t ){
                    j = i; break;
                }
            }
            if ( j == -1 ){
                return cout << "-1\n", 0;
            }
            ans.pb(j);
            lst = R[j];
        }
    }
    sort(all(ans));
    for ( auto &x: ans ){
        cout << x + 1 << ln;
    }

    cout << '\n';
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 40 ms 11912 KB Output is correct
5 Correct 40 ms 13744 KB Output is correct
6 Correct 41 ms 13744 KB Output is correct
7 Correct 39 ms 13556 KB Output is correct
8 Correct 40 ms 13732 KB Output is correct
9 Correct 40 ms 13744 KB Output is correct
10 Correct 39 ms 13748 KB Output is correct
11 Correct 39 ms 13736 KB Output is correct
12 Correct 42 ms 13736 KB Output is correct
13 Correct 40 ms 13484 KB Output is correct
14 Correct 40 ms 13488 KB Output is correct
15 Correct 40 ms 13492 KB Output is correct
16 Correct 39 ms 13224 KB Output is correct
17 Correct 39 ms 13228 KB Output is correct
18 Correct 40 ms 13228 KB Output is correct
19 Correct 41 ms 13232 KB Output is correct
20 Correct 40 ms 13300 KB Output is correct
21 Correct 43 ms 13232 KB Output is correct
22 Correct 43 ms 13328 KB Output is correct
23 Correct 43 ms 13280 KB Output is correct
24 Correct 43 ms 13228 KB Output is correct
25 Correct 48 ms 13228 KB Output is correct
26 Correct 46 ms 13232 KB Output is correct
27 Correct 46 ms 13236 KB Output is correct
28 Correct 35 ms 13228 KB Output is correct
29 Correct 37 ms 13228 KB Output is correct
30 Correct 39 ms 13240 KB Output is correct
31 Correct 41 ms 13244 KB Output is correct
32 Correct 44 ms 13248 KB Output is correct
33 Correct 49 ms 13232 KB Output is correct
34 Correct 39 ms 13304 KB Output is correct
35 Correct 39 ms 13232 KB Output is correct
36 Correct 37 ms 13316 KB Output is correct
37 Correct 37 ms 13624 KB Output is correct
38 Correct 37 ms 13572 KB Output is correct
39 Correct 38 ms 13496 KB Output is correct
40 Correct 37 ms 13552 KB Output is correct
41 Correct 37 ms 13484 KB Output is correct
42 Correct 47 ms 13540 KB Output is correct
43 Correct 47 ms 13628 KB Output is correct
44 Correct 45 ms 13488 KB Output is correct
45 Correct 45 ms 13484 KB Output is correct
46 Correct 48 ms 13572 KB Output is correct

Subtask #2
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 Incorrect 0 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 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 Incorrect 0 ms 344 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 40 ms 11912 KB Output is correct
5 Correct 40 ms 13744 KB Output is correct
6 Correct 41 ms 13744 KB Output is correct
7 Correct 39 ms 13556 KB Output is correct
8 Correct 40 ms 13732 KB Output is correct
9 Correct 40 ms 13744 KB Output is correct
10 Correct 39 ms 13748 KB Output is correct
11 Correct 39 ms 13736 KB Output is correct
12 Correct 42 ms 13736 KB Output is correct
13 Correct 40 ms 13484 KB Output is correct
14 Correct 40 ms 13488 KB Output is correct
15 Correct 40 ms 13492 KB Output is correct
16 Correct 39 ms 13224 KB Output is correct
17 Correct 39 ms 13228 KB Output is correct
18 Correct 40 ms 13228 KB Output is correct
19 Correct 41 ms 13232 KB Output is correct
20 Correct 40 ms 13300 KB Output is correct
21 Correct 43 ms 13232 KB Output is correct
22 Correct 43 ms 13328 KB Output is correct
23 Correct 43 ms 13280 KB Output is correct
24 Correct 43 ms 13228 KB Output is correct
25 Correct 48 ms 13228 KB Output is correct
26 Correct 46 ms 13232 KB Output is correct
27 Correct 46 ms 13236 KB Output is correct
28 Correct 35 ms 13228 KB Output is correct
29 Correct 37 ms 13228 KB Output is correct
30 Correct 39 ms 13240 KB Output is correct
31 Correct 41 ms 13244 KB Output is correct
32 Correct 44 ms 13248 KB Output is correct
33 Correct 49 ms 13232 KB Output is correct
34 Correct 39 ms 13304 KB Output is correct
35 Correct 39 ms 13232 KB Output is correct
36 Correct 37 ms 13316 KB Output is correct
37 Correct 37 ms 13624 KB Output is correct
38 Correct 37 ms 13572 KB Output is correct
39 Correct 38 ms 13496 KB Output is correct
40 Correct 37 ms 13552 KB Output is correct
41 Correct 37 ms 13484 KB Output is correct
42 Correct 47 ms 13540 KB Output is correct
43 Correct 47 ms 13628 KB Output is correct
44 Correct 45 ms 13488 KB Output is correct
45 Correct 45 ms 13484 KB Output is correct
46 Correct 48 ms 13572 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Incorrect 0 ms 344 KB Output isn't correct
52 Halted 0 ms 0 KB -