oj.uz

답안 #518928

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
518928 2022-01-25T08:12:07 Z Keshi Worst Reporter 4 (JOI21_worst_reporter4) C++17
14 / 100
 139 ms 200704 KB 
//In the name of God
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
 
const int maxn = 5100;
const int mod = 1e9 + 7;
const int inf = 1e9;
 
#define fast_io ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("input.txt", "r+", stdin);freopen("output.txt", "w+", stdout);
#define pb push_back
#define Mp make_pair
#define F first
#define S second
#define Sz(x) ll((x).size())
#define all(x) (x).begin(), (x).end()
 
ll pw(ll a, ll b){
	ll c = 1;
	while(b){
		if(b & 1) c = c * a % mod;
		a = a * a % mod;
		b >>= 1;
	}
	return c;
}
 
int n, a[maxn], h[maxn], c[maxn];
vector<int> g[maxn];
vector<int> vec;
ll dp[maxn][maxn];
 
void solve(int v){
	for(int u : g[v]){
		solve(u);
		for(int i = 0; i <= n; i++){
			dp[v][i] += dp[u][i];
		}
	}
	ll x = dp[v][h[v]] + c[v];
	for(int i = h[v]; i <= n; i++){
		dp[v][i] = max(dp[v][i], x);
	}
	return;
}
 
int main(){
	fast_io;
	
	cin >> n;
	ll sc = 0;
	for(int i = 1; i <= n; i++){
		cin >> a[i] >> h[i] >> c[i];
		vec.pb(h[i]);
		if(i != 1) g[a[i]].pb(i);
		sc += c[i];
	}
	sort(all(vec));
	vec.resize(unique(all(vec)) - vec.begin());
	for(int i = 1; i <= n; i++){
		h[i] = Sz(vec) - 1 - (lower_bound(all(vec), h[i]) - vec.begin());
	}
	solve(1);
	cout << sc - dp[1][n] << "\n";
	
	return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 496 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 100 ms 159108 KB Output is correct
6 Correct 125 ms 200088 KB Output is correct
7 Correct 131 ms 200248 KB Output is correct
8 Correct 100 ms 158940 KB Output is correct
9 Correct 127 ms 200292 KB Output is correct
10 Correct 129 ms 200252 KB Output is correct
11 Correct 130 ms 200340 KB Output is correct
12 Correct 102 ms 200644 KB Output is correct
13 Correct 109 ms 200704 KB Output is correct
14 Correct 103 ms 200524 KB Output is correct
15 Correct 109 ms 200584 KB Output is correct
16 Correct 98 ms 159084 KB Output is correct
17 Correct 124 ms 200288 KB Output is correct
18 Correct 124 ms 200244 KB Output is correct
19 Correct 107 ms 159920 KB Output is correct
20 Correct 125 ms 200516 KB Output is correct
21 Correct 125 ms 200416 KB Output is correct
22 Correct 111 ms 118220 KB Output is correct
23 Correct 139 ms 200208 KB Output is correct
24 Correct 102 ms 159284 KB Output is correct
25 Correct 125 ms 200516 KB Output is correct
26 Correct 102 ms 200700 KB Output is correct
27 Correct 95 ms 134056 KB Output is correct
28 Correct 96 ms 148244 KB Output is correct
29 Correct 97 ms 172720 KB Output is correct
30 Correct 103 ms 200388 KB Output is correct
31 Correct 102 ms 200484 KB Output is correct

Subtask #2
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 496 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 100 ms 159108 KB Output is correct
6 Correct 125 ms 200088 KB Output is correct
7 Correct 131 ms 200248 KB Output is correct
8 Correct 100 ms 158940 KB Output is correct
9 Correct 127 ms 200292 KB Output is correct
10 Correct 129 ms 200252 KB Output is correct
11 Correct 130 ms 200340 KB Output is correct
12 Correct 102 ms 200644 KB Output is correct
13 Correct 109 ms 200704 KB Output is correct
14 Correct 103 ms 200524 KB Output is correct
15 Correct 109 ms 200584 KB Output is correct
16 Correct 98 ms 159084 KB Output is correct
17 Correct 124 ms 200288 KB Output is correct
18 Correct 124 ms 200244 KB Output is correct
19 Correct 107 ms 159920 KB Output is correct
20 Correct 125 ms 200516 KB Output is correct
21 Correct 125 ms 200416 KB Output is correct
22 Correct 111 ms 118220 KB Output is correct
23 Correct 139 ms 200208 KB Output is correct
24 Correct 102 ms 159284 KB Output is correct
25 Correct 125 ms 200516 KB Output is correct
26 Correct 102 ms 200700 KB Output is correct
27 Correct 95 ms 134056 KB Output is correct
28 Correct 96 ms 148244 KB Output is correct
29 Correct 97 ms 172720 KB Output is correct
30 Correct 103 ms 200388 KB Output is correct
31 Correct 102 ms 200484 KB Output is correct
32 Correct 103 ms 159072 KB Output is correct
33 Runtime error 7 ms 1520 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 496 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 0 ms 460 KB Output is correct
4 Correct 0 ms 460 KB Output is correct
5 Correct 100 ms 159108 KB Output is correct
6 Correct 125 ms 200088 KB Output is correct
7 Correct 131 ms 200248 KB Output is correct
8 Correct 100 ms 158940 KB Output is correct
9 Correct 127 ms 200292 KB Output is correct
10 Correct 129 ms 200252 KB Output is correct
11 Correct 130 ms 200340 KB Output is correct
12 Correct 102 ms 200644 KB Output is correct
13 Correct 109 ms 200704 KB Output is correct
14 Correct 103 ms 200524 KB Output is correct
15 Correct 109 ms 200584 KB Output is correct
16 Correct 98 ms 159084 KB Output is correct
17 Correct 124 ms 200288 KB Output is correct
18 Correct 124 ms 200244 KB Output is correct
19 Correct 107 ms 159920 KB Output is correct
20 Correct 125 ms 200516 KB Output is correct
21 Correct 125 ms 200416 KB Output is correct
22 Correct 111 ms 118220 KB Output is correct
23 Correct 139 ms 200208 KB Output is correct
24 Correct 102 ms 159284 KB Output is correct
25 Correct 125 ms 200516 KB Output is correct
26 Correct 102 ms 200700 KB Output is correct
27 Correct 95 ms 134056 KB Output is correct
28 Correct 96 ms 148244 KB Output is correct
29 Correct 97 ms 172720 KB Output is correct
30 Correct 103 ms 200388 KB Output is correct
31 Correct 102 ms 200484 KB Output is correct
32 Correct 103 ms 159072 KB Output is correct
33 Runtime error 7 ms 1520 KB Execution killed with signal 11
34 Halted 0 ms 0 KB -