Submission #898725

#	Time	Username	Problem	Language	Result	Execution time	Memory
898725		vjudge1	Magic Tree (CEOI19_magictree)	C++17	3 / 100	75 ms	4328 KiB

magictree

#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int mxn=1e5+5;
ll n,m,k,par[mxn],ans=0,res[mxn];
int main(){
	cin>>n>>m>>k;
	for(int i=2;i<=n;i++){
		cin>>par[i];
	}
	for(int i=1;i<=m;i++){
		ll v,d,w;
		cin>>v>>d>>w;
		res[v]=max(res[v],w);
	}
	for(int i=1;i<=n;i++){
		ans+=res[i];
	}
	cout<<ans<<endl;
}

• 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