제출 #1101140

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1101140		Choco	학생 (COCI14_studentsko)	C++14	0 / 100	5 ms	1016 KiB

studentsko

#include<bits/stdc++.h>
using namespace std;
#define Study ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pb push_back
#define ff first 
#define ss second
#define fori for(ll i=0;i<n;i++)
#define ins insert
void work(){
    ll n,k;
    cin>>n>>k;
    vector<ll>a(n+1);
    vector<ll>ca(n+1);
    vector<ll>dpq(n+1,0),dpa(n+1,0);
    map<ll,ll>m;
    for(ll i=1;i<=n;i++){
    cin>>a[i];
    ca[i]=a[i];
    }
    sort(a.begin(),a.end());
    for(ll i=1;i<=n;i++){
        ll ans=i/k;
        if(i%k!=0)
        ans++;
        m[a[i]]=ans;
    }
    ll maximumgroup=m[ca[1]];
    for(ll i=2;i<=n;i++){
        dpq[i]=dpq[i-1];
        if(m[ca[i]]>maximumgroup){
            maximumgroup=m[ca[i]];
        }
        else if(m[ca[i]]<maximumgroup){
            dpq[i]++;
        }
    }
    maximumgroup=m[ca[n]];
    for(ll i=n-1;i>=1;i--){
        dpa[i]=dpa[i+1];
        if(m[ca[i]]<maximumgroup){
            maximumgroup=m[ca[i]];
        }
        else if(m[ca[i]]>maximumgroup){
            dpa[i]++;
        }
    }
    cout<<min(dpa[1],dpq[n]);
}
int main(){
    Study;
    ll t=1;
    //cin>>t;
    while(t--){
        work();
    }
}

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