제출 #975575

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
975575		marinaluca	Arranging Shoes (IOI19_shoes)	C++14	100 / 100	265 ms	147836 KiB

shoes

#include <bits/stdc++.h>

#pragma GCC optimize ("O4")
#pragma GCC optimize ("fast-math")
#pragma GCC optimize ("unroll-loops")

using namespace std;
//#define int long long
#define ll long long
#define xx first
#define yy second
#define all (x) begin(x), end(x)
#define cin fin
#define cout fout

ll count_swaps(vector <int> s){
    int n = int (s.size());
    unordered_map <int, queue<int>> frec;
    vector <int> bit(n + 1);
    ll cnt = 0;
    for (int i = 0; i < n; ++ i)
    {
        int poz;
        if (frec[-s[i]].empty()){
            poz = i + 1;
            frec[s[i]].push(poz);
        }
        else{
            poz = frec[-s[i]].front();
            frec[-s[i]].pop();
            cnt += i;
            for (int ans = poz; ans; ans -= ans & (-ans))
                cnt -= bit[ans];
            if (s[i] < 0)
                cnt ++;
        }
        for (int ans = poz; ans <= n; ans += ans & (-ans))
            bit[ans] ++;
    }
    return cnt;
}

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