oj.uz

답안 #203683

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
203683 2020-02-21T20:03:16 Z mayhoubsaleh Putovanje (COCI20_putovanje) C++14
110 / 110
 336 ms 25336 KB 
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define left 2*i+1
#define righ 2*i+2
#define mid (l+r)/2


using namespace std;
ll n,cnt;ll ans;
const ll mxs=2e5+1000;
ll dep[mxs],head[mxs],ed[mxs][4],lazy[4*mxs],st[4*mxs],par[mxs];
vector<ll>v[mxs];
ll heavy[mxs];
ll dfs(ll nod,ll fat){
    par[nod]=fat;
    dep[nod]=1+dep[fat];
    ll mx=-1;
    ll sz=1;
    for(auto x:v[nod]){
        if(x==fat)continue;
        ll cursz=dfs(x,nod);
        sz+=cursz;
        if(cursz>mx){
            mx=cursz;
            heavy[nod]=x;
        }
    }
    return sz;
}

ll pos[mxs];

void dec(ll nod,ll h){
    pos[nod]=cnt++;
    head[nod]=h;
    if(heavy[nod]){
        dec(heavy[nod],h);
    }
    for(auto x:v[nod]){
        if(x==par[nod]||x==heavy[nod])continue;
        dec(x,x);
    }
}

inline void frt(ll i,ll l,ll r){
    if(lazy[i]){
       st[i]+=(r-l+1)*lazy[i];
       if(l!=r){
        lazy[left]+=lazy[i];
        lazy[righ]+=lazy[i];
       }
       lazy[i]=0;
    }
}
ll getans(ll i,ll l,ll r,ll id){
    frt(i,l,r);
    if(r<id||l>id)return 0;
    if(l==r)return st[i];
    return getans(left,l,mid,id)+getans(righ,mid+1,r,id);
}

void upd(ll i,ll l,ll r,ll ql,ll qr){
    frt(i,l,r);
    if(r<ql||l>qr)return ;
    if(l>=ql&&r<=qr){
        st[i]+=(r-l+1);
        if(l!=r){
            lazy[left]++;
            lazy[righ]++;
        }
        return;
    }
    upd(left,l,mid,ql,qr);
    upd(righ,mid+1,r,ql,qr);
    st[i]=st[left]+st[righ];
}

void add(ll x,ll y){
    while(head[x]!=head[y]){
        if(dep[head[x]]<dep[head[y]])swap(x,y);
        upd(0,0,cnt-1,pos[head[x]],pos[x]);
        x=par[head[x]];
    }
    if(x==y)return;
    if(pos[x]>pos[y])swap(x,y);
    x=heavy[x];
    upd(0,0,cnt-1,pos[x],pos[y]);
}
int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>n;
    for(ll i=0;i<n-1;i++){
        for(ll j=0;j<4;j++)cin>>ed[i][j];
        v[ed[i][0]].pb(ed[i][1]);
        v[ed[i][1]].pb(ed[i][0]);
    }

    dfs(1,0);
    dec(1,1);

    /*for(int i=1;i<=n;i++){
        cout<<pos[i]<<' '<<endl;
    }*/
    for(ll i=1;i<n;i++){
        add(i,i+1);
    }


    for(ll i=0;i<n-1;i++){
        if(ed[i][0]==par[ed[i][1]])swap(ed[i][0],ed[i][1]);
        ll cur=getans(0,0,cnt-1,pos[ed[i][0]]);
        //cout<<ed[i][0]<<' '<<ed[i][1]<<' '<<cur<<endl;
        ans+=min(cur*ed[i][2],ed[i][3]);
    }
    cout<<ans<<endl;
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 10 ms 5368 KB Output is correct
3 Correct 10 ms 5368 KB Output is correct
4 Correct 11 ms 5372 KB Output is correct
5 Correct 10 ms 5368 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 8 ms 5240 KB Output is correct
8 Correct 9 ms 5368 KB Output is correct
9 Correct 10 ms 5368 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 142 ms 22520 KB Output is correct
2 Correct 145 ms 23932 KB Output is correct
3 Correct 157 ms 25336 KB Output is correct
4 Correct 167 ms 24824 KB Output is correct
5 Correct 8 ms 5240 KB Output is correct
6 Correct 142 ms 22188 KB Output is correct
7 Correct 92 ms 16888 KB Output is correct
8 Correct 149 ms 22388 KB Output is correct
9 Correct 146 ms 22716 KB Output is correct
10 Correct 123 ms 22136 KB Output is correct
11 Correct 141 ms 23288 KB Output is correct
12 Correct 147 ms 23288 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 10 ms 5368 KB Output is correct
3 Correct 10 ms 5368 KB Output is correct
4 Correct 11 ms 5372 KB Output is correct
5 Correct 10 ms 5368 KB Output is correct
6 Correct 7 ms 5112 KB Output is correct
7 Correct 8 ms 5240 KB Output is correct
8 Correct 9 ms 5368 KB Output is correct
9 Correct 10 ms 5368 KB Output is correct
10 Correct 142 ms 22520 KB Output is correct
11 Correct 145 ms 23932 KB Output is correct
12 Correct 157 ms 25336 KB Output is correct
13 Correct 167 ms 24824 KB Output is correct
14 Correct 8 ms 5240 KB Output is correct
15 Correct 142 ms 22188 KB Output is correct
16 Correct 92 ms 16888 KB Output is correct
17 Correct 149 ms 22388 KB Output is correct
18 Correct 146 ms 22716 KB Output is correct
19 Correct 123 ms 22136 KB Output is correct
20 Correct 141 ms 23288 KB Output is correct
21 Correct 147 ms 23288 KB Output is correct
22 Correct 333 ms 19576 KB Output is correct
23 Correct 290 ms 18296 KB Output is correct
24 Correct 336 ms 19448 KB Output is correct
25 Correct 9 ms 5240 KB Output is correct
26 Correct 119 ms 11896 KB Output is correct
27 Correct 274 ms 17784 KB Output is correct
28 Correct 122 ms 21240 KB Output is correct
29 Correct 155 ms 23248 KB Output is correct
30 Correct 142 ms 23288 KB Output is correct
31 Correct 9 ms 5368 KB Output is correct