Submission #898878

# Submission time Handle Problem Language Result Execution time Memory
898878 2024-01-05T08:37:02 Z vjudge1 Magic Tree (CEOI19_magictree) C++17
0 / 100
30 ms 6232 KB
#include <bits/stdc++.h>

using namespace std;

#define ll long long int
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define all(x) x.begin(), x.end()
#define u_map unordered_map
#define int ll
const int maxn = 1e5 + 5, mod = 1e9 + 7;

vector<int> adj[maxn];
int d[maxn], w[maxn], ans;
bool mark[maxn];

void dfs(int v) {
	mark[v] = 1;
	bool is = true;
	for (int u: adj[v]) {
		is = false;
		dfs(u);
	}
	if (is) {
		ans += d[v];
	}
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, m, k;
    cin >> n >> m >> k;
    for (int i = 2; i <= n; i++) {
    	int p;
    	cin >> p;
    	adj[p].pb(i);
    }
    for (int i = 1; i <= m; i++) {
    	int _v, _d, _w;
    	cin >> _v >> _d >> _w;
    	d[_v] = _d;
    	w[_v] = _w;
    }
    dfs(1);
    cout << ans;
    return 0;	
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4184 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 6112 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 4184 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 6232 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4184 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 4696 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4184 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 4184 KB Output isn't correct
2 Halted 0 ms 0 KB -