This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
template<class C>constexpr int len(const C&c){return int(c.size());}
const int MAXN = 200005;
int N, bit[MAXN]; long long ans;
void update(int pos, int val){
for(int i = pos; i <= N; i += i & -i) bit[i] += val;
}
int query(int pos){
int tot = 0;
for(int i = pos; i > 0; i &= i - 1) tot += bit[i];
return tot;
}
vector<int> solve(){
int A; cin >> A;
if(A != 0){
update(A, 1);
return {A};
}
vector<int> left = solve(), right = solve();
if(left.size() > right.size()) swap(left, right);
int cur, case1 = 0, case2 = 0;
for(auto i : left) update(i, -1);
for(auto i : left){
cur = query(i);
case1 += cur;
case2 += len(right) - cur;
}
ans += min(case1, case2);
for(auto i : left) update(i, 1), right.push_back(i);
return right;
}
int main(){
cin.sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> N; solve(); cout << ans << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |