제출 #1021190

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1021190		vjudge1	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	1 ms	348 KiB

shoes

#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma GCC target("popcnt")
#define endl '\n'
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fo(i,n) for(auto i =0 ; i < n;i++)
#define fore(i,l,r) for(auto i = l; i < r;i++)
#define forex(i,r,l) for(auto i = r; i >= l; i--)
#define ffo(i,n) forex(i,n-1,0)
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define sz(x) (int)x.size()
#define gcd(a,b) __gcd(a,b)
#define vii vector<ii>
#define pq_min(a) priority_queue<a, vector<a>, greater<a>>
#define fls cout.flush()
using namespace std;
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using ii = pair<int,int>;
using mii = map<int,int>;
using lld = long double;
void valid(ll in){cout<<((in)?"YES\n":"NO\n");}
struct bit{
    vi ft;
    int n;
    bit(int n):n(n){ft.resize(n+2, 0);}
    void update(int i,int v){for(;i<n+2;i+=lsb(i))ft[i]+=v;}
    int query(int i){int r=0;for(;i>0;i-=lsb(i))r+=ft[i];return r;}
    int query(int i, int j){return query(j)-query(i-1);}
};
ll count_swaps(vi a){
    int n = sz(a);
    bit ss(n);
    vector<queue<int>> tneg(n+2), tpos(n+2);
    fo(i,n){
        if(a[i]<0)tneg[a[i]*-1].push(i);
        else tpos[a[i]].push(i);
        ss.update(i+1,+1);
    }
    ll ans = 0;
    fo(i,n){
        if(ss.query(i+1)-ss.query(i)==0)continue;
        // cout << i << " " << a[i] << endl;
        ss.update(i+1, -1);
        int j = 0;
        if(a[i]<0){
            j = tpos[a[i]*-1].front();
            tpos[a[i]].pop();
            tneg[a[i]].pop();
            ans += ss.query(i+1,j+1) - 1;
        }else{
            j = tneg[a[i]].front();
            tneg[a[i]].pop();
            tpos[a[i]].pop();
            ans += ss.query(i+1,j+1);
        }
        ss.update(j+1,-1);
    }
    return ans;
}

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