oj.uz

답안 #952064

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
952064 2024-03-23T04:55:20 Z GrindMachine Worst Reporter 4 (JOI21_worst_reporter4) C++17
79 / 100
 331 ms 524288 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/88748?#comment-774017 (thread)
got the key idea, but didnt know how to implement in a clean way

implementation idea:
represent the subtree cost @u as a staircase function using a map
can be merged efficiently using small to large

*/

const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<ll> adj[N];
vector<pll> a(N);
vector<ll> subsiz(N);

void dfs1(ll u){
    subsiz[u] = 1;
    trav(v,adj[u]){
        dfs1(v);
        subsiz[u] += subsiz[v];
    }
}

map<ll,ll> mp[N];

void dfs2(ll u){
    if(adj[u].empty()){
        auto [h,c] = a[u];
        mp[u][1] = 0;
        mp[u][h+1] = c;
        return;
    }

    pll best = {-1,-1};
    trav(v,adj[u]){
        pll px = {subsiz[v],v};
        amax(best,px);
    }

    ll heavy = best.ss;
    assert(heavy != -1);
    dfs2(heavy);
    swap(mp[u],mp[heavy]);

    trav(v,adj[u]){
        if(v == heavy) conts;
        dfs2(v);
        for(auto [i,x] : mp[v]){
            mp[u][i] += x;
        }
        mp[v].clear();
    }

    auto [h,c] = a[u];
    mp[u][1] += c;
    mp[u][h] -= c;
    mp[u][h+1] += c;

    auto it = mp[u].find(h);
    vector<ll> rem;

    ll val = mp[u][h], recent_h = h; 
    while(val < 0){
        it--;
        rem.pb(recent_h);
        recent_h = it->first;
        val += it->second;
    }

    mp[u][recent_h] = val;

    trav(x,rem){
        mp[u].erase(x);
    }
}

