#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
const int MAXN=4*1e5;
vector<vector<int>> graph(MAXN+1);
vector<vector<int>> leaf(MAXN+1);
int seg[MAXN]={0};
int n;
int ptr=0;
long long ans=0;
void build(int l,int r){
l+=n,r+=n;
while(l>1){
l>>=1,r>>=1;
for(int v=l;v<=r;v++){
seg[v]=seg[v<<1]+seg[(v<<1)|1];
}
}
}
void modify(int i,int x){
i+=n;
seg[i]+=x;
build(i-n,i-n);
}
long long query(int l,int r){
if(l>r){
return 0;
}
l+=n,r+=n;
int curr=0;
for(;l<=r;l>>=1,r>>=1){
if(l&1){
curr+=seg[l];
l++;
}
if(!(r&1)){
curr+=seg[r];
r--;
}
}
return curr;
}
void DFS(int u,int p,bool keep){
int big=-1;
long long inver=0;
long long tot=0;
for(int i=0;i<graph[u].size();i++){
int v=graph[u][i];
if(v!=p&&(big==-1||leaf[big].size()<leaf[v].size())){
big=v;
}
}
if(big==-1){
leaf[u].push_back(u);
modify(u-1,1);
}
else{
for(int i=0;i<graph[u].size();i++){
int v=graph[u][i];
if(v!=p&&v!=big){
DFS(v,u,false);
}
}
DFS(big,u,true);
tot=leaf[big].size();
swap(leaf[u],leaf[big]);
for(int i=0;i<graph[u].size();i++){
int v=graph[u][i];
if(v!=p&&v!=big){
tot*=((long long)(leaf[v].size()));
for(int j=0;j<leaf[v].size();j++){
int temp=leaf[v][j];
inver+=query(temp,n-1);
}
}
}
for(int i=0;i<graph[u].size();i++){
int v=graph[u][i];
if(v!=p&&v!=big){
while(!leaf[v].empty()){
leaf[u].push_back(leaf[v].back());
modify(leaf[v].back()-1,1);
leaf[v].pop_back();
}
}
}
}
ans+=min(inver,tot-inver);
if(!keep){
for(int i=0;i<leaf[u].size();i++){
modify(leaf[u][i]-1,-1);
}
}
}
vector<int> input;
int tim;
int Buildtree(){
if(input[ptr]!=0){
ptr++;
return input[ptr-1];
}
ptr++;
int u=tim;
tim++;
int v=Buildtree();
graph[u].push_back(v);
graph[v].push_back(u);
v=Buildtree();
graph[u].push_back(v);
graph[v].push_back(u);
return u;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
tim=n+1;
cin.ignore();
string line;
while(getline(cin,line)){
if(line.empty()){
break;
}
stringstream ss;
ss << line;
int x=0;
ss >> x;
input.push_back(x);
}
int root=Buildtree();
DFS(root,-1,true);
cout << ans;
}
Compilation message
rot.cpp: In function 'void DFS(int, int, bool)':
rot.cpp:47:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
47 | for(int i=0;i<graph[u].size();i++){
| ~^~~~~~~~~~~~~~~~
rot.cpp:58:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
58 | for(int i=0;i<graph[u].size();i++){
| ~^~~~~~~~~~~~~~~~
rot.cpp:67:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
67 | for(int i=0;i<graph[u].size();i++){
| ~^~~~~~~~~~~~~~~~
rot.cpp:71:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
71 | for(int j=0;j<leaf[v].size();j++){
| ~^~~~~~~~~~~~~~~
rot.cpp:77:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
77 | for(int i=0;i<graph[u].size();i++){
| ~^~~~~~~~~~~~~~~~
rot.cpp:90:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
90 | for(int i=0;i<leaf[u].size();i++){
| ~^~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
19032 KB |
Output is correct |
| 2 |
Correct |
8 ms |
19032 KB |
Output is correct |
| 3 |
Correct |
8 ms |
19036 KB |
Output is correct |
| 4 |
Correct |
8 ms |
19232 KB |
Output is correct |
| 5 |
Correct |
12 ms |
19032 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
19032 KB |
Output is correct |
| 2 |
Correct |
9 ms |
19036 KB |
Output is correct |
| 3 |
Correct |
9 ms |
19036 KB |
Output is correct |
| 4 |
Correct |
9 ms |
19260 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
19292 KB |
Output is correct |
| 2 |
Correct |
11 ms |
19288 KB |
Output is correct |
| 3 |
Correct |
10 ms |
19288 KB |
Output is correct |
| 4 |
Correct |
16 ms |
19804 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
260 ms |
32848 KB |
Output is correct |
| 2 |
Correct |
19 ms |
20056 KB |
Output is correct |
| 3 |
Correct |
286 ms |
35156 KB |
Output is correct |
| 4 |
Correct |
379 ms |
38224 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1008 ms |
61284 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
179 ms |
29140 KB |
Output is correct |
| 2 |
Execution timed out |
1054 ms |
64212 KB |
Time limit exceeded |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1059 ms |
65536 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1039 ms |
61996 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
941 ms |
65536 KB |
Execution killed with signal 9 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1086 ms |
63732 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1058 ms |
61388 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
