제출 #991364

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
991364		amine_aroua	Arranging Shoes (IOI19_shoes)	C++17	45 / 100	168 ms	19912 KiB

shoes

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include <cstdio>
#include <cassert>
#define Int long long
#define fore(i , n) for(int i = 0 ; i<n;i++)
#define pb push_back
#define forn(i , x , y) for(int i = x ; i >= y; i--)
Int swaps(vector<int> a , vector<int> b)
{
    map<Int , vector<Int>> pos;
    Int m = (Int)a.size();
    fore(i , m)
    {
        pos[a[i]].pb(i);
    }
    Tree<Int> t;
    Int ans = 0;
    forn(i , m - 1 , 0)
    {
        t.insert(pos[b[i]].back());
        ans+=(Int)t.order_of_key(pos[b[i]].back());
        pos[b[i]].pop_back();
    }
    return ans;
}
Int count_swaps(vector<int> s)
{
    vector<int> t;
    for(auto &x : s)
    {
        if((int)t.size() % 2 == 0)
            t.pb(0);
        else
            t.pb(1);
        if(x < 0)
            x = 0;
        else
            x = 1;
    }
    return swaps(s , t);
}
//int main() {
//    int n;
//    assert(1 == scanf("%d", &n));
//    vector<int> S(2 * n);
//    for (int i = 0; i < 2 * n; i++)
//        assert(1 == scanf("%d", &S[i]));
//    fclose(stdin);
//
//    long long result = count_swaps(S);
//
//    printf("%lld\n", result);
//    fclose(stdout);
//    return 0;
//}

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