제출 #1237099

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1237099		Ghulam_Junaid	Arranging Shoes (IOI19_shoes)	C++20	45 / 100	268 ms	146604 KiB

shoes

#include <bits/stdc++.h>
#include "shoes.h"
// #include "grader.cpp"
using namespace std;

typedef long long ll;

const int N = 2e5 + 10;
int fen[N];

void add(int p){
    for (int i = p + 1; i < N; i += i & -i)
        fen[i] += 1;
}

int get(int p){
    int res = 0;
    for (int i = p + 1; i > 0; i -= i & -i)
        res += fen[i];
    return res;
}

ll count_swaps(vector<int> s) {
    int n = s.size();

    map<int, queue<int>> inds;
    for (int i = 0; i < n; i ++)
        inds[s[i]].push(i);

    bool mark[n] = {};
    ll ans = 0;
    for (int cur = 0; cur < n; cur ++){
        if (mark[cur]) continue;
        
        int val = s[cur];
        int ind = inds[-val].front();
        inds[-val].pop();

        int del = get(ind) - get(cur);
        ans += ind - cur - 1 - del + (s[cur] > 0);

        mark[ind] = 1;
        add(ind);
    }
	return ans;
}

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