oj.uz

답안 #809232

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
809232 2023-08-05T23:03:15 Z ashcomp Sumtree (INOI20_sumtree) C++14
50 / 100
 953 ms 413052 KB 
#include<bits/stdc++.h>

using namespace std;
 
#define all(x) x.begin() , x.end()
#define pii pair<int, int>
#define piii pair<int, pii>
#define pll pair<ll, ll>
#define plll pair<ll, pll>
#define pb push_back
#define qb pop_back
#define F first
#define S second
#define wall cerr<<"--------------------------------------"<<endl
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O2")
 
typedef long long ll;
typedef double db;

const ll INF = 1e9;
const ll maxn = 1e6 + 10;
const ll mod = 1e9 + 7;

ll n , q , k , sz[maxn] , st[maxn] , en[maxn] , h[maxn] , ti=1 , ans;
vector<ll> g[maxn] , ANS; 

ll fac[maxn] , inv[maxn];
ll pw(ll a , ll b)
{
        ll res = 1;
        while(b){
                if(b&1)res = (res*a)%mod;
                b>>=1; a=(a*a)%mod;
        }
        return res;
}
ll choose(ll a , ll b)
{
        if(b>a || b<0)return 0;

        ll A = fac[a];
        ll B = (inv[b] * inv[a-b])%mod;
        ll C = (A*B)%mod;
        return C;
}
void preps()
{
        fac[0] = 1;
        for(ll i=1; i<maxn; i++){
                fac[i] = (fac[i-1] * i)%mod;
        }
        inv[maxn-1] = pw(fac[maxn-1],mod-2);
        for(ll i=maxn-1; i>0; i--){
                inv[i-1] = (inv[i]*i)%mod;
        }
        for(ll i=1; i<maxn; i++){
                sz[i] = 1;
        }
}//ok

void dfs(ll v , ll p)
{
        st[v] = ti++;
        en[v] = st[v];
        for(auto u : g[v]){
                if(u==p)continue;
                h[u] = h[v] + 1;
                dfs(u,v);
                sz[v] += sz[u];
                en[v] = max(en[v],en[u]);
        }
}//ok

struct PAR_segment{
        set<pll> seg[maxn<<2];
        void build(ll tl=1 , ll tr=n , ll v=1)
        {
                seg[v].insert({INF,INF});
                if(tl==tr)return;
                ll mid=(tl+tr)>>1 , ml=(v<<1) , mr=(v<<1)|1;
                build(tl,mid,ml);
                build(mid+1,tr,mr);
        }
        void upd(pll val , ll l , ll r , ll tl=1 , ll tr=n , ll v=1)
        {
                if(l>r)return;
                if(l==tl && r==tr){
                        seg[v].insert(val);
                        return;
                }
                ll mid=(tl+tr)>>1 , ml=(v<<1) , mr=(v<<1)|1;
                upd(val,l,min(r,mid),tl,mid,ml);
                upd(val,max(l,mid+1),r,mid+1,tr,mr);
        }
        void del(pll val , ll l , ll r , ll tl=1 , ll tr=n , ll v=1)
        {
                if(l>r)return;
                if(l==tl && r==tr){
                        seg[v].erase(val);
                        return;
                }
                ll mid=(tl+tr)>>1 , ml=(v<<1) , mr=(v<<1)|1;
                del(val,l,min(r,mid),tl,mid,ml);
                del(val,max(l,mid+1),r,mid+1,tr,mr);
        }
        pll ask(ll pos , ll tl=1 , ll tr=n , ll v=1){
                if(tl==tr){
                        pll res = *seg[v].begin();
                        return res;
                }
                ll mid=(tl+tr)>>1 , ml=(v<<1) , mr=(v<<1)|1;
                pll res = *seg[v].begin() , e;
                if(pos<=mid)e = ask(pos,tl,mid,ml);
                else e = ask(pos,mid+1,tr,mr);
                if(e.F < res.F){
                        return e;
                }else{
                        return res;
                }
        }
};

struct SZ_segment{
        ll fen[maxn];
        void upd(ll pos , ll val)
        {
                for(; pos<=n; pos+=(pos&-pos)){
                        fen[pos]+=val;
                }
        }
        ll find(ll pos)
        {
                ll res = 0;
                for(; pos>0; pos-=(pos&-pos)){
                        res += fen[pos];
                }
                return res;
        }
        ll ask(ll l , ll r)
        {
                return find(r)-find(l-1);
        }

};//ok

