Submission #797481

#	Time	Username	Problem	Language	Result	Execution time	Memory
797481		Liudas	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	1 ms	300 KiB

shoes

#include <bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int> S){
    long long N = S.size();
    map<int, queue<int>> arr;
    set<int> left;
    long long ans = 0;
    for(int i = 0; i < N; i ++){
        left.insert(i);
        arr[S[i]].push(i);
    }
    for(int i = 0; i < N / 2; i ++){
        int s = *left.begin();
        left.erase(s);
        int b = arr[-S[s]].front();
        left.erase(b);
        arr[S[s]].pop();
        arr[-S[s]].pop();
        if(S[s] > 0){
            ans += b - s;
        }
        else{
            ans += b - s - 1;
        }
    }
    return ans;
}

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