Submission #287817

#	Time	Username	Problem	Language	Result	Execution time	Memory
287817		zecookiez	Untitled (POI11_rot)	C++14	36 / 100	1094 ms	24824 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace std;
using namespace __gnu_pbds;
template<class C>constexpr int len(const C&c){return int(c.size());}
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int MAXN = 200005;
int N; long long ans;

ordered_set solve(){
    int A; cin >> A;
    if(A != 0){
        ordered_set arr; arr.insert(A);
        return arr;
    }
    ordered_set left = solve(), right = solve();
    if(left.size() > right.size()) swap(left, right);
    long long case1 = 0, case2 = 0;
    for(auto i : left){
        case1 += right.order_of_key(i);
        case2 += len(right) - right.order_of_key(i);
    }
    ans += min(case1, case2);
    for(auto i : left) right.insert(i);
    return right;
}

int main(){
    cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> N; solve(); cout << ans << '\n';
    return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 9 / 9
• Subtask 3: 9 / 9
• Subtask 4: 9 / 9
• Subtask 5: 0 / 9
• Subtask 6: 0 / 9
• Subtask 7: 0 / 9
• Subtask 8: 0 / 9
• Subtask 9: 0 / 9
• Subtask 10: 0 / 9
• Subtask 11: 0 / 10