Submission #242270

#TimeUsernameProblemLanguageResultExecution timeMemory
242270cheehengMagic Tree (CEOI19_magictree)C++14
3 / 100
81 ms5376 KiB
#include <bits/stdc++.h> using namespace std; vector<int> AdjList[100005]; int d[100005]; int w[100005]; int main(){ int n, m, k; scanf("%d%d%d", &n, &m, &k); for(int i = 2; i <= n; i ++){ int p; scanf("%d", &p); AdjList[p].push_back(i); } bool subtask2 = true; long long ans2 = 0; for(int i = 1; i <= m; i ++){ int x, y, z; scanf("%d%d%d", &x, &y, &z); subtask2 &= AdjList[x].empty(); d[x] = y; w[x] = z; ans2 += w[x]; } if(subtask2){ printf("%lld", ans2); return 0; } return 0; }

Compilation message (stderr)

magictree.cpp: In function 'int main()':
magictree.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &n, &m, &k);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~
magictree.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &p);
         ~~~~~^~~~~~~~~~
magictree.cpp:24:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &x, &y, &z);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~
#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...