Submission #1209818

#	Time	Username	Problem	Language	Result	Execution time	Memory
1209818		ASGA_RedSea	Arranging Shoes (IOI19_shoes)	C++20	0 / 100	1 ms	324 KiB

shoes

/**

                                    * بسم الله الرحمن الرحيم *

                ﴾ رَبِّ اشْرَحْ لِي صَدْرِي * وَيَسِّرْ لِي أَمْرِي * وَاحْلُلْ عُقْدَةً مِّن لِّسَانِي * يَفْقَهُوا قَوْلِي ﴿

*/

/// author : "ASGA"

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

struct ft{
    vector<ll>f;
    int n;
    ft(int N){
        n=N+1;
        f.assign(n+1,0);
        for(int i=1;i<=n;i++){
            int j=i;
            while(j<=n){
                f[j]++;
                j+=j&-j;
            }
        }
    }

    void edit(int i){
        i++;
        while(i<=n){
            f[i]++;
            i+=i&-i;
        }
    }
    int get(int i){
        ll ret=0;i++;
        while(i){
            ret+=f[i];
            i-=i&-i;
        }
        return ret;
    }
};

ll count_swaps(vector<int>a){
    int n=a.size();
    ll ans=0;

    ft f(n);

    vector<int>pos(n/2+1,0);
    for(int i=0;i<n;i++)pos[abs(a[i])]=i;

    for(int i=0;i<n;i++){
        int j=pos[abs(a[i])];

        if(a[i]<0)ans+=f.get(j-1)-f.get(i);
        else ans+=f.get(j)-f.get(i);

        f.edit(j);
    }

    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