제출 #822760

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
822760		vjudge1	Arranging Shoes (IOI19_shoes)	C++14	65 / 100	751 ms	150176 KiB

shoes

#include<bits/stdc++.h>
#include "shoes.h"
#define fi first
#define se second
#define ll long long
using namespace std ;
const ll N = (1 << 17) ;
ll sum[2 * N + 1], psh[2 * N + 1] ;
void push(ll l, ll r, ll v)
{
    if(!psh[v])
        return ;
    ll num = psh[v] ;
    psh[v] &= 0 ;
    sum[v] += num * (r - l + 1) ;
    if(l == r)
        return ;
    psh[v * 2] += num ;
    psh[v * 2 + 1] += num ;
}
void update(ll l, ll r, ll l1, ll r1, ll num, ll v)
{
    push(l, r, v) ;
    if(l > r1 || r < l1)
        return ;
    if(l1 <= l && r <= r1)
    {
        psh[v] = num ;
        push(l, r, v) ;
        return ;
    }
    ll mid = (l + r) >> 1 ;
    update(l, mid, l1, r1, num, v * 2) ;
    update(mid + 1, r, l1, r1, num, v * 2 + 1) ;
    sum[v] = sum[v * 2] + sum[v * 2 + 1] ;
}
ll get_sum(ll l, ll r, ll ind, ll v)
{
    push(l, r, v) ;
    if(l > ind || r < ind)
        return 0 ;
    if(l == r)
        return sum[v] ;
    ll mid = (l + r) >> 1 ;
    return get_sum(l, mid, ind, v * 2) + get_sum(mid + 1, r, ind, v * 2 + 1) ;
}
ll count_swaps(vector<int> v)
{
    ll ans = 0 ;
    bool us[v.size() + 1] = {} ;
    map<ll, deque<ll>> mp ;
    ll n = v.size() ;
    for(ll i = 0 ; i < n ; i++)
        mp[v[i]].push_back(i) ;
//    cout << "grya\n" ;
    for(ll i = 0 ; i < n ; i++)
    {
        if(us[i])
            continue ;
        mp[v[i]].pop_front() ;
        ll ind1 = i, ind2 = mp[-v[i]][0] ;
//        cout<<ind1<<' '<<ind2<<'\n' ;
        us[ind1] = 1 ;
        us[ind2] = 1 ;
        mp[-v[i]].pop_front() ;
        update(0, N - 1, ind1 + 1, ind2 - 1, 1, 1) ;
        ind1 += get_sum(0, N - 1, ind1, 1) ;
        ind2 += get_sum(0, N - 1, ind2, 1) ;
        if(v[i] > 0)
            ans += ind2 - ind1 ;
        else
            ans += ind2 - ind1 - 1 ;
    }
    return ans ;
}
//signed main()
//{
//    ios_base::sync_with_stdio( 0 ) ;
//    cin.tie( 0 ) ;
//    cout.tie( 0 ) ;
//    ll n ;
//    cin >> n ;
//    vector<ll> v(n) ;
//    for(ll i = 0 ; i < n ; i++)
//        cin >> v[i] ;
//    cout << count_swaps(v) ;
//    return 0 ;
//}

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