제출 #1236032

#제출 시각아이디문제언어결과실행 시간메모리
1236032yixuan19Magic Tree (CEOI19_magictree)C++20
3 / 100
58 ms328 KiB
#include <iostream> #define int long long using namespace std; signed main(){ int nb_vertices, nb_fruits, nb_max, parent; int location, day, juice; cin >> nb_vertices >> nb_fruits >> nb_max; for (int i = 2; i < nb_vertices+1; ++i){ cin >> parent; } int cnt = 0; for (int i = 0; i < nb_fruits; ++i){ cin >> location >> day >> juice; if (day <= nb_max){ cnt+=juice; } } cout<<cnt; }
#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...