제출 #690964

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
690964		finn__	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	1 ms	260 KiB

shoes

#include <bits/stdc++.h>
using namespace std;

#include "shoes.h"

long long count_swaps(vector<int> s)
{
    size_t const n = s.size();
    vector<bool> processed(n, 0);
    vector<priority_queue<unsigned, vector<unsigned>, greater<unsigned>>> q(n);
    for (unsigned i = 0; i < n; i++)
        q[2 * (abs(s[i]) - 1) + (s[i] < 0)].push(i);

    long long swaps_needed = 0;
    for (unsigned i = 0; i < n; i++)
    {
        if (!processed[i])
        {
            processed[i] = 1;
            while (processed[q[2 * (abs(s[i]) - 1) + (s[i] > 0)].top()])
                q[2 * (abs(s[i]) - 1) + (s[i] > 0)].pop();
            unsigned j = q[2 * (abs(s[i]) - 1) + (s[i] > 0)].top();
            q[2 * (abs(s[i]) - 1) + (s[i] > 0)].pop();
            processed[j] = 1;
            swaps_needed += j - i - (s[i] < 0);
        }
    }

    return swaps_needed;
}

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