oj.uz

Submission #492979

# Submission time Handle Problem Language Result Execution time Memory
492979 2021-12-09T21:36:20 Z niloyroot Studentsko (COCI14_studentsko) C++14
100 / 100
 48 ms 496 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<ll>;
using pl = pair<ll,ll>;
#define pb push_back
#define form(m,it) for(auto it=m.begin(); it!=m.end(); it++)
#define forp(i,a,b) for(ll i=a; i<=b; i++)
#define forn(i,a,b) for(ll i=a; i>=b; i--)
#define newl '\n'
#define ff first
#define ss second
const ll mod = 998244353;

void solve(){
    ll n,k; cin>>n>>k;
    pl v[n];
    forp(i,0,n-1){
        cin>>v[i].ff; v[i].ss=i;
    }
    sort(v, v+n);
    ll a[n];
    forp(i,0,n-1){
        a[v[i].ss]=i/k;
    }

    ll dp[n];
    ll mx={0};
    forp(i,0,n-1){
        dp[i]=1;
        forp(j,0,i-1){
            if(a[i]>=a[j]){
                dp[i]=max(dp[i],dp[j]+1);
            }
        }
        mx=max(mx,dp[i]);
    }

    cout<<n-mx<<newl;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t=1; //cin>>t;
    while(t--)solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 460 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 496 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 480 KB Output is correct
2 Correct 33 ms 472 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 460 KB Output is correct
2 Correct 42 ms 460 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 460 KB Output is correct
2 Correct 24 ms 468 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 460 KB Output is correct
2 Correct 42 ms 488 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 460 KB Output is correct
2 Correct 42 ms 460 KB Output is correct