oj.uz

답안 #722215

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
722215 2023-04-11T15:13:39 Z 600Mihnea Worst Reporter 4 (JOI21_worst_reporter4) C++17
14 / 100
 2000 ms 26100 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];
int dep[N];
ll dp[N];
ll get(int a) {
	ll sol = c[a];
	for (auto& b : g[a]) {
		sol += get(b);
	}
	sol = min(sol, dp[a]);
	return sol;
}
void compute(int a) {
	dp[a] = 0;
	for (auto& b : g[a]) {
		dp[a] += get(b);
	}
}
void build1(int a) {
	for (auto& b : g[a]) {
		dep[b] = 1 + dep[a];
		build1(b);
	}
}
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];
		dp[i] = INF;
	}
	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);
	vector<int> ord(n);
	iota(ord.begin(), ord.end(), 1);
	sort(ord.begin(), ord.end(), [&](int a, int b) {
		if (h[a] != h[b]) {
			return h[a] > h[b];
		}
		return dep[a] > dep[b];
		});
	for (auto& a : ord) {
		compute(a);
	}
	cout << get(1) << "\n";
	return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 6 ms 5204 KB Output is correct
6 Correct 9 ms 5204 KB Output is correct
7 Correct 6 ms 5204 KB Output is correct
8 Correct 6 ms 5204 KB Output is correct
9 Correct 6 ms 5204 KB Output is correct
10 Correct 6 ms 5204 KB Output is correct
11 Correct 6 ms 5204 KB Output is correct
12 Correct 90 ms 5460 KB Output is correct
13 Correct 82 ms 5548 KB Output is correct
14 Correct 43 ms 5428 KB Output is correct
15 Correct 46 ms 5444 KB Output is correct
16 Correct 5 ms 5204 KB Output is correct
17 Correct 6 ms 5204 KB Output is correct
18 Correct 4 ms 5204 KB Output is correct
19 Correct 41 ms 5352 KB Output is correct
20 Correct 41 ms 5360 KB Output is correct
21 Correct 36 ms 5328 KB Output is correct
22 Correct 4 ms 5204 KB Output is correct
23 Correct 4 ms 5204 KB Output is correct
24 Correct 51 ms 5388 KB Output is correct
25 Correct 55 ms 5380 KB Output is correct
26 Correct 96 ms 5460 KB Output is correct
27 Correct 40 ms 5300 KB Output is correct
28 Correct 65 ms 5480 KB Output is correct
29 Correct 88 ms 5416 KB Output is correct
30 Correct 45 ms 5332 KB Output is correct
31 Correct 44 ms 5332 KB Output is correct

Subtask #2
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 6 ms 5204 KB Output is correct
6 Correct 9 ms 5204 KB Output is correct
7 Correct 6 ms 5204 KB Output is correct
8 Correct 6 ms 5204 KB Output is correct
9 Correct 6 ms 5204 KB Output is correct
10 Correct 6 ms 5204 KB Output is correct
11 Correct 6 ms 5204 KB Output is correct
12 Correct 90 ms 5460 KB Output is correct
13 Correct 82 ms 5548 KB Output is correct
14 Correct 43 ms 5428 KB Output is correct
15 Correct 46 ms 5444 KB Output is correct
16 Correct 5 ms 5204 KB Output is correct
17 Correct 6 ms 5204 KB Output is correct
18 Correct 4 ms 5204 KB Output is correct
19 Correct 41 ms 5352 KB Output is correct
20 Correct 41 ms 5360 KB Output is correct
21 Correct 36 ms 5328 KB Output is correct
22 Correct 4 ms 5204 KB Output is correct
23 Correct 4 ms 5204 KB Output is correct
24 Correct 51 ms 5388 KB Output is correct
25 Correct 55 ms 5380 KB Output is correct
26 Correct 96 ms 5460 KB Output is correct
27 Correct 40 ms 5300 KB Output is correct
28 Correct 65 ms 5480 KB Output is correct
29 Correct 88 ms 5416 KB Output is correct
30 Correct 45 ms 5332 KB Output is correct
31 Correct 44 ms 5332 KB Output is correct
32 Correct 6 ms 5204 KB Output is correct
33 Correct 304 ms 13644 KB Output is correct
34 Correct 291 ms 13608 KB Output is correct
35 Correct 262 ms 13644 KB Output is correct
36 Correct 265 ms 13712 KB Output is correct
37 Correct 256 ms 13644 KB Output is correct
38 Correct 294 ms 13712 KB Output is correct
39 Execution timed out 2053 ms 26100 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 6 ms 5204 KB Output is correct
6 Correct 9 ms 5204 KB Output is correct
7 Correct 6 ms 5204 KB Output is correct
8 Correct 6 ms 5204 KB Output is correct
9 Correct 6 ms 5204 KB Output is correct
10 Correct 6 ms 5204 KB Output is correct
11 Correct 6 ms 5204 KB Output is correct
12 Correct 90 ms 5460 KB Output is correct
13 Correct 82 ms 5548 KB Output is correct
14 Correct 43 ms 5428 KB Output is correct
15 Correct 46 ms 5444 KB Output is correct
16 Correct 5 ms 5204 KB Output is correct
17 Correct 6 ms 5204 KB Output is correct
18 Correct 4 ms 5204 KB Output is correct
19 Correct 41 ms 5352 KB Output is correct
20 Correct 41 ms 5360 KB Output is correct
21 Correct 36 ms 5328 KB Output is correct
22 Correct 4 ms 5204 KB Output is correct
23 Correct 4 ms 5204 KB Output is correct
24 Correct 51 ms 5388 KB Output is correct
25 Correct 55 ms 5380 KB Output is correct
26 Correct 96 ms 5460 KB Output is correct
27 Correct 40 ms 5300 KB Output is correct
28 Correct 65 ms 5480 KB Output is correct
29 Correct 88 ms 5416 KB Output is correct
30 Correct 45 ms 5332 KB Output is correct
31 Correct 44 ms 5332 KB Output is correct
32 Correct 6 ms 5204 KB Output is correct
33 Correct 304 ms 13644 KB Output is correct
34 Correct 291 ms 13608 KB Output is correct
35 Correct 262 ms 13644 KB Output is correct
36 Correct 265 ms 13712 KB Output is correct
37 Correct 256 ms 13644 KB Output is correct
38 Correct 294 ms 13712 KB Output is correct
39 Execution timed out 2053 ms 26100 KB Time limit exceeded
40 Halted 0 ms 0 KB -