Submission #1039977

#	Time	Username	Problem	Language	Result	Execution time	Memory
1039977		LaMatematica14	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	1101 ms	140112 KiB

shoes

#include <bits/stdc++.h>
using namespace std;

long long count_swaps(vector<int> S) {
    int n = S.size();
    vector<queue<long long>> a(n);
    vector<long long> pa(n);
	long long tot = 0;
	long long att = 0;
	for (long long i = 0; i < n; i++) {
		if (S[i] < 0) {
			pa[i] = att;
            a[-S[i]].push(att);
			att += 2;
		}
	}
    for (long long i = 0; i < n; i++) {
        if (S[i] > 0) {
            pa[i] = a[S[i]].front()+1;
            a[S[i]].pop();
        }
    }
    for (long long i = 0; i < n; i++) {
        for (long long j = i+1; j < n; j++) {
            if (pa[i] > pa[j]) tot++;
        }
    }
	return tot;
}

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