Submission #1020215

#	Time	Username	Problem	Language	Result	Execution time	Memory
1020215		abdelhakim	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	1096 ms	7368 KiB

shoes

#include <bits/stdc++.h>
#define mod 1000000007LL
#define inf 1e17
#define ll long long
using namespace std;

void printvec(vector<int> vec)
{
    for (auto &&e : vec)
    {
        cout << e << ' ';
    }
    cout << endl;
}

ll count_swaps(vector<int> s)
{
    ll n = s.size()/2;
    ll ans = inf;
    vector<pair<ll,ll>> perm;
    for (int i = 0; i < 2*n; i++)
    {
        if(s[i] > 0)
        {
            perm.push_back({-s[i], s[i]});
        }
    }
    sort(perm.begin(), perm.end());
    vector<int> temp = s;
    do
    {
        s = temp;
        ll subans = 0;
        vector<int> v;
        for (int i = 0; i < n; i++)
        {
            v.push_back(perm[i].first);
            v.push_back(perm[i].second);
        }
        for (int i = 0; i < 2*n; i++)
        {
            if(s[i]!=v[i])
            {
                for (int j = i+1; j < 2*n; j++)
                {
                    if(v[j] == s[j-1] && s[j]!=s[j-1]){swap(s[j], s[j-1]);subans++;i=-1;break;}
                    swap(s[j], s[j-1]);
                    if(s[j]!=s[j-1]) subans++;
                }
            }
        }
        ans = min(ans, subans);
    } while (next_permutation(perm.begin(), perm.end()));
   return ans; 
}

// int main()
// {
//     cout << count_swaps({-1,1,-1,-1,-1,1,1,1}) << endl;
// }

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