제출 #1314260

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1314260		haithamcoder	Arranging Shoes (IOI19_shoes)	C++20	0 / 100	1095 ms	332 KiB

shoes

#include "shoes.h"
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
typedef long long ll;

using namespace __gnu_pbds;

typedef tree<
    ll, 
    null_type, 
    less<ll>, 
    rb_tree_tag, 
    tree_order_statistics_node_update
> ordered_set;

long long count_swaps(std::vector<int> a) {
    ll n = a.size() / 2;

    map<ll, ll> mp;
    for (ll i = 0; i < n; i++) {
        mp[a[i]] = i;
    }

    ordered_set s;
    for (ll i = 0; i < 2 * n; i++) {
        s.insert(i);
    }

    ll res = 0;
    while (s.size()) {
        auto x = *s.begin();
        ll sz = a[x];
        ll other = mp[-sz];
        res += s.order_of_key(other) - (sz < 0);
        s.erase(mp[sz]);
        s.erase(mp[-sz]);
    }
    
    return res;
}

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