oj.uz

Submission #722194

# Submission time Handle Problem Language Result Execution time Memory
722194 2023-04-11T14:52:04 Z 600Mihnea Worst Reporter 4 (JOI21_worst_reporter4) C++17
14 / 100
 2000 ms 34376 KB 
#include <cmath>
#include <functional>
#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <set>
#include <map>
#include <list>
#include <time.h>
#include <math.h>
#include <random>
#include <deque>
#include <cassert>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <bitset>
#include <sstream>
#include <stack>
#include <chrono>
#include <cstring>
#include <numeric>
using namespace std;
typedef long long ll;
const int N = 200000 + 7;
const ll INF = (ll)1e18 + 7;
int n;
int par[N];
int h[N];
int c[N];
vector<int> g[N];
ll sumc[N];
ll dp[N];
ll compute(int a, int dim) {
	ll sol = c[a];
	for (auto& b : g[a]) {
		sol += compute(b, dim);
	}
	if (h[a] >= dim) {
		sol = min(sol, dp[a]);
	}
	return sol;
}
void build1(int a) {
	sumc[a] = c[a];
	dp[a] = 0;
	for (auto& b : g[a]) {
		build1(b);
		sumc[a] += sumc[b];
		dp[a] += compute(b, h[a]);
	}
}
signed main() {
#ifdef ONPC	
	FILE* stream;
	freopen_s(&stream, "input.txt", "r", stdin);
#else
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
#endif
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> par[i] >> h[i] >> c[i];
	}
	assert(par[1] == 1);
	for (int i = 2; i <= n; i++) {
		assert(1 <= par[i] && par[i] <= i - 1);
		g[par[i]].push_back(i);
	}
	build1(1);
	cout << compute(1, 0) << "\n";
	return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5028 KB Output is correct
3 Correct 4 ms 5028 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Correct 6 ms 5340 KB Output is correct
6 Correct 7 ms 5320 KB Output is correct
7 Correct 7 ms 5388 KB Output is correct
8 Correct 5 ms 5332 KB Output is correct
9 Correct 5 ms 5332 KB Output is correct
10 Correct 6 ms 5332 KB Output is correct
11 Correct 6 ms 5332 KB Output is correct
12 Correct 112 ms 5752 KB Output is correct
13 Correct 113 ms 5684 KB Output is correct
14 Correct 66 ms 5564 KB Output is correct
15 Correct 58 ms 5596 KB Output is correct
16 Correct 6 ms 5332 KB Output is correct
17 Correct 5 ms 5304 KB Output is correct
18 Correct 5 ms 5296 KB Output is correct
19 Correct 54 ms 5512 KB Output is correct
20 Correct 51 ms 5644 KB Output is correct
21 Correct 51 ms 5460 KB Output is correct
22 Correct 4 ms 5332 KB Output is correct
23 Correct 5 ms 5332 KB Output is correct
24 Correct 73 ms 5556 KB Output is correct
25 Correct 71 ms 5460 KB Output is correct
26 Correct 83 ms 5756 KB Output is correct
27 Correct 37 ms 5460 KB Output is correct
28 Correct 70 ms 5460 KB Output is correct
29 Correct 91 ms 5632 KB Output is correct
30 Correct 48 ms 5548 KB Output is correct
31 Correct 50 ms 5588 KB Output is correct

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5028 KB Output is correct
3 Correct 4 ms 5028 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Correct 6 ms 5340 KB Output is correct
6 Correct 7 ms 5320 KB Output is correct
7 Correct 7 ms 5388 KB Output is correct
8 Correct 5 ms 5332 KB Output is correct
9 Correct 5 ms 5332 KB Output is correct
10 Correct 6 ms 5332 KB Output is correct
11 Correct 6 ms 5332 KB Output is correct
12 Correct 112 ms 5752 KB Output is correct
13 Correct 113 ms 5684 KB Output is correct
14 Correct 66 ms 5564 KB Output is correct
15 Correct 58 ms 5596 KB Output is correct
16 Correct 6 ms 5332 KB Output is correct
17 Correct 5 ms 5304 KB Output is correct
18 Correct 5 ms 5296 KB Output is correct
19 Correct 54 ms 5512 KB Output is correct
20 Correct 51 ms 5644 KB Output is correct
21 Correct 51 ms 5460 KB Output is correct
22 Correct 4 ms 5332 KB Output is correct
23 Correct 5 ms 5332 KB Output is correct
24 Correct 73 ms 5556 KB Output is correct
25 Correct 71 ms 5460 KB Output is correct
26 Correct 83 ms 5756 KB Output is correct
27 Correct 37 ms 5460 KB Output is correct
28 Correct 70 ms 5460 KB Output is correct
29 Correct 91 ms 5632 KB Output is correct
30 Correct 48 ms 5548 KB Output is correct
31 Correct 50 ms 5588 KB Output is correct
32 Correct 6 ms 5332 KB Output is correct
33 Correct 216 ms 18752 KB Output is correct
34 Correct 208 ms 18752 KB Output is correct
35 Correct 192 ms 18636 KB Output is correct
36 Correct 207 ms 18744 KB Output is correct
37 Correct 214 ms 18772 KB Output is correct
38 Correct 184 ms 18616 KB Output is correct
39 Execution timed out 2065 ms 34376 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 5028 KB Output is correct
3 Correct 4 ms 5028 KB Output is correct
4 Correct 4 ms 4948 KB Output is correct
5 Correct 6 ms 5340 KB Output is correct
6 Correct 7 ms 5320 KB Output is correct
7 Correct 7 ms 5388 KB Output is correct
8 Correct 5 ms 5332 KB Output is correct
9 Correct 5 ms 5332 KB Output is correct
10 Correct 6 ms 5332 KB Output is correct
11 Correct 6 ms 5332 KB Output is correct
12 Correct 112 ms 5752 KB Output is correct
13 Correct 113 ms 5684 KB Output is correct
14 Correct 66 ms 5564 KB Output is correct
15 Correct 58 ms 5596 KB Output is correct
16 Correct 6 ms 5332 KB Output is correct
17 Correct 5 ms 5304 KB Output is correct
18 Correct 5 ms 5296 KB Output is correct
19 Correct 54 ms 5512 KB Output is correct
20 Correct 51 ms 5644 KB Output is correct
21 Correct 51 ms 5460 KB Output is correct
22 Correct 4 ms 5332 KB Output is correct
23 Correct 5 ms 5332 KB Output is correct
24 Correct 73 ms 5556 KB Output is correct
25 Correct 71 ms 5460 KB Output is correct
26 Correct 83 ms 5756 KB Output is correct
27 Correct 37 ms 5460 KB Output is correct
28 Correct 70 ms 5460 KB Output is correct
29 Correct 91 ms 5632 KB Output is correct
30 Correct 48 ms 5548 KB Output is correct
31 Correct 50 ms 5588 KB Output is correct
32 Correct 6 ms 5332 KB Output is correct
33 Correct 216 ms 18752 KB Output is correct
34 Correct 208 ms 18752 KB Output is correct
35 Correct 192 ms 18636 KB Output is correct
36 Correct 207 ms 18744 KB Output is correct
37 Correct 214 ms 18772 KB Output is correct
38 Correct 184 ms 18616 KB Output is correct
39 Execution timed out 2065 ms 34376 KB Time limit exceeded
40 Halted 0 ms 0 KB -