제출 #1140204

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1140204		imarn	Arranging Shoes (IOI19_shoes)	C++20	45 / 100	61 ms	13248 KiB

shoes

#include<bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define plx pair<ll,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vvi vector<vi>
#define pp pair<ll,int>
#define ub(x,i) upper_bound(all(x),i)-x.begin()
#define lb(x,i) lower_bound(all(x),i)-x.begin()
#define t3 tuple<int,int,int>
using namespace std;
const int mxn=2e5+5;
ll fw[mxn]{0};
void add(int i,int amt){
    for(;i<mxn;i+=i&-i)fw[i]+=amt;
}
int qr(int i,int rs=0){
    for(;i;i-=i&-i)rs+=fw[i];
    return rs;
}priority_queue<int,vector<int>,greater<int>>pq,v[mxn];
long long count_swaps(std::vector<int> s){
    int n=s.size();ll ans=0;
    for(int i=0;i<n;i++){
        if(s[i]>0)v[s[i]].push(i);
        else pq.push(i);
    }
    while(!pq.empty()){
        int x=pq.top();pq.pop();
        int y=v[-s[x]].top();v[-s[x]].pop();
        int tx=x+qr(x+1);int ty=y+qr(y+1);
        if(tx<ty)ans+=abs(tx)+abs(ty-1);
        else ans+=abs(tx)+abs(ty);
        add(min(x,y)+1,-1);add(max(x,y)+2,-1);
    }
    return ans;
}

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