oj.uz

Submission #899597

# Submission time Handle Problem Language Result Execution time Memory
899597 2024-01-06T14:02:21 Z LucaIlie Worst Reporter 4 (JOI21_worst_reporter4) C++17
14 / 100
 2000 ms 80060 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 2e5;
int n;
int parent[MAX_N + 1], height[MAX_N + 1], cost[MAX_N + 1], sc[MAX_N + 1];
vector <int> children[MAX_N + 1];
map <int, long long> inc[MAX_N + 1];

void dfs( int u ) {
    sc[u] = cost[u];
    for ( int v: children[u] ) {
        dfs( v );
        sc[u] += sc[v];
    }

    int maxSize = 0, h = -1;
    for ( int v: children[u] ) {
        if ( inc[v].size() > maxSize ) {
            maxSize = inc[v].size();
            h = v;
        }
    }

    inc[u][-1] = 0;
    if ( h == -1 ) {
        inc[u][0] -= cost[u];
        inc[u][height[u] + 1] += cost[u];

    } else {
        swap( inc[u], inc[h] );
        for ( int v: children[u] ) {
            if ( v == h )
                continue;
            for ( auto x: inc[v] )
                inc[u][x.first] += x.second;
            inc[v].clear();
        }

        auto p = inc[u].lower_bound( height[u] );
        if ( p != inc[u].begin() ) {
            p--;
            long long c = inc[u][height[u]];
            vector<pair<int, long long>> pos;
            pos.push_back( { height[u], 0 } );
            while ( p->first != -1 && c <= cost[u] ) {
                pos.push_back( { p->first, c } );
                c += p->second;
                p--;
            }
            for ( int i = pos.size() - 1; i >= 0; i-- ) {
                int p = pos[i].first;
                long long c = pos[i].second;
                inc[u][p] += (i == pos.size() - 1 ? c - cost[u] : c - pos[i + 1].second);
            }
            inc[u][height[u] + 1] += cost[u];
        }
    }
    inc[u][-1] = 0;
}

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++ )
        c += cost[v];

    dfs( 1 );

    cout << c + inc[1][0];

    return 0;
}

Compilation message

worst_reporter2.cpp: In function 'void dfs(int)':
worst_reporter2.cpp:20:28: warning: comparison of integer expressions of different signedness: 'std::map<int, long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   20 |         if ( inc[v].size() > maxSize ) {
      |              ~~~~~~~~~~~~~~^~~~~~~~~
worst_reporter2.cpp:55:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |                 inc[u][p] += (i == pos.size() - 1 ? c - cost[u] : c - pos[i + 1].second);
      |                               ~~^~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 13 ms 17756 KB Output is correct
6 Correct 9 ms 17268 KB Output is correct
7 Correct 10 ms 17244 KB Output is correct
8 Correct 12 ms 17640 KB Output is correct
9 Correct 10 ms 17244 KB Output is correct
10 Correct 9 ms 17244 KB Output is correct
11 Correct 8 ms 17032 KB Output is correct
12 Correct 43 ms 19064 KB Output is correct
13 Correct 8 ms 18268 KB Output is correct
14 Correct 29 ms 18716 KB Output is correct
15 Correct 10 ms 17756 KB Output is correct
16 Correct 15 ms 17756 KB Output is correct
17 Correct 10 ms 17244 KB Output is correct
18 Correct 8 ms 17028 KB Output is correct
19 Correct 10 ms 18112 KB Output is correct
20 Correct 8 ms 17500 KB Output is correct
21 Correct 8 ms 17500 KB Output is correct
22 Correct 8 ms 17756 KB Output is correct
23 Correct 8 ms 17756 KB Output is correct
24 Correct 10 ms 18012 KB Output is correct
25 Correct 8 ms 18008 KB Output is correct
26 Correct 1629 ms 19436 KB Output is correct
27 Correct 34 ms 18012 KB Output is correct
28 Correct 57 ms 18284 KB Output is correct
29 Correct 49 ms 18524 KB Output is correct
30 Correct 12 ms 19124 KB Output is correct
31 Correct 12 ms 19072 KB Output is correct

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 13 ms 17756 KB Output is correct
6 Correct 9 ms 17268 KB Output is correct
7 Correct 10 ms 17244 KB Output is correct
8 Correct 12 ms 17640 KB Output is correct
9 Correct 10 ms 17244 KB Output is correct
10 Correct 9 ms 17244 KB Output is correct
11 Correct 8 ms 17032 KB Output is correct
12 Correct 43 ms 19064 KB Output is correct
13 Correct 8 ms 18268 KB Output is correct
14 Correct 29 ms 18716 KB Output is correct
15 Correct 10 ms 17756 KB Output is correct
16 Correct 15 ms 17756 KB Output is correct
17 Correct 10 ms 17244 KB Output is correct
18 Correct 8 ms 17028 KB Output is correct
19 Correct 10 ms 18112 KB Output is correct
20 Correct 8 ms 17500 KB Output is correct
21 Correct 8 ms 17500 KB Output is correct
22 Correct 8 ms 17756 KB Output is correct
23 Correct 8 ms 17756 KB Output is correct
24 Correct 10 ms 18012 KB Output is correct
25 Correct 8 ms 18008 KB Output is correct
26 Correct 1629 ms 19436 KB Output is correct
27 Correct 34 ms 18012 KB Output is correct
28 Correct 57 ms 18284 KB Output is correct
29 Correct 49 ms 18524 KB Output is correct
30 Correct 12 ms 19124 KB Output is correct
31 Correct 12 ms 19072 KB Output is correct
32 Correct 12 ms 17752 KB Output is correct
33 Correct 577 ms 53888 KB Output is correct
34 Correct 344 ms 32844 KB Output is correct
35 Correct 483 ms 53888 KB Output is correct
36 Correct 339 ms 32756 KB Output is correct
37 Correct 257 ms 32080 KB Output is correct
38 Correct 222 ms 31976 KB Output is correct
39 Execution timed out 2013 ms 80060 KB Time limit exceeded
40 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 4 ms 16988 KB Output is correct
5 Correct 13 ms 17756 KB Output is correct
6 Correct 9 ms 17268 KB Output is correct
7 Correct 10 ms 17244 KB Output is correct
8 Correct 12 ms 17640 KB Output is correct
9 Correct 10 ms 17244 KB Output is correct
10 Correct 9 ms 17244 KB Output is correct
11 Correct 8 ms 17032 KB Output is correct
12 Correct 43 ms 19064 KB Output is correct
13 Correct 8 ms 18268 KB Output is correct
14 Correct 29 ms 18716 KB Output is correct
15 Correct 10 ms 17756 KB Output is correct
16 Correct 15 ms 17756 KB Output is correct
17 Correct 10 ms 17244 KB Output is correct
18 Correct 8 ms 17028 KB Output is correct
19 Correct 10 ms 18112 KB Output is correct
20 Correct 8 ms 17500 KB Output is correct
21 Correct 8 ms 17500 KB Output is correct
22 Correct 8 ms 17756 KB Output is correct
23 Correct 8 ms 17756 KB Output is correct
24 Correct 10 ms 18012 KB Output is correct
25 Correct 8 ms 18008 KB Output is correct
26 Correct 1629 ms 19436 KB Output is correct
27 Correct 34 ms 18012 KB Output is correct
28 Correct 57 ms 18284 KB Output is correct
29 Correct 49 ms 18524 KB Output is correct
30 Correct 12 ms 19124 KB Output is correct
31 Correct 12 ms 19072 KB Output is correct
32 Correct 12 ms 17752 KB Output is correct
33 Correct 577 ms 53888 KB Output is correct
34 Correct 344 ms 32844 KB Output is correct
35 Correct 483 ms 53888 KB Output is correct
36 Correct 339 ms 32756 KB Output is correct
37 Correct 257 ms 32080 KB Output is correct
38 Correct 222 ms 31976 KB Output is correct
39 Execution timed out 2013 ms 80060 KB Time limit exceeded
40 Halted 0 ms 0 KB -