//gm --- akezhon
#include <bits/stdc++.h>
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define int long long
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define tm (tl+tr)/2
#define TL v+v, tl, tm
#define TR v+v+1, tm+1, tr
#define DA l <= tl && tr <= r
#define NET r < tl || tr < l
#define double long double
using namespace std;
const int N=2e6+7;
const int inf=1e9;
int c[N], tin[N], tout[N], eul[N], sz[N], t[N*4], l[N], r[N], szz, a, b;
vector <pair<int*, int>> rb;
int n, timer, ans;
void roll(int &x){
rb.push_back({&x, x});
}
void tupd(int pos, int val, int v=1, int tl=1, int tr=n){
// roll(t[v]);
if(tl == tr){
t[v] = val;
return;
}
if(pos <= tm)tupd(pos, val, TL);
else tupd(pos, val, TR);
t[v] = t[v+v] + t[v+v+1];
}
int get(int l, int r, int v=1, int tl=1, int tr=n){
if(NET)return 0;
if(DA)return t[v];
return get(l, r, TL) + get(l, r, TR);
}
void calc(int v){
if(c[v]){
a += get(1, c[v]-1);
b += get(c[v]+1, n);
}else{
calc(l[v]);
calc(r[v]);
}
}
void add(int v, int x){
if(c[v]){
tupd(c[v], x);
}else{
add(l[v], x);
add(r[v], x);
}
}
void go(int v=1, int cl=0){
if(c[v]){
if(cl==0)tupd(c[v], 1);
return;
}
if(sz[l[v]] > sz[r[v]]){
swap(l[v], r[v]);
}
go(l[v], 1);
go(r[v], 0);
a=0, b=0;
calc(l[v]);
ans += min(a, b);
if(cl)add(r[v], 0);
else add(l[v], 1);
}
void rec(){
cin >> c[szz];
if(c[szz]){
sz[szz] = 1;
}
else{
int v = szz;
l[v] = ++szz;
rec();
sz[v] += sz[l[v]];
r[v] = ++szz;
rec();
sz[v] += sz[r[v]];
}
}
void AlemAmenov(){
cin >> n;
szz=1;
rec();
go();
cout << ans;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
// freopen("promote.in", "r", stdin);
// freopen("promote.out", "w", stdout);
int RealName=1;
// cin >> RealName;
// int C=0;
while(RealName--){
// cout << "Case " << ++C << ":\n";
AlemAmenov();
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
8536 KB |
Output is correct |
2 |
Correct |
1 ms |
8540 KB |
Output is correct |
3 |
Correct |
1 ms |
8536 KB |
Output is correct |
4 |
Correct |
1 ms |
8540 KB |
Output is correct |
5 |
Correct |
1 ms |
8540 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
8540 KB |
Output is correct |
2 |
Correct |
1 ms |
8540 KB |
Output is correct |
3 |
Correct |
1 ms |
8540 KB |
Output is correct |
4 |
Correct |
1 ms |
8540 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
8540 KB |
Output is correct |
2 |
Correct |
2 ms |
8540 KB |
Output is correct |
3 |
Correct |
2 ms |
8540 KB |
Output is correct |
4 |
Correct |
2 ms |
8540 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
8796 KB |
Output is correct |
2 |
Correct |
6 ms |
8540 KB |
Output is correct |
3 |
Correct |
3 ms |
8796 KB |
Output is correct |
4 |
Correct |
3 ms |
8796 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
9308 KB |
Output is correct |
2 |
Correct |
27 ms |
10844 KB |
Output is correct |
3 |
Correct |
81 ms |
10872 KB |
Output is correct |
4 |
Correct |
15 ms |
11096 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
128 ms |
12892 KB |
Output is correct |
2 |
Correct |
62 ms |
13856 KB |
Output is correct |
3 |
Correct |
73 ms |
14504 KB |
Output is correct |
4 |
Correct |
65 ms |
14316 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
47 ms |
19036 KB |
Output is correct |
2 |
Correct |
84 ms |
17232 KB |
Output is correct |
3 |
Correct |
139 ms |
18004 KB |
Output is correct |
4 |
Correct |
82 ms |
17244 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
142 ms |
17508 KB |
Output is correct |
2 |
Correct |
118 ms |
19284 KB |
Output is correct |
3 |
Correct |
105 ms |
22724 KB |
Output is correct |
4 |
Correct |
107 ms |
22620 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
471 ms |
25468 KB |
Output is correct |
2 |
Correct |
253 ms |
27732 KB |
Output is correct |
3 |
Correct |
221 ms |
24192 KB |
Output is correct |
4 |
Correct |
290 ms |
25740 KB |
Output is correct |
5 |
Correct |
570 ms |
24828 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
238 ms |
24156 KB |
Output is correct |
2 |
Correct |
254 ms |
33016 KB |
Output is correct |
3 |
Correct |
311 ms |
28052 KB |
Output is correct |
4 |
Correct |
188 ms |
29844 KB |
Output is correct |
5 |
Correct |
695 ms |
27200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
272 ms |
25940 KB |
Output is correct |
2 |
Correct |
230 ms |
30176 KB |
Output is correct |
3 |
Correct |
515 ms |
28988 KB |
Output is correct |
4 |
Correct |
322 ms |
27796 KB |
Output is correct |
5 |
Correct |
173 ms |
31912 KB |
Output is correct |
6 |
Correct |
743 ms |
27252 KB |
Output is correct |