void solve(int test_case)
{
    ll n; cin >> n;
    rep1(i,n){
        ll p,h,c; cin >> p >> h >> c;
        if(p != i){
            adj[p].pb(i);
        }
        a[i] = {h,c};
    }

    dfs1(1);
    dfs2(1);

    ll ans = mp[1][1];
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 19036 KB Output is correct
2 Correct 5 ms 19036 KB Output is correct
3 Correct 5 ms 19036 KB Output is correct
4 Correct 5 ms 19036 KB Output is correct
5 Correct 10 ms 19548 KB Output is correct
6 Correct 8 ms 19292 KB Output is correct
7 Correct 8 ms 19224 KB Output is correct
8 Correct 11 ms 19612 KB Output is correct
9 Correct 8 ms 19292 KB Output is correct
10 Correct 8 ms 19216 KB Output is correct
11 Correct 7 ms 19292 KB Output is correct
12 Correct 9 ms 20148 KB Output is correct
13 Correct 8 ms 20060 KB Output is correct
14 Correct 9 ms 19804 KB Output is correct
15 Correct 8 ms 19804 KB Output is correct
16 Correct 10 ms 19544 KB Output is correct
17 Correct 8 ms 19160 KB Output is correct
18 Correct 7 ms 19292 KB Output is correct
19 Correct 10 ms 19832 KB Output is correct
20 Correct 7 ms 19548 KB Output is correct
21 Correct 7 ms 19544 KB Output is correct
22 Correct 8 ms 19548 KB Output is correct
23 Correct 8 ms 19292 KB Output is correct
24 Correct 8 ms 19804 KB Output is correct
25 Correct 7 ms 19736 KB Output is correct
26 Correct 9 ms 20568 KB Output is correct
27 Correct 9 ms 19768 KB Output is correct
28 Correct 8 ms 20060 KB Output is correct
29 Correct 8 ms 20152 KB Output is correct
30 Correct 9 ms 20060 KB Output is correct
31 Correct 9 ms 20060 KB Output is correct

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 19036 KB Output is correct
2 Correct 5 ms 19036 KB Output is correct
3 Correct 5 ms 19036 KB Output is correct
4 Correct 5 ms 19036 KB Output is correct
5 Correct 10 ms 19548 KB Output is correct
6 Correct 8 ms 19292 KB Output is correct
7 Correct 8 ms 19224 KB Output is correct
8 Correct 11 ms 19612 KB Output is correct
9 Correct 8 ms 19292 KB Output is correct
10 Correct 8 ms 19216 KB Output is correct
11 Correct 7 ms 19292 KB Output is correct
12 Correct 9 ms 20148 KB Output is correct
13 Correct 8 ms 20060 KB Output is correct
14 Correct 9 ms 19804 KB Output is correct
15 Correct 8 ms 19804 KB Output is correct
16 Correct 10 ms 19544 KB Output is correct
17 Correct 8 ms 19160 KB Output is correct
18 Correct 7 ms 19292 KB Output is correct
19 Correct 10 ms 19832 KB Output is correct
20 Correct 7 ms 19548 KB Output is correct
21 Correct 7 ms 19544 KB Output is correct
22 Correct 8 ms 19548 KB Output is correct
23 Correct 8 ms 19292 KB Output is correct
24 Correct 8 ms 19804 KB Output is correct
25 Correct 7 ms 19736 KB Output is correct
26 Correct 9 ms 20568 KB Output is correct
27 Correct 9 ms 19768 KB Output is correct
28 Correct 8 ms 20060 KB Output is correct
29 Correct 8 ms 20152 KB Output is correct
30 Correct 9 ms 20060 KB Output is correct
31 Correct 9 ms 20060 KB Output is correct
32 Correct 11 ms 19548 KB Output is correct
33 Correct 253 ms 40008 KB Output is correct
34 Correct 180 ms 28256 KB Output is correct
35 Correct 243 ms 38224 KB Output is correct
36 Correct 178 ms 28304 KB Output is correct
37 Correct 132 ms 27988 KB Output is correct
38 Correct 117 ms 27748 KB Output is correct
39 Correct 192 ms 65108 KB Output is correct
40 Correct 166 ms 64976 KB Output is correct
41 Correct 96 ms 64852 KB Output is correct
42 Correct 176 ms 47948 KB Output is correct
43 Correct 160 ms 47856 KB Output is correct
44 Correct 233 ms 39516 KB Output is correct
45 Correct 156 ms 27732 KB Output is correct
46 Correct 73 ms 27216 KB Output is correct
47 Correct 206 ms 51440 KB Output is correct
48 Correct 118 ms 44628 KB Output is correct
49 Correct 83 ms 44592 KB Output is correct
50 Correct 135 ms 37448 KB Output is correct
51 Correct 73 ms 25188 KB Output is correct
52 Correct 201 ms 52612 KB Output is correct
53 Correct 114 ms 45508 KB Output is correct
54 Correct 242 ms 77648 KB Output is correct
55 Correct 210 ms 53844 KB Output is correct
56 Correct 168 ms 63828 KB Output is correct
57 Correct 164 ms 68692 KB Output is correct
58 Correct 210 ms 65940 KB Output is correct
59 Correct 209 ms 65872 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 19036 KB Output is correct
2 Correct 5 ms 19036 KB Output is correct
3 Correct 5 ms 19036 KB Output is correct
4 Correct 5 ms 19036 KB Output is correct
5 Correct 10 ms 19548 KB Output is correct
6 Correct 8 ms 19292 KB Output is correct
7 Correct 8 ms 19224 KB Output is correct
8 Correct 11 ms 19612 KB Output is correct
9 Correct 8 ms 19292 KB Output is correct
10 Correct 8 ms 19216 KB Output is correct
11 Correct 7 ms 19292 KB Output is correct
12 Correct 9 ms 20148 KB Output is correct
13 Correct 8 ms 20060 KB Output is correct
14 Correct 9 ms 19804 KB Output is correct
15 Correct 8 ms 19804 KB Output is correct
16 Correct 10 ms 19544 KB Output is correct
17 Correct 8 ms 19160 KB Output is correct
18 Correct 7 ms 19292 KB Output is correct
19 Correct 10 ms 19832 KB Output is correct
20 Correct 7 ms 19548 KB Output is correct
21 Correct 7 ms 19544 KB Output is correct
22 Correct 8 ms 19548 KB Output is correct
23 Correct 8 ms 19292 KB Output is correct
24 Correct 8 ms 19804 KB Output is correct
25 Correct 7 ms 19736 KB Output is correct
26 Correct 9 ms 20568 KB Output is correct
27 Correct 9 ms 19768 KB Output is correct
28 Correct 8 ms 20060 KB Output is correct
29 Correct 8 ms 20152 KB Output is correct
30 Correct 9 ms 20060 KB Output is correct
31 Correct 9 ms 20060 KB Output is correct
32 Correct 11 ms 19548 KB Output is correct
33 Correct 253 ms 40008 KB Output is correct
34 Correct 180 ms 28256 KB Output is correct
35 Correct 243 ms 38224 KB Output is correct
36 Correct 178 ms 28304 KB Output is correct
37 Correct 132 ms 27988 KB Output is correct
38 Correct 117 ms 27748 KB Output is correct
39 Correct 192 ms 65108 KB Output is correct
40 Correct 166 ms 64976 KB Output is correct
41 Correct 96 ms 64852 KB Output is correct
42 Correct 176 ms 47948 KB Output is correct
43 Correct 160 ms 47856 KB Output is correct
44 Correct 233 ms 39516 KB Output is correct
45 Correct 156 ms 27732 KB Output is correct
46 Correct 73 ms 27216 KB Output is correct
47 Correct 206 ms 51440 KB Output is correct
48 Correct 118 ms 44628 KB Output is correct
49 Correct 83 ms 44592 KB Output is correct
50 Correct 135 ms 37448 KB Output is correct
51 Correct 73 ms 25188 KB Output is correct
52 Correct 201 ms 52612 KB Output is correct
53 Correct 114 ms 45508 KB Output is correct
54 Correct 242 ms 77648 KB Output is correct
55 Correct 210 ms 53844 KB Output is correct
56 Correct 168 ms 63828 KB Output is correct
57 Correct 164 ms 68692 KB Output is correct
58 Correct 210 ms 65940 KB Output is correct
59 Correct 209 ms 65872 KB Output is correct
60 Runtime error 331 ms 524288 KB Execution killed with signal 9
61 Halted 0 ms 0 KB -