oj.uz

답안 #722240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
722240 2023-04-11T15:38:10 Z 600Mihnea Worst Reporter 4 (JOI21_worst_reporter4) C++17
14 / 100
 2000 ms 27700 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 dp2[N];
ll get(int a) {
	ll sol = c[a];
	for (auto& b : g[a]) {
		sol += min(dp[b], dp2[b]);
	}
	return sol;
}
void compute(int a) {
	ll init = min(dp[a], dp2[a]);
	dp[a] = 0;
	for (auto& b : g[a]) {
		dp[a] += min(dp[b], dp2[b]);
	}
	dp2[a] = dp[a];
	while (par[a]) {
		ll estim = dp2[par[a]] - init + min(dp[a], dp2[a]);
		init = min(dp[par[a]], dp2[par[a]]);
		dp2[par[a]] = get(par[a]);
		//cout << "dif : " << dp2[par[a]] - estim << "\n";
		a = par[a];
	}
}
void build1(int a) {
	//dp2[a] = c[a];
	for (auto& b : g[a]) {
		dep[b] = 1 + dep[a];
		build1(b);
		//dp2[a] += dp2[b];
	}
	dp2[a] = get(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];
		dp[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 << min(dp[1], dp2[1]) << "\n";
	return 0;
}

Compilation message

worst_reporter2.cpp: In function 'void compute(int)':
worst_reporter2.cpp:53:6: warning: unused variable 'estim' [-Wunused-variable]
   53 |   ll estim = dp2[par[a]] - init + min(dp[a], dp2[a]);
      |      ^~~~~

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 6 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 5236 KB Output is correct
11 Correct 6 ms 5280 KB Output is correct
12 Correct 55 ms 5612 KB Output is correct
13 Correct 58 ms 5588 KB Output is correct
14 Correct 29 ms 5460 KB Output is correct
15 Correct 29 ms 5484 KB Output is correct
16 Correct 6 ms 5204 KB Output is correct
17 Correct 5 ms 5204 KB Output is correct
18 Correct 5 ms 5220 KB Output is correct
19 Correct 33 ms 5412 KB Output is correct
20 Correct 32 ms 5424 KB Output is correct
21 Correct 34 ms 5332 KB Output is correct
22 Correct 28 ms 5204 KB Output is correct
23 Correct 31 ms 5204 KB Output is correct
24 Correct 50 ms 5452 KB Output is correct
25 Correct 47 ms 5436 KB Output is correct
26 Correct 52 ms 5588 KB Output is correct
27 Correct 33 ms 5388 KB Output is correct
28 Correct 39 ms 5460 KB Output is correct
29 Correct 49 ms 5536 KB Output is correct
30 Correct 30 ms 5460 KB Output is correct
31 Correct 29 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 3 ms 4948 KB Output is correct
5 Correct 6 ms 5204 KB Output is correct
6 Correct 6 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 5236 KB Output is correct
11 Correct 6 ms 5280 KB Output is correct
12 Correct 55 ms 5612 KB Output is correct
13 Correct 58 ms 5588 KB Output is correct
14 Correct 29 ms 5460 KB Output is correct
15 Correct 29 ms 5484 KB Output is correct
16 Correct 6 ms 5204 KB Output is correct
17 Correct 5 ms 5204 KB Output is correct
18 Correct 5 ms 5220 KB Output is correct
19 Correct 33 ms 5412 KB Output is correct
20 Correct 32 ms 5424 KB Output is correct
21 Correct 34 ms 5332 KB Output is correct
22 Correct 28 ms 5204 KB Output is correct
23 Correct 31 ms 5204 KB Output is correct
24 Correct 50 ms 5452 KB Output is correct
25 Correct 47 ms 5436 KB Output is correct
26 Correct 52 ms 5588 KB Output is correct
27 Correct 33 ms 5388 KB Output is correct
28 Correct 39 ms 5460 KB Output is correct
29 Correct 49 ms 5536 KB Output is correct
30 Correct 30 ms 5460 KB Output is correct
31 Correct 29 ms 5504 KB Output is correct
32 Correct 5 ms 5204 KB Output is correct
33 Correct 251 ms 15356 KB Output is correct
34 Correct 269 ms 15180 KB Output is correct
35 Correct 238 ms 15280 KB Output is correct
36 Correct 241 ms 15244 KB Output is correct
37 Correct 233 ms 15244 KB Output is correct
38 Correct 227 ms 15280 KB Output is correct
39 Execution timed out 2047 ms 27700 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 6 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 5236 KB Output is correct
11 Correct 6 ms 5280 KB Output is correct
12 Correct 55 ms 5612 KB Output is correct
13 Correct 58 ms 5588 KB Output is correct
14 Correct 29 ms 5460 KB Output is correct
15 Correct 29 ms 5484 KB Output is correct
16 Correct 6 ms 5204 KB Output is correct
17 Correct 5 ms 5204 KB Output is correct
18 Correct 5 ms 5220 KB Output is correct
19 Correct 33 ms 5412 KB Output is correct
20 Correct 32 ms 5424 KB Output is correct
21 Correct 34 ms 5332 KB Output is correct
22 Correct 28 ms 5204 KB Output is correct
23 Correct 31 ms 5204 KB Output is correct
24 Correct 50 ms 5452 KB Output is correct
25 Correct 47 ms 5436 KB Output is correct
26 Correct 52 ms 5588 KB Output is correct
27 Correct 33 ms 5388 KB Output is correct
28 Correct 39 ms 5460 KB Output is correct
29 Correct 49 ms 5536 KB Output is correct
30 Correct 30 ms 5460 KB Output is correct
31 Correct 29 ms 5504 KB Output is correct
32 Correct 5 ms 5204 KB Output is correct
33 Correct 251 ms 15356 KB Output is correct
34 Correct 269 ms 15180 KB Output is correct
35 Correct 238 ms 15280 KB Output is correct
36 Correct 241 ms 15244 KB Output is correct
37 Correct 233 ms 15244 KB Output is correct
38 Correct 227 ms 15280 KB Output is correct
39 Execution timed out 2047 ms 27700 KB Time limit exceeded
40 Halted 0 ms 0 KB -