Submission #601639

#	Time	Username	Problem	Language	Result	Execution time	Memory
601639		Minindu2006	Arranging Shoes (IOI19_shoes)	C++14	65 / 100	1085 ms	2988 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;

ll count_swaps(vector<int> s)
{
    ll n = s.size() / 2;
    if (n == 1)
        return s[0] > 0;
    int isb4 = 1;
    for (int i = 0; i < n; i++)
    {
        if (s[i] != -s[i + n] || s[i] > 0)
        {
            isb4 = 0;
            break;
        }
    }
    if (isb4)
        return n * (n - 1) / 2;

    ll pos = 0, ans = 0;
    while (pos < 2 * n)
    {
        if (s[pos] > 0)
        {
            int i;
            for (i = pos + 1; i < 2 * n; i++)
                if (s[i] == -s[pos])
                    break;
            int num = s[i];
            s.erase(s.begin() + i);
            s.insert(s.begin() + pos, num);
            ans += (i - pos);
        }
        else if (s[pos] + s[pos + 1] != 0)
        {
            int i;
            for (i = pos + 2; i < 2 * n; i++)
                if (s[i] == -s[pos])
                    break;
            int num = s[i];
            s.erase(s.begin() + i);
            s.insert(s.begin() + pos + 1, num);
            ans += (i - pos - 1);
        }
        // cout << s[pos] << " " << s[pos + 1] << '\n';
        pos += 2;
        
    }
    return ans;
}

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