Submission #1006732

#	Time	Username	Problem	Language	Result	Execution time	Memory
1006732		Whisper	Studentsko (COCI14_studentsko)	C++17	100 / 100	37 ms	928 KiB

studentsko

#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (b); i >= (a); i --)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPD(i, n) for (int i = (n) - 1; i >= 0; --i)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)


constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nArr, k;
#define MAX     5005
int A[MAX], B[MAX];

int dp[MAX];
map<int, int> ID;

void process(void){
    cin >> nArr >> k;
    FOR(i, 1, nArr) cin >> A[i], B[i] = A[i];
    sort(B + 1, B + nArr + 1);
    int cnt = 0;
    for(int i = 1; i <= nArr; i += k){
        ++cnt;
        for (int j = i; j <= i + k - 1; ++j){
            ID[B[j]] = cnt;
        }
    }
    for (int i = 1; i <= nArr; ++i) A[i] = ID[A[i]];
    for (int i = 1; i <= nArr; ++i){
        for (int j = 0; j < i; ++j){
            if (A[i] >= A[j]) maximize(dp[i], dp[j] + 1);
        }
    }
    cout << nArr - *max_element(dp + 1, dp + nArr + 1);
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10