Submission #574345

#	Time	Username	Problem	Language	Result	Execution time	Memory
574345		Trisanu_Das	Arranging Shoes (IOI19_shoes)	C++17	0 / 100	173 ms	269520 KiB

shoes

#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;
}

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