oj.uz

답안 #871915

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
871915 2023-11-11T21:00:51 Z tvladm2009 Event Hopping 2 (JOI21_event2) C++17
7 / 100
 25 ms 4576 KB 
#include <bits/stdc++.h>
 
using i64 = long long;
 
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n, k;
    std::cin >> n >> k;
    std::vector<int> l(n), r(n);
    for (int i = 0; i < n; i++) {
        std::cin >> l[i] >> r[i];
    }
    std::vector<int> dp(n, 0), suff(n + 1, 0);
    for (int i = n - 1; i >= 0; i--) {
        int lft = i + 1, rgh = n - 1, pos = n;
        while (lft <= rgh) {
            int m = (lft + rgh) / 2;
            if (l[m] >= r[i]) {
                rgh = m - 1;
                pos = m;
            } else {
                lft = m + 1;
            }
        }
        dp[i] = suff[pos] + 1;
        suff[i] = std::max(suff[i + 1], dp[i]);
    }
    std::vector<int> sol;
    int last = 0;
    for (int i = 0; i < n; i++) {
        if (l[i] >= last && dp[i] >= k) {
            last = r[i];
            k--;
            sol.push_back(i + 1);
        }
        if (k == 0) {
            break;
        }
    }
    if (k > 0) {
        std::cout << "-1\n";
        return 0;
    }
    for (auto it : sol) {
        std::cout << it << "\n";
    }
    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 23 ms 3028 KB Output is correct
5 Correct 21 ms 2808 KB Output is correct
6 Correct 22 ms 2776 KB Output is correct
7 Correct 25 ms 2772 KB Output is correct
8 Correct 21 ms 3024 KB Output is correct
9 Correct 23 ms 2900 KB Output is correct
10 Correct 22 ms 2776 KB Output is correct
11 Correct 21 ms 2672 KB Output is correct
12 Correct 21 ms 2528 KB Output is correct
13 Correct 20 ms 2528 KB Output is correct
14 Correct 20 ms 2528 KB Output is correct
15 Correct 20 ms 2524 KB Output is correct
16 Correct 18 ms 2140 KB Output is correct
17 Correct 18 ms 2040 KB Output is correct
18 Correct 18 ms 2140 KB Output is correct
19 Correct 20 ms 2012 KB Output is correct
20 Correct 19 ms 1880 KB Output is correct
21 Correct 19 ms 2012 KB Output is correct
22 Correct 21 ms 1880 KB Output is correct
23 Correct 21 ms 2020 KB Output is correct
24 Correct 21 ms 1884 KB Output is correct
25 Correct 22 ms 1880 KB Output is correct
26 Correct 22 ms 1884 KB Output is correct
27 Correct 23 ms 1884 KB Output is correct
28 Correct 17 ms 2024 KB Output is correct
29 Correct 17 ms 3916 KB Output is correct
30 Correct 19 ms 3920 KB Output is correct
31 Correct 20 ms 3920 KB Output is correct
32 Correct 22 ms 3928 KB Output is correct
33 Correct 23 ms 3932 KB Output is correct
34 Correct 24 ms 4312 KB Output is correct
35 Correct 19 ms 4180 KB Output is correct
36 Correct 22 ms 3928 KB Output is correct
37 Correct 20 ms 4436 KB Output is correct
38 Correct 20 ms 4576 KB Output is correct
39 Correct 20 ms 4312 KB Output is correct
40 Correct 25 ms 4308 KB Output is correct
41 Correct 20 ms 4436 KB Output is correct
42 Correct 17 ms 3916 KB Output is correct
43 Correct 20 ms 4312 KB Output is correct
44 Correct 20 ms 4312 KB Output is correct
45 Correct 19 ms 4304 KB Output is correct
46 Correct 19 ms 4308 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 Incorrect 0 ms 348 KB Output isn't correct
4 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 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 61.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 23 ms 3028 KB Output is correct
5 Correct 21 ms 2808 KB Output is correct
6 Correct 22 ms 2776 KB Output is correct
7 Correct 25 ms 2772 KB Output is correct
8 Correct 21 ms 3024 KB Output is correct
9 Correct 23 ms 2900 KB Output is correct
10 Correct 22 ms 2776 KB Output is correct
11 Correct 21 ms 2672 KB Output is correct
12 Correct 21 ms 2528 KB Output is correct
13 Correct 20 ms 2528 KB Output is correct
14 Correct 20 ms 2528 KB Output is correct
15 Correct 20 ms 2524 KB Output is correct
16 Correct 18 ms 2140 KB Output is correct
17 Correct 18 ms 2040 KB Output is correct
18 Correct 18 ms 2140 KB Output is correct
19 Correct 20 ms 2012 KB Output is correct
20 Correct 19 ms 1880 KB Output is correct
21 Correct 19 ms 2012 KB Output is correct
22 Correct 21 ms 1880 KB Output is correct
23 Correct 21 ms 2020 KB Output is correct
24 Correct 21 ms 1884 KB Output is correct
25 Correct 22 ms 1880 KB Output is correct
26 Correct 22 ms 1884 KB Output is correct
27 Correct 23 ms 1884 KB Output is correct
28 Correct 17 ms 2024 KB Output is correct
29 Correct 17 ms 3916 KB Output is correct
30 Correct 19 ms 3920 KB Output is correct
31 Correct 20 ms 3920 KB Output is correct
32 Correct 22 ms 3928 KB Output is correct
33 Correct 23 ms 3932 KB Output is correct
34 Correct 24 ms 4312 KB Output is correct
35 Correct 19 ms 4180 KB Output is correct
36 Correct 22 ms 3928 KB Output is correct
37 Correct 20 ms 4436 KB Output is correct
38 Correct 20 ms 4576 KB Output is correct
39 Correct 20 ms 4312 KB Output is correct
40 Correct 25 ms 4308 KB Output is correct
41 Correct 20 ms 4436 KB Output is correct
42 Correct 17 ms 3916 KB Output is correct
43 Correct 20 ms 4312 KB Output is correct
44 Correct 20 ms 4312 KB Output is correct
45 Correct 19 ms 4304 KB Output is correct
46 Correct 19 ms 4308 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Incorrect 0 ms 348 KB Output isn't correct
50 Halted 0 ms 0 KB -