Submission #477523

#	Time	Username	Problem	Language	Result	Execution time	Memory
477523		hjc4vr	Studentsko (COCI14_studentsko)	C++14	0 / 100	13 ms	440 KiB

studentsko

#include <bits/stdc++.h>
using namespace std;
int ft[5005];
int query(int x){
    int ans=0;
    for (;x!=0;x-=x&(-x)) ans = max(ft[x],ans);
    return ans;
}
void insert(int x,int val){
    for (;x<=5004;x+=x&(-x)) ft[x] = max(ft[x],val);
}

bool s(pair<int,int> &a,pair<int,int> &b){
    if (a.first < b.first){
        return true;
    }
    else if (a.first == b.first){
        return a.second < b.second;
    }else{
        return false;
    }

}

int32_t main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n,k;cin>>n>>k;
    pair<int,int> arr[n+1];
    for (int i=1;i<=n;++i) {
        int a;
        cin >> a;
        arr[i] = make_pair(a,i);
    }
    sort(arr+1,arr+n+1);
    int t=1,cnt=k;
    pair<int,int> v[n+1];
    for (int i=1;i<=n;++i){
        v[arr[i].second] = make_pair(t,arr[i].second);
        cnt--;
        if (cnt==0){
            t+=1;
            cnt=k;
        }
    }
    sort(v+1,v+n+1,s);
    for (int i=1;i<=n;++i){
        cout << v[i].first << ' ' << v[i].second << endl;
        int maxi = query(v[i].second);
        insert(v[i].second,maxi+1);
    }
    cout << n - query(n);
}
    

• 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