제출 #171357

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
171357		Kubin	Arranging Shoes (IOI19_shoes)	C++17	70 / 100	1039 ms	43924 KiB

shoes

#include <map>
#include <ext/pb_ds/assoc_container.hpp>
#include "shoes.h"

using namespace std;
using namespace __gnu_pbds;

template<typename T, typename Tk>
using os_map = tree<
    T, Tk, less<T>, rb_tree_tag, tree_order_statistics_node_update
>;
template<typename T>
using os_set = os_map<T, null_type>;

long long count_swaps(vector<int> S)
{
    const size_t n = S.size();

    map<int, set<size_t>> pos;
    for(size_t i = 0; i < n; i++)
        pos[S[i]].insert(i);

    os_set<size_t> erased;
    size_t mex = 0;
    long long result = 0;
    while(erased.size() < n)
    {
        while(erased.find(mex) != erased.end())
            mex++;

        auto it = pos[-S[mex]].begin();
        auto i = *it;

        result += i - (mex + 1) - (erased.order_of_key(i) - erased.order_of_key(mex));

        if(S[mex] > 0)
            result++;
        erased.insert(mex); pos[S[mex]].erase(mex);
        erased.insert(i); pos[-S[mex]].erase(i);
    }

    return result;
}

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