제출 #545337

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
545337		Jomnoi	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	96 ms	134868 KiB

shoes

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

const int MAX_N = 2e5 + 10;

queue <int> pos[MAX_N];

class FenwickTree {
private :
	int N;
	vector <int> fenwick;
public :
	FenwickTree() {}
	FenwickTree(int n) : N(n), fenwick(N + 1) {}

	void update(int idx, int val) {
		for(int x = idx; x > 0; x -= (x & -x)) {
			fenwick[x] += val;
		}
	}

	int query(int idx) {
		int res = 0;
		for(int x = idx; x <= N; x += (x & -x)) {
			res += fenwick[x];
		}
		return res;
	}
}fw;

long long count_swaps(vector<int> s) {
	int n = s.size() / 2;
	fw = FenwickTree(2 * n);
	for(int i = 0; i < 2 * n; i++) {
		int idx = s[i] + n;
		if(s[i] < 0) {
			idx = -s[i];
		}
		pos[idx].push(i + 1);
	}

	long long ans = 0;
	for(int i = 1; i <= n; i++) {
		while(!pos[i].empty()) {
			if(pos[i].front() < pos[i + n].front()) {
				ans += pos[i + n].front() - pos[i].front() - 1 + fw.query(pos[i].front());
				fw.update(pos[i + n].front(), 1);
				fw.update(pos[i].front() - 1, -1);
			}
			else {
				ans += pos[i].front() - pos[i + n].front() + fw.query(pos[i + n].front());
				fw.update(pos[i].front(), 1);
				fw.update(pos[i + n].front() - 1, -1);
			}
			pos[i].pop();
			pos[i + n].pop();
		}
	}
	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