oj.uz

Submission #573464

# Submission time Handle Problem Language Result Execution time Memory
573464 2022-06-06T16:34:25 Z GusterGoose27 Fireworks (APIO16_fireworks) C++11
7 / 100
 5 ms 7380 KB 
#include <bits/stdc++.h>

#define pii pair<int, int> 
#define ll long long

using namespace std;

const int MAXN = 3e5;
vector<pii> edges[MAXN]; // node,  cost
int parent[MAXN];
int lval[MAXN]; // inclusive
int rval[MAXN]; // inclusive
ll cost[MAXN];
int n;

void dfs(int s = 0) {
	int m = edges[s].size();
	if (m == 0) {
		cost[s] = 0;
		lval[s] = 0;
		rval[s] = 0;
		return;
	}
	for (pii e: edges[s]) {
		dfs(e.first);
	}
	vector<int> change_pos;
	ll at0 = 0;
	for (pii e: edges[s]) {
		change_pos.push_back(e.second+lval[e.first]);
		change_pos.push_back(e.second+rval[e.first]);
		at0 += lval[e.first]+cost[e.first]+e.second;
	}
	sort(change_pos.begin(), change_pos.end());
	for (int i = 0; i < m; i++) {
		at0 -= change_pos[i];
	}
	cost[s] = at0;
	lval[s] = change_pos[m-1];
	rval[s] = change_pos[m];
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int a, b; cin >> a >> b; n = a+b;
	for (int i = 0; i < n-1; i++) {
		int x, c;
		cin >> x >> c;
		parent[i+1] = x-1;
		edges[x-1].push_back(pii(i+1, c));
	}
	dfs();
	cout << cost[0] << "\n";
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 5 ms 7376 KB Output is correct
3 Correct 5 ms 7376 KB Output is correct
4 Correct 5 ms 7276 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 4 ms 7376 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Incorrect 4 ms 7376 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 5 ms 7376 KB Output is correct
3 Correct 5 ms 7376 KB Output is correct
4 Correct 5 ms 7276 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 4 ms 7376 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 5 ms 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Incorrect 4 ms 7376 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7380 KB Output is correct
2 Correct 5 ms 7376 KB Output is correct
3 Correct 5 ms 7376 KB Output is correct
4 Correct 5 ms 7276 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 4 ms 7380 KB Output is correct
8 Correct 4 ms 7376 KB Output is correct
9 Correct 5 ms 7380 KB Output is correct
10 Correct 4 ms 7380 KB Output is correct
11 Correct 5 ms 7380 KB Output is correct
12 Correct 4 ms 7380 KB Output is correct
13 Incorrect 4 ms 7376 KB Output isn't correct
14 Halted 0 ms 0 KB -