oj.uz

Submission #884590

# Submission time Handle Problem Language Result Execution time Memory
884590 2023-12-07T17:52:09 Z boris_7 Magic Tree (CEOI19_magictree) C++17
0 / 100
 35 ms 8716 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;

vector<vector<int>>gp;


void solve(){
    int n,m,k;
    cin>>n>>m>>k;
    gp = vector<vector<int>>(n);
    for(int i  = 1;i<n;i++){
        int u;
        cin>>u;
        --u;
        // cout<<u<<endl;
        gp[u].push_back(i);
        gp[i].push_back(u);
    }
    int ans=  0;
    vector<pair<int,int>>a(n,{0,-1e9});
    for(int i = 0;i<m;i++){
        int u;
        cin>>u;
        cin>>a[u].first>>a[u].second;
        ans+=a[u].second;
    }
    cout<<ans<<endl;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(nullptr);
    // int t;cin>>t;while(t--)
        solve();
}

Subtask #1
0 / 6.0

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

Subtask #2
0 / 3.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 12.0

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

Subtask #5
0 / 16.0

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

Subtask #6
0 / 13.0

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

Subtask #7
0 / 22.0

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

Subtask #8
0 / 17.0

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