제출 #405550

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
405550		Tc14	Arranging Shoes (IOI19_shoes)	C++17	45 / 100	338 ms	21660 KiB

shoes

//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "shoes.h"
using namespace std;
#define ve vector
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9 + 10;

struct SegmentTree {

    int Cap;
    ve<int> Seg;

    int left(int x) { return 2 * x; }
    int right(int x) { return 2 * x + 1; }
    int parent(int x) { return x / 2; }

    void build(int a) {
        Cap = 1 << (int)ceil(log2(a));
        Seg = ve<int>(2 * Cap);
    }

    int query(int a, int b) {
        return query(a, b, 0, Cap - 1, 1);
    }

    int query(int a, int b, int i, int j, int curr) {

        if (a <= i && j <= b) return Seg[curr];
        if (b < i || j < a) return 0;

        int m = (i + j) / 2;
        return query(a, b, i, m, left(curr)) + query(a, b, m + 1, j, right(curr));
    }

    void update(int p) {

        Seg[Cap + p] = 1;
        int curr = parent(Cap + p);

        while (curr != 0) {
            Seg[curr] = Seg[left(curr)] + Seg[right(curr)];
            curr = parent(curr);
        }
    }

};

ll count_swaps(ve<int> S) {

    int n;
    ve<int> A;
    map<int, pair<ve<int>, ve<int>>> M;
    SegmentTree Seg;

    n = (int)S.size() / 2;
    A = ve<int>(2 * n);

    int cnt = 0;
    for (int i = 0; i < 2 * n; i++) {
        int s = S[i];
        if (s < 0) {
            M[-s].first.push_back(i);
            A[i] = cnt;
            cnt += 2;
        }
        else M[s].second.push_back(i);
    }

    for (auto x : M) {
        int l = (int)x.second.first.size();
        for (int i = 0; i < l; i++) {
            int a = x.second.first[i];
            int b = x.second.second[i];
            A[b] = A[a] + 1;
        }
    }

    ll ans = 0;
    Seg.build(2 * n);

    for (int i = 0; i < 2 * n; i++) {
        ans += Seg.query(A[i], 2 * n - 1);
        Seg.update(A[i]);
    }

    return ans;
}

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