Submission #994278

#	Time	Username	Problem	Language	Result	Execution time	Memory
994278		cpdreamer	Arranging Shoes (IOI19_shoes)	C++17	45 / 100	34 ms	6376 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int> s) {
    int n=(int)s.size();
    vector<int>vp(n);
    for(int i=0;i<n;i++){
        if(s[i]<0)
            vp[i]=0;
        else
            vp[i]=1;
    }
    long long cost=0;
    set<int>left;
    set<int>right;
    for(int i=0;i<n;i++){
        if(vp[i]==0){
            if(i%2==0)
                continue;
            if(!right.empty()) {
                cost += i -*right.begin();
                right.erase(right.begin());
            }
            else
                left.insert(i);
        }
        else{
            if(i%2==1)
                continue;
            if(!left.empty()){
                cost+=i-*left.begin();
                left.erase(left.begin());
            }
            else
                right.insert(i);
        }
    }
    return cost;
}

• Subtask 1: 10 / 10
• Subtask 2: 0 / 20
• Subtask 3: 20 / 20
• Subtask 4: 15 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 15