Submission #947182

#	Time	Username	Problem	Language	Result	Execution time	Memory
947182		steveonalex	Arranging Shoes (IOI19_shoes)	C++14	100 / 100	255 ms	76260 KiB

shoes

#include <bits/stdc++.h>
#include "shoes.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

struct FenwickTree{
    int n; 
    vector<int> a;

    FenwickTree(int _n){
        n = _n;
        a.resize(n+1);
    }

    void update(int i, int v){
        while(i <= n){
            a[i] += v;
            i += LASTBIT(i);
        }
    }

    int get(int i){
        int ans = 0;
        while(i > 0){
            ans += a[i];
            i -= LASTBIT(i);
        }
        return ans;
    }
};

ll count_swaps(vector<int> a) {
    int n = a.size();
    FenwickTree bit(n);
    for(int i= 1; i<=n; ++i) bit.update(i, 1);

    ll ans = 0;
    map<int, deque<int>> mp;
    for(int i = 0; i<n; ++i){
        int x = abs(a[i]);
        if (mp[x].empty() || a[mp[x].back()] == a[i]){
            mp[x].push_back(i);
        }
        else{
            int j = mp[x].front();
            mp[x].pop_front();

            ans += bit.get(i) - bit.get(j+1);
            bit.update(i+1, -1);
            bit.update(j+1, 1);
            if (a[i] < 0) ans += 1;
        }
    }

    return ans;
}



// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
//     int n; cin >> n;
//     vector<int> a(n);
//     for(int i= 0; i<n; ++i) cin >> a[i];

//     cout << count_swaps(a) << "\n";
 
//     return 0;
// }

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