Submission #1206553

#	Time	Username	Problem	Language	Result	Execution time	Memory
1206553		al95ireyiz	Arranging Shoes (IOI19_shoes)	C++20	0 / 100	1 ms	1860 KiB

shoes

//*** Bismillah ***//
#pragma GCC optimize("O3", "fast-math", "unroll-loops", "no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#if !defined(ONLINE_JUDGE) and !defined(EVAL)
#include "template/debug.h"
#else
#define d(x...)
#endif
#define fr first
#define er erase
#define sc second
#define in insert
#define ll long long
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define ull unsigned ll
#define vpll vector<pll>
#define len(x)(ll)x.size()
#define all(x)x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll maxn = 2e5+5;
ll n,m,k=0;
ll fw[maxn];
void upd(ll i, ll val){
    for(; i < maxn; i ++) fw[i] += val;
}
ll get(ll i){
    ll cv = 0;
    for(; i > 0; i --) cv += fw[i];
    return cv;
}
bool vis[maxn];
ll count_swaps(vector<int>v){
    n = len(v);
    ll cv = 0;
    map<ll, queue<ll>>mp;
    for(ll i = 0; i < n; i ++) mp[v[i]].push(i);
    for(ll i = 0; i < n; i ++){
        if(vis[i]) continue;
        mp[v[i]].pop();
        ll w = -v[i];
        ll tr = mp[w].front();
        mp[w].pop();
        cv += tr - i + get(i);
        if(w < v[i]) cv ++;
        upd(i, 1);
        upd(tr, -1);
        vis[tr] = 1;
    }
    return cv;
}
// void _(ll tt){

// }
// signed main(){
//     ll tm=clock();
//     cin.tie(0)->sync_with_stdio(0);
//     ll t=1;
//     // cin>>t;
//     for(ll tt=1;tt<=t;tt++){
//         _(tt);
//     }
//     cerr<<"\n\033[1;31mTime: \033[1;30m" \
//         <<(double)(clock()-tm)/1000000<<"\033[1;32m seconds\n";
// }

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