oj.uz

Submission #833757

# Submission time Handle Problem Language Result Execution time Memory
833757 2023-08-22T08:28:48 Z FEDIKUS Magic Tree (CEOI19_magictree) C++17
100 / 100
 198 ms 35204 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<ll,ll>;

const ll maxn=1e5+10;

ll p[maxn];
vector<ll> g[maxn];
pair<ll,ll> f[maxn];

set<pair<ll,ll> > dp[maxn]; // obrisao sam ceo subtree pre first-og dana i zaradio second vise nego za prosli koji imam sacuvan

void dodajsub(pair<ll,ll> f,set<pii> &dp){
    auto it=dp.lower_bound({f.first,-1});
    if(it==dp.end()){
        dp.emplace(f);
        return;
    }
    if(it->first!=f.first){
        dp.emplace(f);
        return;
    }
    pii nov=*it;
    nov.second+=f.second;
    dp.erase(it);
    dp.emplace(nov);
}

void dodajcale(pii f,set<pii> &dp){
    auto it=dp.lower_bound({f.first,-1});
    if(it==dp.end()){
        dp.emplace(f);
        return;
    }
    pii nov=f;
    if(it->first==f.first){
        nov.second+=it->second;
        dp.erase(it);
    }
    it=dp.lower_bound({f.first,-1});
    ll tren=0;
    while(it!=dp.end() && tren+it->second<=f.second){
        tren+=it->second;
        dp.erase(it);
        it=dp.lower_bound({f.first,-1});
    }
    if(it==dp.end()){
        dp.emplace(nov);
        return;
    }
    pii sled=*it;
    dp.erase(it);
    dp.emplace(nov);
    sled.second-=f.second-tren;
    dp.emplace(sled);
}

void dfs(ll node=1){
    for(ll i:g[node]) dfs(i);
    pair<ll,ll> maxi={-1,-1};
    for(ll i:g[node]) maxi=max(maxi,pii(dp[i].size(),i));
    if(maxi.second!=-1){
        swap(dp[node],dp[maxi.second]);
        for(ll i:g[node]){
            if(i==maxi.second) continue;
            for(auto j:dp[i]){
                dodajsub(j,dp[node]);
            }
        }
    }
    if(f[node].first!=-1) dodajcale(f[node],dp[node]);

    /*cout<<node<<":\n";
    for(auto i:dp[node]) cout<<i.first<<" "<<i.second<<"\n";
    cout<<"\n";*/
}

int main(){
    ll n,m,k;
    cin>>n>>m>>k;
    for(ll i=2;i<=n;i++){
        cin>>p[i];
        g[p[i]].push_back(i);
    }
    for(ll i=1;i<=n;i++) f[i]={-1,-1};
    for(ll i=0;i<m;i++){
        ll v,d,w; cin>>v>>d>>w;
        f[v]={d,w};
    }
    dfs();
    ll res=0;
    for(auto i:dp[1]) res+=i.second;
    cout<<res;
    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 4 ms 7364 KB Output is correct
5 Correct 3 ms 7252 KB Output is correct
6 Correct 5 ms 7252 KB Output is correct
7 Correct 4 ms 7356 KB Output is correct
8 Correct 3 ms 7252 KB Output is correct
9 Correct 3 ms 7276 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 19024 KB Output is correct
2 Correct 63 ms 18368 KB Output is correct
3 Correct 190 ms 35204 KB Output is correct
4 Correct 143 ms 19800 KB Output is correct
5 Correct 170 ms 21196 KB Output is correct

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 4 ms 7476 KB Output is correct
4 Correct 93 ms 22492 KB Output is correct
5 Correct 131 ms 26484 KB Output is correct
6 Correct 131 ms 22484 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 103 ms 15124 KB Output is correct
2 Correct 116 ms 14392 KB Output is correct
3 Correct 111 ms 16464 KB Output is correct
4 Correct 109 ms 16100 KB Output is correct
5 Correct 95 ms 20608 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 4 ms 7364 KB Output is correct
5 Correct 3 ms 7252 KB Output is correct
6 Correct 5 ms 7252 KB Output is correct
7 Correct 4 ms 7356 KB Output is correct
8 Correct 3 ms 7252 KB Output is correct
9 Correct 3 ms 7276 KB Output is correct
10 Correct 115 ms 19344 KB Output is correct
11 Correct 101 ms 18352 KB Output is correct
12 Correct 101 ms 17944 KB Output is correct
13 Correct 85 ms 17232 KB Output is correct
14 Correct 99 ms 22132 KB Output is correct

Subtask #6
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 8368 KB Output is correct
2 Correct 45 ms 12288 KB Output is correct
3 Correct 45 ms 12240 KB Output is correct
4 Correct 47 ms 12228 KB Output is correct
5 Correct 20 ms 10796 KB Output is correct
6 Correct 37 ms 13580 KB Output is correct
7 Correct 35 ms 15944 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 4 ms 7364 KB Output is correct
5 Correct 3 ms 7252 KB Output is correct
6 Correct 5 ms 7252 KB Output is correct
7 Correct 4 ms 7356 KB Output is correct
8 Correct 3 ms 7252 KB Output is correct
9 Correct 3 ms 7276 KB Output is correct
10 Correct 5 ms 7380 KB Output is correct
11 Correct 5 ms 7380 KB Output is correct
12 Correct 4 ms 7476 KB Output is correct
13 Correct 93 ms 22492 KB Output is correct
14 Correct 131 ms 26484 KB Output is correct
15 Correct 131 ms 22484 KB Output is correct
16 Correct 115 ms 19344 KB Output is correct
17 Correct 101 ms 18352 KB Output is correct
18 Correct 101 ms 17944 KB Output is correct
19 Correct 85 ms 17232 KB Output is correct
20 Correct 99 ms 22132 KB Output is correct
21 Correct 26 ms 10956 KB Output is correct
22 Correct 88 ms 20368 KB Output is correct
23 Correct 106 ms 23516 KB Output is correct
24 Correct 154 ms 31788 KB Output is correct
25 Correct 106 ms 21212 KB Output is correct
26 Correct 150 ms 22164 KB Output is correct
27 Correct 123 ms 19772 KB Output is correct

Subtask #8
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 4 ms 7364 KB Output is correct
5 Correct 3 ms 7252 KB Output is correct
6 Correct 5 ms 7252 KB Output is correct
7 Correct 4 ms 7356 KB Output is correct
8 Correct 3 ms 7252 KB Output is correct
9 Correct 3 ms 7276 KB Output is correct
10 Correct 84 ms 19024 KB Output is correct
11 Correct 63 ms 18368 KB Output is correct
12 Correct 190 ms 35204 KB Output is correct
13 Correct 143 ms 19800 KB Output is correct
14 Correct 170 ms 21196 KB Output is correct
15 Correct 5 ms 7380 KB Output is correct
16 Correct 5 ms 7380 KB Output is correct
17 Correct 4 ms 7476 KB Output is correct
18 Correct 93 ms 22492 KB Output is correct
19 Correct 131 ms 26484 KB Output is correct
20 Correct 131 ms 22484 KB Output is correct
21 Correct 103 ms 15124 KB Output is correct
22 Correct 116 ms 14392 KB Output is correct
23 Correct 111 ms 16464 KB Output is correct
24 Correct 109 ms 16100 KB Output is correct
25 Correct 95 ms 20608 KB Output is correct
26 Correct 115 ms 19344 KB Output is correct
27 Correct 101 ms 18352 KB Output is correct
28 Correct 101 ms 17944 KB Output is correct
29 Correct 85 ms 17232 KB Output is correct
30 Correct 99 ms 22132 KB Output is correct
31 Correct 14 ms 8368 KB Output is correct
32 Correct 45 ms 12288 KB Output is correct
33 Correct 45 ms 12240 KB Output is correct
34 Correct 47 ms 12228 KB Output is correct
35 Correct 20 ms 10796 KB Output is correct
36 Correct 37 ms 13580 KB Output is correct
37 Correct 35 ms 15944 KB Output is correct
38 Correct 26 ms 10956 KB Output is correct
39 Correct 88 ms 20368 KB Output is correct
40 Correct 106 ms 23516 KB Output is correct
41 Correct 154 ms 31788 KB Output is correct
42 Correct 106 ms 21212 KB Output is correct
43 Correct 150 ms 22164 KB Output is correct
44 Correct 123 ms 19772 KB Output is correct
45 Correct 30 ms 11468 KB Output is correct
46 Correct 117 ms 21344 KB Output is correct
47 Correct 125 ms 24724 KB Output is correct
48 Correct 198 ms 34808 KB Output is correct
49 Correct 128 ms 21928 KB Output is correct
50 Correct 150 ms 23020 KB Output is correct
51 Correct 134 ms 20684 KB Output is correct