Submission #675860

#	Time	Username	Problem	Language	Result	Execution time	Memory
675860		Quan2003	Untitled (POI11_rot)	C++17	63 / 100	1083 ms	65536 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz =2e5+1;
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 ans[sz];
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 (stderr)

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

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