Submission #898736

#	Time	Username	Problem	Language	Result	Execution time	Memory
898736		vjudge1	Magic Tree (CEOI19_magictree)	C++17	3 / 100	30 ms	7260 KiB

magictree

//In His Name
#include <bits/stdc++.h>
//#pragma GCC optimization("O3")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx2")
using namespace std;
#define ll long long
#define int ll
typedef pair<int, int> pii;
#define F first
#define S second
#define pb push_back
#define bug(x) cout << "Ah shit , here we go again : " << x <<endl
#define all(x) x.begin() , x.end()
const int maxn = 1e5 + 10, MOD = 1e9 + 7 ;
const ll INF = 1e18 + 100;

int n , m , k , v[maxn] ,d[maxn] , w[maxn];
vector<int> adj[maxn];

int32_t main(){    
    ios_base::sync_with_stdio(false);
    cin.tie(0) , cout.tie(0);
    
    cin >> n >> m >> k;
    for(int i = 2 ; i <= n ; i++){
        int p;
        cin >> p;
        adj[p].pb(i);
    }
    int ans = 0;
    for(int i = 1 ; i <= m ; i++){
        cin >> v[i] >> d[i] >> w[i];
        ans += w[i];
    }    
    cout << ans;
}

• Subtask 1: 0 / 6
• Subtask 2: 3 / 3
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 16
• Subtask 6: 0 / 13
• Subtask 7: 0 / 22
• Subtask 8: 0 / 17