제출 #868398

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
868398		toma_ariciu	Arranging Shoes (IOI19_shoes)	C++17	100 / 100	113 ms	140628 KiB

shoes

#include "shoes.h"
#include <algorithm>
#include <iostream>
#include <queue>

using namespace std;

class FenwickTree {
private:
    int sz;
    vector <int> v;
    int lsb(int x) {
        return (x & (-x));
    }
public:
    FenwickTree(int n) {
        sz = n;
        v.resize(sz + 1);
    }
    void update(int poz) {
        for (int i = poz; i <= sz; i += lsb(i)) {
            v[i]++;
        }
    }
    int query(int poz) {
        int ans = 0;
        for (int i = poz; i; i -= lsb(i)) {
            ans += v[i];
        }
        return ans;
    }
};

int n;

long long computeInversions(vector <int> v) {
    long long inv = 0;
    FenwickTree aib(2 * n);
    for (int i = 2 * n - 1; i >= 0; i--) {
        inv += aib.query(v[i]);
        aib.update(v[i] + 1);
    }
    return inv;
}


long long count_swaps(vector<int> s) {
    n = (int) s.size() / 2;
    vector <int> v(2 * n);
    vector <queue <int>> q(2 * n + 1);
    int p = 0;
    for (int i = 0; i < 2 * n; i++) {
        if (s[i] > 0) {
            if (!q[n + s[i]].empty()) {
                int poz = q[n + s[i]].front();
                q[n + s[i]].pop();
                v[poz] = p;
                v[i] = p + 1;
                p += 2;
            }
            else {
                q[s[i]].push(i);
            }
        }
        else {
            if (!q[-s[i]].empty()) {
                int poz = q[-s[i]].front();
                q[-s[i]].pop();
                v[poz] = p + 1;
                v[i] = p;
                p += 2;
            }
            else {
                q[n - s[i]].push(i);
            }
        }
    }
    return computeInversions(v);
}

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