Submission #296716

#TimeUsernameProblemLanguageResultExecution timeMemory
296716MilosMilutinovicArranging Shoes (IOI19_shoes)C++14
10 / 100
1087 ms3828 KiB
#include <bits/stdc++.h>
#include "shoes.h"

using namespace std;

long long count_swaps(vector<int> a) {
    long long ans = 0;
    int n = a.size();
    vector<int> b;
    for (int i = 0; i < n; i++) {
        if (a[i] > 0) {
            b.push_back(a[i]);
        }
    }
    sort(b.rbegin(), b.rend());
    int j = 0;
    for (int i = 0; i < n; i++) {
        if (i > 0 && i % 2 == 0) {
            j++;
        }
        int x = b[j];
        if (i % 2 == 0) {
            x = -x;
        }
        for (int j = i; j < n; j++) {
            if (a[j] == x) {
                while (j >= i + 1) {
                    ans++;
                    swap(a[j], a[j - 1]);
                    j--;
                }
                break;
            }
        }
    }
    /*cout << endl;
    for (int i = 0; i < n; i++) {
        cout << a[i] << " ";
    }*/
    return ans;
}

/*int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i];
    }
    cout << count_swaps(n, a) << '\n';
    return 0;
}*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...