Submission #253448

#	Time	Username	Problem	Language	Result	Execution time	Memory
253448		Erkhemkhuu	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	1092 ms	3200 KiB

shoes

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
const ll N = 2005;
int count_swaps(vector <int> vc) {
    ll n, i, res, j, k;
    n = vc.size();
    res = 0;
    for(i = 0; i < n; i += 2) {
        for(j = i + 1; j < n; j++) {
            if(-vc[i] == vc[j]) {
                for(k = j; k >= i + 2; k--) {
                    swap(vc[k], vc[k - 1]);
                    res++;
                }
                break;
            }
        }
        res += (!(abs(vc[i]) == abs(vc[i + 1]) && vc[i] < vc[i + 1]));
    }
    return res;
}

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