Submission #530847

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

shoes

#include "shoes.h"
#include <bits/stdc++.h>

#define sz(x) (int)(x).size()
#define forn(i, x) for (int i = 0; i < (int)x; i++)
#define pb push_back
#define rforn(i, x) for (int i = (int)x - 1; i >= 0; i--)
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define ff first
#define ss second

using namespace std;

template<class T>
void print(T a) {
    for (auto x : a)
        cout << x << ' ';
    cout << endl;
}

//signed main() {
    //freopen("test.txt", "r", stdin);

    // int n;
    // cin >> n;
    // vector<int> a(n * 2);
    // forn (i, n * 2)
    // 	cin >> a[i];
long long count_swaps(vector<int> S) {
	vector<int> a = S;
	int n = sz(a);

    map<int, int> scores;
    map<int, int> prev;

    long long ans = 0;
    forn (i, 2 * n) {
    	int val = a[i];
    	scores[abs(val)]++;

		if (scores[abs(val)] % 2 == 0) {
			ans += i - prev[abs(val)];
			if (val > 0)
				ans--;
		} else {
			prev[abs(val)] = i;
		}
    }
    return ans;
    //cout << ans << '\n';

    //return 0;
}

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