Submission #1220840

#	Time	Username	Problem	Language	Result	Execution time	Memory
1220840		Trumling	Magic Tree (CEOI19_magictree)	C++20	3 / 100	60 ms	8520 KiB

magictree

//Trumling ©
//Αφόδευε υψηλά και ηγνάντει 
#include <bits/stdc++.h>
using namespace std; 

typedef long long ll;
#define pb push_back
#define F first
#define S second
#define enter cout<<'\n';
#define INF 99999999999999999
#define MOD 1000000007
#define all(x) x.begin(),x.end()

vector<vector<ll>>g;
vector<pair<ll,ll>>f;

int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n,m,k;
cin>>n>>m>>k;
g.assign(n+1,vector<ll>());
f.assign(n+1,{-1,-1});

for(int i=2;i<=n;i++)
{
    ll x;
    cin>>x;
    g[i].pb(x);
    g[x].pb(i);
}
ll sum=0;

for(int i=0;i<m;i++)
    {
        ll x,y,z;
        cin>>x>>y>>z;
        f[x]={y,z};
        sum+=z;
    }
cout<<sum;

}

• 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