oj.uz

Submission #675863

# Submission time Handle Problem Language Result Execution time Memory
675863 2022-12-28T08:38:01 Z Quan2003 Tree Rotations (POI11_rot) C++17
81 / 100
 143 ms 52164 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz =1e6+10;
const int ssz=5e3+1;
const int mod=1e9+7;
int p,n,q,timer,m,cnt;
long long lb,rb; 
queue<int>qe;
int lf[sz],rt[sz];
int lc[sz*40],rc[sz*40];
int cap[sz*40]; 
int val[sz];
int fa[sz];
void read(int &now){
     now = ++cnt;
     scanf("%d",&val[now]);
     if(!val[now]){
         read(lf[now]);
         read(rt[now]); 
     }
}
void upd(int pos,int &num,int l = 1, int r = n){
     if(!num) num = ++timer;
     cap[num] = 1;
     if(l == r) return; 
     int mid = (l + r)>>1;
     if(pos <= mid) upd(pos,lc[num],l,mid);
     else upd(pos,rc[num],mid + 1, r);
}
int merge(int roota, int rootb){
    if(!roota or !rootb) return roota + rootb;
    cap[roota]+=cap[rootb];
    lb += cap[rc[rootb]] * cap[lc[roota]];
    rb += cap[rc[roota]] * cap[lc[rootb]]; 
    lc[roota] = merge(lc[roota],lc[rootb]);
    rc[roota] = merge(rc[roota],rc[rootb]);
    //rootb = 0; 
    return roota;
}
long long dfs(int u){
     long long res = 0;
     if(!val[u]){
          res = dfs(lf[u]) + dfs(rt[u]);
          lb = rb = 0;
          fa[u] = merge(fa[lf[u]],fa[rt[u]]);
          res = res + min(lb,rb);
     }
     else upd(val[u],fa[u]);
     return res; 
}
int main(){
      scanf("%d",&n);
      int root;
      read(root);
      long long res = dfs(root);  
      cout<<res<<endl;
}

Compilation message

rot.cpp: In function 'void read(int&)':
rot.cpp:17:11: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |      scanf("%d",&val[now]);
      |      ~~~~~^~~~~~~~~~~~~~~~
rot.cpp: In function 'int main()':
rot.cpp:53:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   53 |       scanf("%d",&n);
      |       ~~~~~^~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 1 ms 468 KB Output is correct
4 Correct 1 ms 468 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1108 KB Output is correct
2 Correct 2 ms 1108 KB Output is correct
3 Correct 2 ms 1236 KB Output is correct
4 Correct 2 ms 1236 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 3028 KB Output is correct
2 Correct 7 ms 2868 KB Output is correct
3 Correct 19 ms 6820 KB Output is correct
4 Correct 7 ms 3280 KB Output is correct

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 11832 KB Output is correct
2 Correct 27 ms 11904 KB Output is correct
3 Correct 34 ms 13768 KB Output is correct
4 Correct 31 ms 14796 KB Output is correct

Subtask #7
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 22736 KB Output is correct
2 Correct 51 ms 21964 KB Output is correct
3 Correct 71 ms 20668 KB Output is correct
4 Correct 51 ms 21196 KB Output is correct

Subtask #8
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 95 ms 29624 KB Output is correct
2 Correct 95 ms 29548 KB Output is correct
3 Correct 82 ms 31696 KB Output is correct
4 Correct 76 ms 31480 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 44800 KB Output is correct
2 Correct 91 ms 44508 KB Output is correct
3 Correct 135 ms 43484 KB Output is correct
4 Correct 115 ms 43956 KB Output is correct
5 Correct 129 ms 42444 KB Output is correct

Subtask #10
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 136 ms 48252 KB Output is correct
2 Incorrect 127 ms 52164 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 143 ms 50380 KB Output isn't correct
2 Halted 0 ms 0 KB -