# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
277994 | 2020-08-21T08:26:36 Z | AKaan37 | Magic Tree (CEOI19_magictree) | C++17 | 2000 ms | 58872 KB |
//Bismillahirrahmanirrahim //█▀█─█──█──█▀█─█─█ //█▄█─█──█──█▄█─█▄█ //█─█─█▄─█▄─█─█─█─█ #include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > PII; #define fi first #define se second #define int long long #define mp make_pair #define endl "\n" #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo inf = 1000000000000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 100005; const lo mod = 1000000007; int n,m,b[li],a[li],k,flag,t,dp[li][25]; int cev; string s; PII p[li]; vector<int> v[li]; inline void dfs(int node,int ata){ for(int i=0;i<(int)v[node].size();i++){ int go=v[node][i]; if(go==ata)continue; dfs(go,node); } for(int i=p[node].fi;i<=k;i++){ dp[node][i]=max(dp[node][i],(int)(dp[node][p[node].fi-1]+p[node].se)); } for(int i=0;i<=k;i++){ dp[ata][i]+=(dp[node][i]); } } main(void){ scanf("%lld %lld %lld",&n,&m,&k); for(int i=2;i<=n;i++){ int x; scanf("%lld",&x); v[i].pb(x); v[x].pb(i); } for(int i=1;i<=m;i++){ int x,y,z; scanf("%lld %lld %lld",&x,&y,&z); p[x].fi=y; p[x].se=z; } dfs(1,0); printf("%lld\n",dp[1][k]); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2688 KB | Output is correct |
2 | Incorrect | 2 ms | 2688 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 125 ms | 58872 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 2944 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 107 ms | 27512 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2688 KB | Output is correct |
2 | Incorrect | 2 ms | 2688 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 2013 ms | 8176 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2688 KB | Output is correct |
2 | Incorrect | 2 ms | 2688 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 2688 KB | Output is correct |
2 | Incorrect | 2 ms | 2688 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |