oj.uz

답안 #899596

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

using namespace std;

const int MAX_N = 1e5;
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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8820 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 10 ms 9608 KB Output is correct
6 Correct 11 ms 9088 KB Output is correct
7 Correct 7 ms 9052 KB Output is correct
8 Correct 10 ms 9564 KB Output is correct
9 Correct 8 ms 9192 KB Output is correct
10 Correct 7 ms 9052 KB Output is correct
11 Correct 6 ms 9052 KB Output is correct
12 Correct 37 ms 10832 KB Output is correct
13 Correct 7 ms 10328 KB Output is correct
14 Correct 27 ms 10588 KB Output is correct
15 Correct 8 ms 9820 KB Output is correct
16 Correct 11 ms 9600 KB Output is correct
17 Correct 9 ms 9300 KB Output is correct
18 Correct 6 ms 9052 KB Output is correct
19 Correct 9 ms 10076 KB Output is correct
20 Correct 7 ms 9564 KB Output is correct
21 Correct 6 ms 9604 KB Output is correct
22 Correct 7 ms 9816 KB Output is correct
23 Correct 6 ms 9816 KB Output is correct
24 Correct 9 ms 10076 KB Output is correct
25 Correct 8 ms 10200 KB Output is correct
26 Correct 1637 ms 11416 KB Output is correct
27 Correct 32 ms 9808 KB Output is correct
28 Correct 55 ms 10064 KB Output is correct
29 Correct 47 ms 10456 KB Output is correct
30 Correct 12 ms 11096 KB Output is correct
31 Correct 9 ms 11100 KB Output is correct

Subtask #2
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8820 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 10 ms 9608 KB Output is correct
6 Correct 11 ms 9088 KB Output is correct
7 Correct 7 ms 9052 KB Output is correct
8 Correct 10 ms 9564 KB Output is correct
9 Correct 8 ms 9192 KB Output is correct
10 Correct 7 ms 9052 KB Output is correct
11 Correct 6 ms 9052 KB Output is correct
12 Correct 37 ms 10832 KB Output is correct
13 Correct 7 ms 10328 KB Output is correct
14 Correct 27 ms 10588 KB Output is correct
15 Correct 8 ms 9820 KB Output is correct
16 Correct 11 ms 9600 KB Output is correct
17 Correct 9 ms 9300 KB Output is correct
18 Correct 6 ms 9052 KB Output is correct
19 Correct 9 ms 10076 KB Output is correct
20 Correct 7 ms 9564 KB Output is correct
21 Correct 6 ms 9604 KB Output is correct
22 Correct 7 ms 9816 KB Output is correct
23 Correct 6 ms 9816 KB Output is correct
24 Correct 9 ms 10076 KB Output is correct
25 Correct 8 ms 10200 KB Output is correct
26 Correct 1637 ms 11416 KB Output is correct
27 Correct 32 ms 9808 KB Output is correct
28 Correct 55 ms 10064 KB Output is correct
29 Correct 47 ms 10456 KB Output is correct
30 Correct 12 ms 11096 KB Output is correct
31 Correct 9 ms 11100 KB Output is correct
32 Correct 10 ms 9564 KB Output is correct
33 Incorrect 166 ms 23372 KB Output isn't correct
34 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 2 ms 8820 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 10 ms 9608 KB Output is correct
6 Correct 11 ms 9088 KB Output is correct
7 Correct 7 ms 9052 KB Output is correct
8 Correct 10 ms 9564 KB Output is correct
9 Correct 8 ms 9192 KB Output is correct
10 Correct 7 ms 9052 KB Output is correct
11 Correct 6 ms 9052 KB Output is correct
12 Correct 37 ms 10832 KB Output is correct
13 Correct 7 ms 10328 KB Output is correct
14 Correct 27 ms 10588 KB Output is correct
15 Correct 8 ms 9820 KB Output is correct
16 Correct 11 ms 9600 KB Output is correct
17 Correct 9 ms 9300 KB Output is correct
18 Correct 6 ms 9052 KB Output is correct
19 Correct 9 ms 10076 KB Output is correct
20 Correct 7 ms 9564 KB Output is correct
21 Correct 6 ms 9604 KB Output is correct
22 Correct 7 ms 9816 KB Output is correct
23 Correct 6 ms 9816 KB Output is correct
24 Correct 9 ms 10076 KB Output is correct
25 Correct 8 ms 10200 KB Output is correct
26 Correct 1637 ms 11416 KB Output is correct
27 Correct 32 ms 9808 KB Output is correct
28 Correct 55 ms 10064 KB Output is correct
29 Correct 47 ms 10456 KB Output is correct
30 Correct 12 ms 11096 KB Output is correct
31 Correct 9 ms 11100 KB Output is correct
32 Correct 10 ms 9564 KB Output is correct
33 Incorrect 166 ms 23372 KB Output isn't correct
34 Halted 0 ms 0 KB -