Submission #871886

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
871886	2023-11-11T19:16:25 Z	tvladm2009	Event Hopping 2 (JOI21_event2)	C++17	0 / 100	30 ms	4688 KB

event2

#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 pos = std::lower_bound(l.begin(), l.end(), r[i]) - l.begin();
        dp[i] = suff[pos] + 1;
        suff[i] = std::max(suff[i + 1], dp[i]);
    }
    int last = 0;
    for (int i = 0; i < n; i++) {
        if (l[i] >= last && dp[i] >= k) {
            last = r[i];
            k--;
            std::cout << i + 1 << "\n";
        }
        if (k == 0) {
            break;
        }
    }
    return 0;
}

Subtask #1

0 / 7.0

#	Verdict	Execution time	Memory	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	25 ms	2544 KB	Output is correct
5	Correct	25 ms	4444 KB	Output is correct
6	Correct	25 ms	4444 KB	Output is correct
7	Correct	30 ms	4436 KB	Output is correct
8	Correct	25 ms	4432 KB	Output is correct
9	Correct	25 ms	4444 KB	Output is correct
10	Correct	25 ms	4688 KB	Output is correct
11	Correct	24 ms	4208 KB	Output is correct
12	Correct	24 ms	4176 KB	Output is correct
13	Correct	28 ms	4056 KB	Output is correct
14	Correct	23 ms	4232 KB	Output is correct
15	Correct	23 ms	4184 KB	Output is correct
16	Correct	20 ms	3928 KB	Output is correct
17	Correct	20 ms	3932 KB	Output is correct
18	Correct	20 ms	3932 KB	Output is correct
19	Correct	20 ms	3932 KB	Output is correct
20	Correct	20 ms	3932 KB	Output is correct
21	Correct	20 ms	3932 KB	Output is correct
22	Correct	21 ms	3928 KB	Output is correct
23	Correct	21 ms	3796 KB	Output is correct
24	Correct	22 ms	4184 KB	Output is correct
25	Correct	22 ms	3976 KB	Output is correct
26	Correct	23 ms	3924 KB	Output is correct
27	Correct	22 ms	3924 KB	Output is correct
28	Incorrect	20 ms	3932 KB	Output isn't correct
29	Halted	0 ms	0 KB	-

Subtask #2

0 / 1.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Incorrect	0 ms	348 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #3

0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Incorrect	0 ms	348 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #4

0 / 61.0

#	Verdict	Execution time	Memory	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	25 ms	2544 KB	Output is correct
5	Correct	25 ms	4444 KB	Output is correct
6	Correct	25 ms	4444 KB	Output is correct
7	Correct	30 ms	4436 KB	Output is correct
8	Correct	25 ms	4432 KB	Output is correct
9	Correct	25 ms	4444 KB	Output is correct
10	Correct	25 ms	4688 KB	Output is correct
11	Correct	24 ms	4208 KB	Output is correct
12	Correct	24 ms	4176 KB	Output is correct
13	Correct	28 ms	4056 KB	Output is correct
14	Correct	23 ms	4232 KB	Output is correct
15	Correct	23 ms	4184 KB	Output is correct
16	Correct	20 ms	3928 KB	Output is correct
17	Correct	20 ms	3932 KB	Output is correct
18	Correct	20 ms	3932 KB	Output is correct
19	Correct	20 ms	3932 KB	Output is correct
20	Correct	20 ms	3932 KB	Output is correct
21	Correct	20 ms	3932 KB	Output is correct
22	Correct	21 ms	3928 KB	Output is correct
23	Correct	21 ms	3796 KB	Output is correct
24	Correct	22 ms	4184 KB	Output is correct
25	Correct	22 ms	3976 KB	Output is correct
26	Correct	23 ms	3924 KB	Output is correct
27	Correct	22 ms	3924 KB	Output is correct
28	Incorrect	20 ms	3932 KB	Output isn't correct
29	Halted	0 ms	0 KB	-