oj.uz

Submission #898725

# Submission time Handle Problem Language Result Execution time Memory
898725 2024-01-05T04:55:21 Z vjudge1 Magic Tree (CEOI19_magictree) C++17
3 / 100
 75 ms 4328 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
const int mxn=1e5+5;
ll n,m,k,par[mxn],ans=0,res[mxn];
int main(){
	cin>>n>>m>>k;
	for(int i=2;i<=n;i++){
		cin>>par[i];
	}
	for(int i=1;i<=m;i++){
		ll v,d,w;
		cin>>v>>d>>w;
		res[v]=max(res[v],w);
	}
	for(int i=1;i<=n;i++){
		ans+=res[i];
	}
	cout<<ans<<endl;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 2900 KB Output is correct
2 Correct 32 ms 2220 KB Output is correct
3 Correct 75 ms 4328 KB Output is correct
4 Correct 68 ms 4008 KB Output is correct
5 Correct 75 ms 4156 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 74 ms 4004 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 856 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -