oj.uz

Submission #965723

# Submission time Handle Problem Language Result Execution time Memory
965723 2024-04-19T06:11:07 Z vjudge1 Magic Tree (CEOI19_magictree) C++17
0 / 100
 2000 ms 46420 KB 
#include<bits/stdc++.h>
using namespace std;
#define N 7<<14
#define int long long
vector<int>adj[N];
map<int,int> dp[N];
int d[N],w[N];
void dfs(int n){
    map<int,int> add;
    dp[n][0];
    for(auto i:adj[n]){
        dfs(i);
        if(size(dp[n])+size(add)<size(dp[i])) {
            add[0];
            auto it=++add.begin();
            while(it!=add.end()){
                it->second+=prev(it)->second;
                it++;
            }
            for(auto[i,j]:add)
                dp[n][i]=(--(dp[n].upper_bound(i)))->second;
            for(auto&[i,j]:dp[n])
                j+=(--(add.upper_bound(i)))->second;
            add.clear();
            swap(dp[n],dp[i]);
        }
        auto it=++dp[i].begin();
        add[dp[i].begin()->first]+=dp[i].begin()->second;
        while(it!=dp[i].end())
            add[it->first]+=it->second-prev(it)->first,it++;
        dp[i].clear();
    }
    add[0];
    auto it=++add.begin();
    while(it!=add.end()){
        it->second+=prev(it)->second;
        it++;
    }
    for(auto[i,j]:add)
        dp[n][i]=(--(dp[n].upper_bound(i)))->second;
    for(auto&[i,j]:dp[n])
        j+=(--(add.upper_bound(i)))->second;
    it=--(dp[n].upper_bound(d[n]));
    int val=it->second+w[n];
    dp[n][d[n]]=val;
    it=dp[n].find(d[n]);
    while(it!=dp[n].end()){
        it->second=max(it->second,val);
        it++;
    }
}
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    int n,m,k,Q;
    cin>>n>>m>>k;
    for(int i=2;i<=n;i++)
        cin>>Q,adj[Q].push_back(i);
    while(m--){
        int a,b,c;
        cin>>a>>b>>c;
        d[a]=b,w[a]=c;
    }
    dfs(1);
    cout<<(--dp[1].end())->second;
}

Subtask #1
0 / 6.0

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

Subtask #2
0 / 3.0

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

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10328 KB Output is correct
2 Correct 5 ms 10332 KB Output is correct
3 Correct 4 ms 10332 KB Output is correct
4 Execution timed out 2072 ms 46420 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

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

Subtask #5
0 / 16.0

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

Subtask #6
0 / 13.0

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

Subtask #7
0 / 22.0

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

Subtask #8
0 / 17.0

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