oj.uz

답안 #518306

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
518306 2022-01-23T10:57:57 Z wenqi The short shank; Redemption (BOI21_prison) C++17
0 / 100
 71 ms 10284 KB 
#include <bits/stdc++.h>

using namespace std;

int N, D, T;

int R[2000069], U[2000069];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> N >> D >> T;
    for (int i = 0; i < N; i++) {
        int t;
        cin >> t;

        int right = i + (T - t);
        R[i] = right;
        U[i] = t;
    }
    for (int i = 1; i < N; i++) {
        R[i] = max(R[i], R[i - 1]);
    }
    vector<int> subs;
    int last = N;
    for (int i = N - 1; i >= 0; i--) {
        if (U[i] < T) {
            subs.push_back(min(R[i] + 1, last) - i - 1);
            last = i;
        }
    }
    sort(subs.begin(), subs.end(), greater<>());
    int sum = 0;
    for (int i = 0; i < min<int>(D, subs.size()); i++) {
        sum += subs[i];
    }
    cout << N - sum << endl;
    return 0;
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Incorrect 1 ms 336 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Incorrect 71 ms 10284 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Incorrect 1 ms 336 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Incorrect 9 ms 1868 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Incorrect 1 ms 336 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Incorrect 1 ms 336 KB Output isn't correct
8 Halted 0 ms 0 KB -