oj.uz

Submission #871890

# Submission time Handle Problem Language Result Execution time Memory
871890 2023-11-11T19:23:30 Z tvladm2009 Event Hopping 2 (JOI21_event2) C++17
0 / 100
 27 ms 2532 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 = 0;
        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]);
    }
    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 24 ms 2512 KB Output is correct
5 Correct 23 ms 2532 KB Output is correct
6 Correct 23 ms 2388 KB Output is correct
7 Correct 23 ms 2272 KB Output is correct
8 Correct 23 ms 2388 KB Output is correct
9 Correct 27 ms 2520 KB Output is correct
10 Correct 27 ms 2512 KB Output is correct
11 Correct 22 ms 2396 KB Output is correct
12 Correct 25 ms 2280 KB Output is correct
13 Correct 21 ms 2284 KB Output is correct
14 Correct 25 ms 2152 KB Output is correct
15 Correct 20 ms 2292 KB Output is correct
16 Correct 21 ms 2028 KB Output is correct
17 Correct 20 ms 2028 KB Output is correct
18 Correct 26 ms 2040 KB Output is correct
19 Correct 20 ms 2036 KB Output is correct
20 Correct 21 ms 2036 KB Output is correct
21 Correct 25 ms 2032 KB Output is correct
22 Correct 22 ms 2036 KB Output is correct
23 Correct 25 ms 2028 KB Output is correct
24 Correct 21 ms 2032 KB Output is correct
25 Correct 22 ms 2036 KB Output is correct
26 Correct 23 ms 1980 KB Output is correct
27 Correct 22 ms 1896 KB Output is correct
28 Incorrect 17 ms 1884 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 348 KB Output is correct
2 Incorrect 1 ms 388 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 348 KB Output is correct
2 Incorrect 1 ms 388 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 24 ms 2512 KB Output is correct
5 Correct 23 ms 2532 KB Output is correct
6 Correct 23 ms 2388 KB Output is correct
7 Correct 23 ms 2272 KB Output is correct
8 Correct 23 ms 2388 KB Output is correct
9 Correct 27 ms 2520 KB Output is correct
10 Correct 27 ms 2512 KB Output is correct
11 Correct 22 ms 2396 KB Output is correct
12 Correct 25 ms 2280 KB Output is correct
13 Correct 21 ms 2284 KB Output is correct
14 Correct 25 ms 2152 KB Output is correct
15 Correct 20 ms 2292 KB Output is correct
16 Correct 21 ms 2028 KB Output is correct
17 Correct 20 ms 2028 KB Output is correct
18 Correct 26 ms 2040 KB Output is correct
19 Correct 20 ms 2036 KB Output is correct
20 Correct 21 ms 2036 KB Output is correct
21 Correct 25 ms 2032 KB Output is correct
22 Correct 22 ms 2036 KB Output is correct
23 Correct 25 ms 2028 KB Output is correct
24 Correct 21 ms 2032 KB Output is correct
25 Correct 22 ms 2036 KB Output is correct
26 Correct 23 ms 1980 KB Output is correct
27 Correct 22 ms 1896 KB Output is correct
28 Incorrect 17 ms 1884 KB Output isn't correct
29 Halted 0 ms 0 KB -