제출 #411801

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
411801		timmyfeng	Arranging Shoes (IOI19_shoes)	C++17	100 / 100	640 ms	34528 KiB

shoes

#include <bits/stdc++.h>
using namespace std;
 
#include <bits/extc++.h>
 
template <class T, class Comp = less<T>>
using ordered_set = __gnu_pbds::tree<
    T, __gnu_pbds::null_type, Comp,
    __gnu_pbds::rb_tree_tag,
    __gnu_pbds::tree_order_statistics_node_update
>;
 
long long count_swaps(vector<int> s) {
    int n = s.size() / 2;
 
    map<int, vector<int>> nxt;
    ordered_set<int> shoes;
 
    for (int i = 2 * n - 1; i >= 0; --i) {
        nxt[s[i]].push_back(i);
        shoes.insert(i);
    }
 
    long long ans = 0;
    while (!shoes.empty()) {
        auto i = *shoes.begin();
        shoes.erase(shoes.begin());
 
        int x = s[i];
        nxt[x].pop_back();
 
        int j = nxt[-x].back();
        nxt[-x].pop_back();
 
        ans += shoes.order_of_key(j) + (x > 0);
        shoes.erase(j);
    }
 
    return ans;
}

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