Submission #694854

#	Time	Username	Problem	Language	Result	Execution time	Memory
694854		allin27x	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	1 ms	340 KiB

shoes

#include <iostream>
#include <vector>
using namespace std;
using ll = long long int;
ll count_swaps(vector<int> S){
    ll res = 0;
    ll n = S.size();
    vector<ll> s(n,0);
    vector<bool> ac(n,1);
    for (ll i=0; i<n; i++){
        if (!ac[i]) continue;
        for (ll j=i+1; j<n; j++){
            if (!ac[j] || abs(S[j])!=abs(S[i])) continue;
            ac[j] = 0;
            ac[i] = 0;
            if (S[i]<0) res+=j-i-1; else res+=j-i; break;
        }
    }
    return res;
}

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