제출 #219767

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
219767		VEGAnn	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	8 ms	5120 KiB

shoes

#include <bits/stdc++.h>
#include "shoes.h"
#define all(x) x.begin(),x.end()
#define PB push_back
#define sz(x) ((int)x.size())
using namespace std;
typedef long long ll;
const int N = 200100;
vector<int> vc[N];
ll ans = 0;
int fen[N];
bool mrk[N];

int sum(int x){
    int res = 0;
    for (; x >= 0; x = (x & (x + 1)) - 1)
        res += fen[x];
    return res;
}

void upd(int x){
    for (; x < N; x = (x | (x + 1)))
        fen[x]++;
}

long long count_swaps(std::vector<int> s) {
    int n = sz(s) / 2;

    for (int i = sz(s) - 1; i >= 0; i--)
        vc[s[i] + n].PB(i);

    for (int i = 0; i < sz(s); i++){
        if (mrk[i]) continue;

        if (s[i] > 0)
            ans++;

        vc[s[i] + n].pop_back();

        int real_i = i + sum(i);

        int j = vc[-s[i] + n].back();

        vc[-s[i] + n].pop_back();
        mrk[j] = 1;

        int real_j = sum(j) + j;

        ans += real_j - real_i - 1;

        upd(j);
    }

    return ans;
}

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