Submission #1367164

#TimeUsernameProblemLanguageResultExecution timeMemory
1367164nataliaaMagic Tree (CEOI19_magictree)C++20
0 / 100
18 ms4240 KiB
#include<bits/stdc++.h>
using namespace std;
int main(){
    int n, m, k;
    cin >> n >> m >> k;
    int ans = 0;
    vector<int> v[n+5];
    for(int i = 0; i < n-1; i++){
        int x, y;
        cin >> x >> y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(int i = 0; i < m; i++){
        int j, p, d;
        cin >> j >> d >> p;
        ans+=p;
    }
    cout << ans;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...