제출 #1107611

#제출 시각아이디문제언어결과실행 시간메모리
1107611vjudge1Magic Tree (CEOI19_magictree)C++17
3 / 100
19 ms508 KiB

#include <bits/stdc++.h>
#define int long long int
#define ff first
#define ss second
#define FT ios_base::sync_with_stdio(false);cin.tie(0);
using namespace std;
signed main() {
	FT;
	int n , m , k;
	cin >> n >> m >> k;
	for (int i = 1 ; i < n ; i++)
	{
		int p;
		cin >> p;
	}
	int ans = 0;
	while (m--)
	{
		int v , d , w;
		cin >> v >> d >> w;
		ans += w;
	}
	cout << ans << endl;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...