제출 #165100

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
165100		egekabas	학생 (COCI14_studentsko)	C++14	30 / 100	88 ms	65540 KiB

studentsko

#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<ll, ll>  pii;
typedef pair<ld, ld>  pld;
ll n, k;
ll dp[5009][5009];
ll a[5009];
pii b[5009];
ll team[5009];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> n >> k;
    for(ll i = 0; i < n; ++i){
        cin >> a[i];
        b[i] = {a[i], i};
    }
    sort(b, b+n);
    for(ll i = 0; i < n; ++i){
        team[b[i].ss] = i/k;
    }
    for(ll i = 0; i < n; ++i){
        for(ll j = 0; j <= (n-1)/k; ++j){
            if(i == 0)
                dp[i][j] = 1;
            else if(j == 0)
                dp[i][j] = dp[i-1][j]+1;
            else
                dp[i][j] = min(dp[i-1][j-1], dp[i-1][j])+1;
        }
        --dp[i][team[i]];
    }
    ll ans = 1e18;
    for(ll j = 0; j <= (n-1)/k; ++j)
        ans = min(ans, dp[n-1][j]);
    cout << ans << "\n";
}

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