# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
574343 | Trisanu_Das | Arranging Shoes (IOI19_shoes) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int N = 2e5 + 5;
int n, fenwick[N];
queue<int> shoes_lt[N], shoes_rt[n];
void upd(int i, int val) {
for(int j = i; j <= n; j += j & (-j)) fenwick[i] += val;
}
int get(int i){
int val = 0;
for(int j = i; j > 0; j -= j & (-j)) val += fenwick[i];
return val;
}
ll count_swaps(vector<int> s) {
n = s.size();
int ans = 0;
for(int i = 1; i <= n; i++) {
int temp = s[i - 1];
if(temp < 0) {
temp *= -1;
if(shoes_rt[temp].size()) {
int other = shoes_rt[temp].front(); shoes_rt[temp].pop(); ans += get(i) - get(other - 1); upd(other, 1);
}
else {
shoes_lt[temp].push(i); upd(i, 1);
}
}
else {
if(shoes_lt[temp].size()) {
int other = shoes_lt[temp].front(); shoes_lt[temp].pop(); ans += get(i) - get(other);upd(other,1);
}
else {
shoes_rt[temp].push(i);upd(i, 1);
}
}
}
return ans;
}