oj.uz

답안 #492729

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
492729 2021-12-08T14:26:53 Z Lukap The short shank; Redemption (BOI21_prison) C++14
0 / 100
 231 ms 10992 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 2e6 + 7;

int n, d, t;
int vri[MAXN], akt[MAXN], dp[MAXN];
int uk;

int main () {

    cin >> n >> d >> t;

    for (int i = 0; i < n; i++) cin >> vri[i];

    for (int i = 0; i < n; i++) {
        if (vri[i] <= t) akt[i] = 1;
    }

    int prosli = -1;

    for (int i = 0; i < n; i++) {
        if (akt[i] == 1) prosli = i;

        else if (prosli == -1 || i - prosli > t - vri[i]) akt[i] = 0;

        else akt[i] = -1;
    }

    for (int i = 0; i < n; i++) {
        if (akt[i] != -1) uk++;
    }

    dp[n] = 0;

    for (int i = n - 1; i >= 0; i--) {
        if (akt[i] != 0) continue;

        dp[i] = dp[i + 1] + 1;
        dp[i + 1] = 0;
    }

    sort (dp, dp + n);
    reverse(dp, dp + n);

    for (int i = 0; i < d; i++) uk -= dp[i];

    cout << uk;

    return 0;
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Incorrect 1 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

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

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Incorrect 1 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

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

Subtask #5
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Incorrect 1 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Incorrect 1 ms 204 KB Output isn't correct
6 Halted 0 ms 0 KB -