제출 #1231315

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1231315		j_vdd16	The short shank; Redemption (BOI21_prison)	C++20	0 / 100	0 ms	324 KiB

prison

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <random>

//#define int long long
#define loop(X, N) for (int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

int main() {
    int n, d, t;
    cin >> n >> d >> t;

    int lastI = -1;
    int mx = 0;

    int result = 0;

    vii freq(n);
    loop(i, n)
        freq[i].second = i;
    
    vi a(n);
    loop(i, n) {
        cin >> a[i];

        if (a[i] <= t) {
            result++;
            if (a[i] <= mx) {
                mx = a[i];
                lastI = i;
            }
        }
        else {
            if (lastI != -1 && mx <= t)
                freq[lastI].first++;
        }

        mx++;
    }

    sort(all(freq));
    for (int i = 0; i < n - d; i++) {
        result += freq[i].first;
    }

    cout << result << endl;

    return 0;
}

• Subtask 1: 0 / 15
• Subtask 2: 0 / 10
• Subtask 3: 0 / 20
• Subtask 4: 0 / 10
• Subtask 5: 0 / 25
• Subtask 6: 0 / 20