oj.uz

답안 #899540

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
899540 2024-01-06T12:04:35 Z LucaIlie Worst Reporter 4 (JOI21_worst_reporter4) C++17
14 / 100
 202 ms 196884 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 5000;
const long long INF = 1e15;
int n;
int parent[MAX_N + 1], height[MAX_N + 1], cost[MAX_N + 1];
long long dp[MAX_N + 1][MAX_N + 1];
vector<int> children[MAX_N + 1];
map<int, int> mp;

void dfs( int u ) {
    for ( int v: children[u] )
        dfs( v );

    dp[u][n] = INF;
    for ( int x = n - 1; x >= 0; x-- ) {
        for ( int v: children[u] )
            dp[u][x] += dp[v][x];
    }
    long long c = cost[u] + dp[u][height[u]];
    for ( int x = height[u]; x >= 0; x-- )
        dp[u][x] = max( dp[u][x], c );
}

int main() {
    long long c = 0;

    cin >> n;
    for ( int v = 1; v <= n; v++ )
        cin >> parent[v] >> height[v] >> cost[v];

    for ( int v = 2; v <= n; v++ )
        children[parent[v]].push_back( v );

    for ( int v = 1; v <= n; v++ )
        mp[height[v]] = 1, c += cost[v];
    int val = 0;
    for ( auto p: mp )
        mp[p.first] = val++;
    for ( int v = 1; v <= n; v++ )
        height[v] = mp[height[v]];

    dfs( 1 );

    cout << c - dp[1][0] << "\n";

    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2608 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 89 ms 187836 KB Output is correct
6 Correct 70 ms 185120 KB Output is correct
7 Correct 86 ms 181992 KB Output is correct
8 Correct 96 ms 191568 KB Output is correct
9 Correct 69 ms 185088 KB Output is correct
10 Correct 71 ms 183996 KB Output is correct
11 Correct 68 ms 184088 KB Output is correct
12 Correct 113 ms 196884 KB Output is correct
13 Correct 101 ms 196792 KB Output is correct
14 Correct 116 ms 196816 KB Output is correct
15 Correct 101 ms 196688 KB Output is correct
16 Correct 80 ms 190188 KB Output is correct
17 Correct 74 ms 181412 KB Output is correct
18 Correct 61 ms 181072 KB Output is correct
19 Correct 107 ms 158032 KB Output is correct
20 Correct 78 ms 110420 KB Output is correct
21 Correct 77 ms 109596 KB Output is correct
22 Correct 202 ms 187672 KB Output is correct
23 Correct 175 ms 175804 KB Output is correct
24 Correct 156 ms 196432 KB Output is correct
25 Correct 157 ms 195920 KB Output is correct
26 Correct 112 ms 196804 KB Output is correct
27 Correct 105 ms 196080 KB Output is correct
28 Correct 116 ms 196236 KB Output is correct
29 Correct 108 ms 194444 KB Output is correct
30 Correct 126 ms 196720 KB Output is correct
31 Correct 114 ms 196780 KB Output is correct

Subtask #2
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2608 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 89 ms 187836 KB Output is correct
6 Correct 70 ms 185120 KB Output is correct
7 Correct 86 ms 181992 KB Output is correct
8 Correct 96 ms 191568 KB Output is correct
9 Correct 69 ms 185088 KB Output is correct
10 Correct 71 ms 183996 KB Output is correct
11 Correct 68 ms 184088 KB Output is correct
12 Correct 113 ms 196884 KB Output is correct
13 Correct 101 ms 196792 KB Output is correct
14 Correct 116 ms 196816 KB Output is correct
15 Correct 101 ms 196688 KB Output is correct
16 Correct 80 ms 190188 KB Output is correct
17 Correct 74 ms 181412 KB Output is correct
18 Correct 61 ms 181072 KB Output is correct
19 Correct 107 ms 158032 KB Output is correct
20 Correct 78 ms 110420 KB Output is correct
21 Correct 77 ms 109596 KB Output is correct
22 Correct 202 ms 187672 KB Output is correct
23 Correct 175 ms 175804 KB Output is correct
24 Correct 156 ms 196432 KB Output is correct
25 Correct 157 ms 195920 KB Output is correct
26 Correct 112 ms 196804 KB Output is correct
27 Correct 105 ms 196080 KB Output is correct
28 Correct 116 ms 196236 KB Output is correct
29 Correct 108 ms 194444 KB Output is correct
30 Correct 126 ms 196720 KB Output is correct
31 Correct 114 ms 196780 KB Output is correct
32 Incorrect 37 ms 122204 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2608 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 89 ms 187836 KB Output is correct
6 Correct 70 ms 185120 KB Output is correct
7 Correct 86 ms 181992 KB Output is correct
8 Correct 96 ms 191568 KB Output is correct
9 Correct 69 ms 185088 KB Output is correct
10 Correct 71 ms 183996 KB Output is correct
11 Correct 68 ms 184088 KB Output is correct
12 Correct 113 ms 196884 KB Output is correct
13 Correct 101 ms 196792 KB Output is correct
14 Correct 116 ms 196816 KB Output is correct
15 Correct 101 ms 196688 KB Output is correct
16 Correct 80 ms 190188 KB Output is correct
17 Correct 74 ms 181412 KB Output is correct
18 Correct 61 ms 181072 KB Output is correct
19 Correct 107 ms 158032 KB Output is correct
20 Correct 78 ms 110420 KB Output is correct
21 Correct 77 ms 109596 KB Output is correct
22 Correct 202 ms 187672 KB Output is correct
23 Correct 175 ms 175804 KB Output is correct
24 Correct 156 ms 196432 KB Output is correct
25 Correct 157 ms 195920 KB Output is correct
26 Correct 112 ms 196804 KB Output is correct
27 Correct 105 ms 196080 KB Output is correct
28 Correct 116 ms 196236 KB Output is correct
29 Correct 108 ms 194444 KB Output is correct
30 Correct 126 ms 196720 KB Output is correct
31 Correct 114 ms 196780 KB Output is correct
32 Incorrect 37 ms 122204 KB Output isn't correct
33 Halted 0 ms 0 KB -