PAR_segment Par;
SZ_segment Sz , Val;
ll cnt[maxn] , temp[maxn];

int main()
{
        ios_base::sync_with_stdio(0);cin.tie(NULL);cout.tie(NULL);
        preps();
        cin>>n>>k;
        for(int i=1; i<n; i++){
                ll v,u; cin>>v>>u;
                g[v].push_back(u);
                g[u].push_back(v);
        }
        dfs(1,1);
        /**/
        ans = choose(k+sz[1]-1 , sz[1]-1);
        ANS.push_back(ans);
        Par.build();
        Par.upd({-h[1],1},1,n);
        Sz.upd(st[1],n);
        Val.upd(st[1],k);
        cnt[1] = n;
        temp[1] = k;
        /**/
        cin>>q;
        for(int i=1; i<=q; i++){
                int tp; cin>>tp;
                if(tp==1){
                        ll v,X; cin>>v>>X;
                        X -= Val.ask(st[v],en[v]);
                        Val.upd(st[v],X);
                        ll siz=sz[v] - Sz.ask(st[v],en[v]);
                        Sz.upd(st[v],siz);
                        pll e = Par.ask(st[v]);ll p = e.S;
                        Par.upd({-h[v],v},st[v],en[v]);
                        Val.upd(st[p],-X);
                        Sz.upd(st[p],-siz);
                        //cout<<p<<" , "<<siz<<" , "<<X<<"\n";
                        /**/
                        ll x = choose(temp[p]+cnt[p]-1 , cnt[p]-1);
                        ans = (ans * pw(x,mod-2))%mod;
                        cnt[p] -= siz;
                        cnt[v] += siz;
                        temp[p] -= X;
                        temp[v] += X;
                        x = choose(temp[p]+cnt[p]-1 , cnt[p]-1);
                        ans = (ans * x)%mod;
                        x = choose(temp[v]+cnt[v]-1 , cnt[v]-1);
                        ans = (ans * x)%mod;
                        ANS.push_back(ans);
                        /**/
                }else{
                        ll v; cin>>v;
                        Par.del({-h[v],v},st[v],en[v]);
                        pll e = Par.ask(st[v]);ll p = e.S;
                        ll siz = cnt[v];
                        Val.upd(st[v],-temp[v]);
                        Val.upd(st[p],temp[v]);
                        Sz.upd(st[v],-siz);
                        Sz.upd(st[p],siz);
                        /**/
                        ll x = choose(temp[p]+cnt[p]-1 , cnt[p]-1);
                        ll y = choose(temp[v]+cnt[v]-1 , cnt[v]-1);
                        x = (y*x)%mod;
                        ans = (ans * pw(x,mod-2))%mod;
                        cnt[p] += siz;
                        cnt[v] -= siz;
                        temp[p] += temp[v];
                        temp[v] -= temp[v];
                        x = choose(temp[p]+cnt[p]-1 , cnt[p]-1);
                        ans = (ans * x)%mod;
                        ANS.push_back(ans);
                        /**/
                }
        }
        for(auto u : ANS){
                cout<<u<<"\n";
        }
        return 0;
}
/*
4 3
1 2
2 3
2 4
2
1 3 1
1 2 1

*/
/*

*/
/*
by
          _____                    _____                    _____                    _____                  
         /\    \                  /\    \                  /\    \                  /\    \                 
        /::\    \                /::\    \                /::\____\                /::\    \                
       /::::\    \              /::::\    \              /:::/    /                \:::\    \               
      /::::::\    \            /::::::\    \            /:::/    /                  \:::\    \              
     /:::/\:::\    \          /:::/\:::\    \          /:::/    /                    \:::\    \             
    /:::/__\:::\    \        /:::/__\:::\    \        /:::/____/                      \:::\    \            
   /::::\   \:::\    \       \:::\   \:::\    \      /::::\    \                      /::::\    \           
  /::::::\   \:::\    \    ___\:::\   \:::\    \    /::::::\    \   _____    ____    /::::::\    \          
 /:::/\:::\   \:::\    \  /\   \:::\   \:::\    \  /:::/\:::\    \ /\    \  /\   \  /:::/\:::\    \         
/:::/  \:::\   \:::\____\/::\   \:::\   \:::\____\/:::/  \:::\    /::\____\/::\   \/:::/  \:::\____\        
\::/    \:::\  /:::/    /\:::\   \:::\   \::/    /\::/    \:::\  /:::/    /\:::\  /:::/    \::/    /        
 \/____/ \:::\/:::/    /  \:::\   \:::\   \/____/  \/____/ \:::\/:::/    /  \:::\/:::/    / \/____/         
          \::::::/    /    \:::\   \:::\    \               \::::::/    /    \::::::/    /                  
           \::::/    /      \:::\   \:::\____\               \::::/    /      \::::/____/                   
           /:::/    /        \:::\  /:::/    /               /:::/    /        \:::\    \                   
          /:::/    /          \:::\/:::/    /               /:::/    /          \:::\    \                  
         /:::/    /            \::::::/    /               /:::/    /            \:::\    \                 
        /:::/    /              \::::/    /               /:::/    /              \:::\____\                
        \::/    /                \::/    /                \::/    /                \::/    /                
         \/____/                  \/____/                  \/____/                  \/____/                 
                                                                                                            
*/
//NOGHRE SHODANAM BAD NIST :_)

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 244 ms 281748 KB Output is correct
2 Correct 209 ms 281712 KB Output is correct
3 Correct 228 ms 281720 KB Output is correct
4 Correct 241 ms 281716 KB Output is correct
5 Correct 214 ms 275972 KB Output is correct
6 Correct 104 ms 236004 KB Output is correct
7 Correct 105 ms 235792 KB Output is correct
8 Correct 121 ms 235808 KB Output is correct
9 Correct 229 ms 272512 KB Output is correct
10 Correct 229 ms 272356 KB Output is correct
11 Correct 224 ms 272416 KB Output is correct
12 Correct 210 ms 270552 KB Output is correct
13 Correct 205 ms 277924 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 102 ms 235100 KB Output is correct
2 Correct 105 ms 235196 KB Output is correct
3 Correct 103 ms 235192 KB Output is correct
4 Correct 108 ms 235100 KB Output is correct
5 Correct 109 ms 235280 KB Output is correct
6 Correct 107 ms 235724 KB Output is correct
7 Correct 106 ms 235644 KB Output is correct
8 Correct 108 ms 235748 KB Output is correct
9 Correct 108 ms 235976 KB Output is correct
10 Correct 111 ms 236128 KB Output is correct
11 Correct 111 ms 236244 KB Output is correct
12 Correct 109 ms 236008 KB Output is correct
13 Correct 116 ms 236076 KB Output is correct
14 Correct 115 ms 236128 KB Output is correct
15 Correct 110 ms 236320 KB Output is correct
16 Correct 109 ms 235980 KB Output is correct
17 Correct 110 ms 236056 KB Output is correct
18 Correct 108 ms 235748 KB Output is correct
19 Correct 110 ms 236036 KB Output is correct
20 Correct 107 ms 235624 KB Output is correct
21 Correct 106 ms 235704 KB Output is correct
22 Correct 103 ms 235272 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 261 ms 290684 KB Output is correct
2 Correct 288 ms 298160 KB Output is correct
3 Correct 259 ms 291980 KB Output is correct
4 Correct 428 ms 311020 KB Output is correct
5 Correct 953 ms 362364 KB Output is correct
6 Correct 107 ms 236488 KB Output is correct
7 Correct 107 ms 235888 KB Output is correct
8 Correct 108 ms 236300 KB Output is correct
9 Correct 416 ms 292284 KB Output is correct
10 Correct 378 ms 289148 KB Output is correct
11 Correct 357 ms 288068 KB Output is correct
12 Correct 389 ms 289888 KB Output is correct
13 Correct 745 ms 413008 KB Output is correct
14 Correct 739 ms 412932 KB Output is correct
15 Correct 744 ms 413052 KB Output is correct
16 Correct 756 ms 413008 KB Output is correct
17 Correct 794 ms 412940 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 497 ms 282572 KB Output is correct
2 Correct 477 ms 282176 KB Output is correct
3 Correct 472 ms 282428 KB Output is correct
4 Correct 541 ms 282544 KB Output is correct
5 Correct 468 ms 279952 KB Output is correct
6 Correct 464 ms 282440 KB Output is correct
7 Correct 374 ms 260720 KB Output is correct
8 Correct 370 ms 260664 KB Output is correct
9 Correct 509 ms 282404 KB Output is correct
10 Correct 541 ms 282304 KB Output is correct
11 Correct 472 ms 282304 KB Output is correct
12 Correct 374 ms 260652 KB Output is correct
13 Incorrect 277 ms 256584 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 244 ms 281748 KB Output is correct
2 Correct 209 ms 281712 KB Output is correct
3 Correct 228 ms 281720 KB Output is correct
4 Correct 241 ms 281716 KB Output is correct
5 Correct 214 ms 275972 KB Output is correct
6 Correct 104 ms 236004 KB Output is correct
7 Correct 105 ms 235792 KB Output is correct
8 Correct 121 ms 235808 KB Output is correct
9 Correct 229 ms 272512 KB Output is correct
10 Correct 229 ms 272356 KB Output is correct
11 Correct 224 ms 272416 KB Output is correct
12 Correct 210 ms 270552 KB Output is correct
13 Correct 205 ms 277924 KB Output is correct
14 Correct 102 ms 235100 KB Output is correct
15 Correct 105 ms 235196 KB Output is correct
16 Correct 103 ms 235192 KB Output is correct
17 Correct 108 ms 235100 KB Output is correct
18 Correct 109 ms 235280 KB Output is correct
19 Correct 107 ms 235724 KB Output is correct
20 Correct 106 ms 235644 KB Output is correct
21 Correct 108 ms 235748 KB Output is correct
22 Correct 108 ms 235976 KB Output is correct
23 Correct 111 ms 236128 KB Output is correct
24 Correct 111 ms 236244 KB Output is correct
25 Correct 109 ms 236008 KB Output is correct
26 Correct 116 ms 236076 KB Output is correct
27 Correct 115 ms 236128 KB Output is correct
28 Correct 110 ms 236320 KB Output is correct
29 Correct 109 ms 235980 KB Output is correct
30 Correct 110 ms 236056 KB Output is correct
31 Correct 108 ms 235748 KB Output is correct
32 Correct 110 ms 236036 KB Output is correct
33 Correct 107 ms 235624 KB Output is correct
34 Correct 106 ms 235704 KB Output is correct
35 Correct 103 ms 235272 KB Output is correct
36 Correct 261 ms 290684 KB Output is correct
37 Correct 288 ms 298160 KB Output is correct
38 Correct 259 ms 291980 KB Output is correct
39 Correct 428 ms 311020 KB Output is correct
40 Correct 953 ms 362364 KB Output is correct
41 Correct 107 ms 236488 KB Output is correct
42 Correct 107 ms 235888 KB Output is correct
43 Correct 108 ms 236300 KB Output is correct
44 Correct 416 ms 292284 KB Output is correct
45 Correct 378 ms 289148 KB Output is correct
46 Correct 357 ms 288068 KB Output is correct
47 Correct 389 ms 289888 KB Output is correct
48 Correct 745 ms 413008 KB Output is correct
49 Correct 739 ms 412932 KB Output is correct
50 Correct 744 ms 413052 KB Output is correct
51 Correct 756 ms 413008 KB Output is correct
52 Correct 794 ms 412940 KB Output is correct
53 Correct 497 ms 282572 KB Output is correct
54 Correct 477 ms 282176 KB Output is correct
55 Correct 472 ms 282428 KB Output is correct
56 Correct 541 ms 282544 KB Output is correct
57 Correct 468 ms 279952 KB Output is correct
58 Correct 464 ms 282440 KB Output is correct
59 Correct 374 ms 260720 KB Output is correct
60 Correct 370 ms 260664 KB Output is correct
61 Correct 509 ms 282404 KB Output is correct
62 Correct 541 ms 282304 KB Output is correct
63 Correct 472 ms 282304 KB Output is correct
64 Correct 374 ms 260652 KB Output is correct
65 Incorrect 277 ms 256584 KB Output isn't correct
66 Halted 0 ms 0 KB -