oj.uz

답안 #722247

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
722247 2023-04-11T15:50:09 Z 600Mihnea Worst Reporter 4 (JOI21_worst_reporter4) C++17
14 / 100
 2000 ms 27664 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 dp2[N];
ll dp3[N];
void compute(int a) {
	ll init = dp3[a];
	dp3[a] = 0;
	for (auto& b : g[a]) {
		dp3[a] += dp3[b];
	}
	dp2[a] = dp3[a] + c[a];
	dp3[a] = dp3[a];
	while (par[a]) {
		dp2[par[a]] = dp2[par[a]] - init + dp3[a];
		init = dp3[par[a]];
		a = par[a];
		dp3[a] = min(dp2[a], dp3[a]);
	}
}
void build1(int a) {
	for (auto& b : g[a]) {
		dep[b] = 1 + dep[a];
		build1(b);
	}	
	dp2[a] = c[a];
	for (auto& b : g[a]) {
		dp2[a] += dp3[b];
	}
	dp3[a] = min(dp2[a], dp3[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];
		dp3[i] = INF;
	}
	assert(par[1] == 1);
	par[1] = 0;
	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 << dp3[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 2 ms 4948 KB Output is correct
5 Correct 6 ms 5204 KB Output is correct
6 Correct 5 ms 5204 KB Output is correct
7 Correct 5 ms 5312 KB Output is correct
8 Correct 6 ms 5204 KB Output is correct
9 Correct 6 ms 5312 KB Output is correct
10 Correct 5 ms 5204 KB Output is correct
11 Correct 6 ms 5204 KB Output is correct
12 Correct 42 ms 5600 KB Output is correct
13 Correct 42 ms 5588 KB Output is correct
14 Correct 23 ms 5460 KB Output is correct
15 Correct 23 ms 5460 KB Output is correct
16 Correct 5 ms 5204 KB Output is correct
17 Correct 5 ms 5204 KB Output is correct
18 Correct 4 ms 5204 KB Output is correct
19 Correct 23 ms 5424 KB Output is correct
20 Correct 24 ms 5428 KB Output is correct
21 Correct 24 ms 5364 KB Output is correct
22 Correct 5 ms 5204 KB Output is correct
23 Correct 5 ms 5212 KB Output is correct
24 Correct 37 ms 5436 KB Output is correct
25 Correct 32 ms 5356 KB Output is correct
26 Correct 41 ms 5524 KB Output is correct
27 Correct 15 ms 5400 KB Output is correct
28 Correct 24 ms 5460 KB Output is correct
29 Correct 37 ms 5460 KB Output is correct
30 Correct 27 ms 5548 KB Output is correct
31 Correct 24 ms 5504 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 2 ms 4948 KB Output is correct
5 Correct 6 ms 5204 KB Output is correct
6 Correct 5 ms 5204 KB Output is correct
7 Correct 5 ms 5312 KB Output is correct
8 Correct 6 ms 5204 KB Output is correct
9 Correct 6 ms 5312 KB Output is correct
10 Correct 5 ms 5204 KB Output is correct
11 Correct 6 ms 5204 KB Output is correct
12 Correct 42 ms 5600 KB Output is correct
13 Correct 42 ms 5588 KB Output is correct
14 Correct 23 ms 5460 KB Output is correct
15 Correct 23 ms 5460 KB Output is correct
16 Correct 5 ms 5204 KB Output is correct
17 Correct 5 ms 5204 KB Output is correct
18 Correct 4 ms 5204 KB Output is correct
19 Correct 23 ms 5424 KB Output is correct
20 Correct 24 ms 5428 KB Output is correct
21 Correct 24 ms 5364 KB Output is correct
22 Correct 5 ms 5204 KB Output is correct
23 Correct 5 ms 5212 KB Output is correct
24 Correct 37 ms 5436 KB Output is correct
25 Correct 32 ms 5356 KB Output is correct
26 Correct 41 ms 5524 KB Output is correct
27 Correct 15 ms 5400 KB Output is correct
28 Correct 24 ms 5460 KB Output is correct
29 Correct 37 ms 5460 KB Output is correct
30 Correct 27 ms 5548 KB Output is correct
31 Correct 24 ms 5504 KB Output is correct
32 Correct 6 ms 5204 KB Output is correct
33 Correct 166 ms 15380 KB Output is correct
34 Correct 171 ms 15276 KB Output is correct
35 Correct 162 ms 15304 KB Output is correct
36 Correct 170 ms 15248 KB Output is correct
37 Correct 145 ms 15288 KB Output is correct
38 Correct 157 ms 15180 KB Output is correct
39 Execution timed out 2058 ms 27664 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 2 ms 4948 KB Output is correct
5 Correct 6 ms 5204 KB Output is correct
6 Correct 5 ms 5204 KB Output is correct
7 Correct 5 ms 5312 KB Output is correct
8 Correct 6 ms 5204 KB Output is correct
9 Correct 6 ms 5312 KB Output is correct
10 Correct 5 ms 5204 KB Output is correct
11 Correct 6 ms 5204 KB Output is correct
12 Correct 42 ms 5600 KB Output is correct
13 Correct 42 ms 5588 KB Output is correct
14 Correct 23 ms 5460 KB Output is correct
15 Correct 23 ms 5460 KB Output is correct
16 Correct 5 ms 5204 KB Output is correct
17 Correct 5 ms 5204 KB Output is correct
18 Correct 4 ms 5204 KB Output is correct
19 Correct 23 ms 5424 KB Output is correct
20 Correct 24 ms 5428 KB Output is correct
21 Correct 24 ms 5364 KB Output is correct
22 Correct 5 ms 5204 KB Output is correct
23 Correct 5 ms 5212 KB Output is correct
24 Correct 37 ms 5436 KB Output is correct
25 Correct 32 ms 5356 KB Output is correct
26 Correct 41 ms 5524 KB Output is correct
27 Correct 15 ms 5400 KB Output is correct
28 Correct 24 ms 5460 KB Output is correct
29 Correct 37 ms 5460 KB Output is correct
30 Correct 27 ms 5548 KB Output is correct
31 Correct 24 ms 5504 KB Output is correct
32 Correct 6 ms 5204 KB Output is correct
33 Correct 166 ms 15380 KB Output is correct
34 Correct 171 ms 15276 KB Output is correct
35 Correct 162 ms 15304 KB Output is correct
36 Correct 170 ms 15248 KB Output is correct
37 Correct 145 ms 15288 KB Output is correct
38 Correct 157 ms 15180 KB Output is correct
39 Execution timed out 2058 ms 27664 KB Time limit exceeded
40 Halted 0 ms 0 KB -