oj.uz

Submission #978825

# Submission time Handle Problem Language Result Execution time Memory
978825 2024-05-09T18:16:31 Z GrindMachine Fireworks (APIO16_fireworks) C++17
100 / 100
 211 ms 85084 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

/*

figured out the solution from multiple sources

*/

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

vector<pll> adj[N];
vector<ll> final_slope(N);
priority_queue<ll> pq[N];

void dfs1(ll u, ll pw){
    if(adj[u].empty()){
        pq[u].push(pw);
        pq[u].push(pw);
        final_slope[u] = 1;
        return;
    }

    for(auto [v,w] : adj[u]){
        dfs1(v,w);
        
        if(sz(pq[u]) < sz(pq[v])){
            swap(pq[u],pq[v]);
        }
        while(!pq[v].empty()){
            pq[u].push(pq[v].top());
            pq[v].pop();
        }

        final_slope[u] += final_slope[v];
    }

    while(final_slope[u] >= 2){
        final_slope[u]--;
        pq[u].pop();
    }

    vector<ll> vals;
    rep1(iter,2){
        vals.pb(pq[u].top());
        pq[u].pop();
    }

    trav(x,vals){
        pq[u].push(x+pw);
    }
}

void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    ll sumw = 0;
    for(int i = 2; i <= n+m; ++i){
        ll p,w; cin >> p >> w;
        adj[p].pb({i,w});
        sumw += w;
    }

    dfs1(1,0);

    while(final_slope[1] >= 1){
        final_slope[1]--;
        pq[1].pop();
    }

    ll ans = sumw;
    while(!pq[1].empty()){
        ans -= pq[1].top();
        pq[1].pop();
    }

    cout << ans << endl;
}

int main()
{
    fastio;

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

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

    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 6 ms 19036 KB Output is correct
5 Correct 5 ms 19036 KB Output is correct
6 Correct 5 ms 19036 KB Output is correct
7 Correct 6 ms 19036 KB Output is correct
8 Correct 5 ms 19036 KB Output is correct
9 Correct 5 ms 19036 KB Output is correct
10 Correct 5 ms 19036 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory 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 5 ms 19036 KB Output is correct
6 Correct 5 ms 19036 KB Output is correct
7 Correct 6 ms 19032 KB Output is correct
8 Correct 5 ms 19036 KB Output is correct
9 Correct 6 ms 19036 KB Output is correct
10 Correct 5 ms 19032 KB Output is correct
11 Correct 5 ms 19036 KB Output is correct
12 Correct 5 ms 19036 KB Output is correct
13 Correct 5 ms 19036 KB Output is correct
14 Correct 5 ms 19292 KB Output is correct
15 Correct 6 ms 19036 KB Output is correct
16 Correct 6 ms 19036 KB Output is correct
17 Correct 5 ms 19212 KB Output is correct
18 Correct 5 ms 19036 KB Output is correct
19 Correct 5 ms 19036 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 6 ms 19036 KB Output is correct
5 Correct 5 ms 19036 KB Output is correct
6 Correct 5 ms 19036 KB Output is correct
7 Correct 6 ms 19036 KB Output is correct
8 Correct 5 ms 19036 KB Output is correct
9 Correct 5 ms 19036 KB Output is correct
10 Correct 5 ms 19036 KB Output is correct
11 Correct 5 ms 19036 KB Output is correct
12 Correct 5 ms 19036 KB Output is correct
13 Correct 5 ms 19036 KB Output is correct
14 Correct 5 ms 19036 KB Output is correct
15 Correct 5 ms 19036 KB Output is correct
16 Correct 5 ms 19036 KB Output is correct
17 Correct 6 ms 19032 KB Output is correct
18 Correct 5 ms 19036 KB Output is correct
19 Correct 6 ms 19036 KB Output is correct
20 Correct 5 ms 19032 KB Output is correct
21 Correct 5 ms 19036 KB Output is correct
22 Correct 5 ms 19036 KB Output is correct
23 Correct 5 ms 19036 KB Output is correct
24 Correct 5 ms 19292 KB Output is correct
25 Correct 6 ms 19036 KB Output is correct
26 Correct 6 ms 19036 KB Output is correct
27 Correct 5 ms 19212 KB Output is correct
28 Correct 5 ms 19036 KB Output is correct
29 Correct 5 ms 19036 KB Output is correct
30 Correct 5 ms 19032 KB Output is correct
31 Correct 5 ms 19292 KB Output is correct
32 Correct 6 ms 19128 KB Output is correct
33 Correct 6 ms 19292 KB Output is correct
34 Correct 6 ms 19292 KB Output is correct
35 Correct 7 ms 19292 KB Output is correct
36 Correct 7 ms 19292 KB Output is correct
37 Correct 7 ms 19292 KB Output is correct
38 Correct 9 ms 19292 KB Output is correct
39 Correct 6 ms 19292 KB Output is correct
40 Correct 7 ms 20060 KB Output is correct
41 Correct 7 ms 20060 KB Output is correct
42 Correct 6 ms 19292 KB Output is correct
43 Correct 8 ms 19800 KB Output is correct
44 Correct 9 ms 19740 KB Output is correct
45 Correct 7 ms 19548 KB Output is correct
46 Correct 7 ms 19600 KB Output is correct
47 Correct 7 ms 19548 KB Output is correct
48 Correct 7 ms 19548 KB Output is correct
49 Correct 7 ms 19548 KB Output is correct
50 Correct 6 ms 19292 KB Output is correct
51 Correct 7 ms 19292 KB Output is correct
52 Correct 7 ms 19548 KB Output is correct
53 Correct 7 ms 19544 KB Output is correct
54 Correct 7 ms 19548 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 4 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 6 ms 19036 KB Output is correct
5 Correct 5 ms 19036 KB Output is correct
6 Correct 5 ms 19036 KB Output is correct
7 Correct 6 ms 19036 KB Output is correct
8 Correct 5 ms 19036 KB Output is correct
9 Correct 5 ms 19036 KB Output is correct
10 Correct 5 ms 19036 KB Output is correct
11 Correct 5 ms 19036 KB Output is correct
12 Correct 5 ms 19036 KB Output is correct
13 Correct 5 ms 19036 KB Output is correct
14 Correct 5 ms 19036 KB Output is correct
15 Correct 5 ms 19036 KB Output is correct
16 Correct 5 ms 19036 KB Output is correct
17 Correct 6 ms 19032 KB Output is correct
18 Correct 5 ms 19036 KB Output is correct
19 Correct 6 ms 19036 KB Output is correct
20 Correct 5 ms 19032 KB Output is correct
21 Correct 5 ms 19036 KB Output is correct
22 Correct 5 ms 19036 KB Output is correct
23 Correct 5 ms 19036 KB Output is correct
24 Correct 5 ms 19292 KB Output is correct
25 Correct 6 ms 19036 KB Output is correct
26 Correct 6 ms 19036 KB Output is correct
27 Correct 5 ms 19212 KB Output is correct
28 Correct 5 ms 19036 KB Output is correct
29 Correct 5 ms 19036 KB Output is correct
30 Correct 5 ms 19032 KB Output is correct
31 Correct 5 ms 19292 KB Output is correct
32 Correct 6 ms 19128 KB Output is correct
33 Correct 6 ms 19292 KB Output is correct
34 Correct 6 ms 19292 KB Output is correct
35 Correct 7 ms 19292 KB Output is correct
36 Correct 7 ms 19292 KB Output is correct
37 Correct 7 ms 19292 KB Output is correct
38 Correct 9 ms 19292 KB Output is correct
39 Correct 6 ms 19292 KB Output is correct
40 Correct 7 ms 20060 KB Output is correct
41 Correct 7 ms 20060 KB Output is correct
42 Correct 6 ms 19292 KB Output is correct
43 Correct 8 ms 19800 KB Output is correct
44 Correct 9 ms 19740 KB Output is correct
45 Correct 7 ms 19548 KB Output is correct
46 Correct 7 ms 19600 KB Output is correct
47 Correct 7 ms 19548 KB Output is correct
48 Correct 7 ms 19548 KB Output is correct
49 Correct 7 ms 19548 KB Output is correct
50 Correct 6 ms 19292 KB Output is correct
51 Correct 7 ms 19292 KB Output is correct
52 Correct 7 ms 19548 KB Output is correct
53 Correct 7 ms 19544 KB Output is correct
54 Correct 7 ms 19548 KB Output is correct
55 Correct 11 ms 19804 KB Output is correct
56 Correct 27 ms 21952 KB Output is correct
57 Correct 56 ms 23636 KB Output is correct
58 Correct 57 ms 25036 KB Output is correct
59 Correct 97 ms 26876 KB Output is correct
60 Correct 110 ms 31400 KB Output is correct
61 Correct 125 ms 33484 KB Output is correct
62 Correct 146 ms 35060 KB Output is correct
63 Correct 211 ms 37932 KB Output is correct
64 Correct 181 ms 38820 KB Output is correct
65 Correct 102 ms 85072 KB Output is correct
66 Correct 107 ms 85084 KB Output is correct
67 Correct 97 ms 33476 KB Output is correct
68 Correct 145 ms 63000 KB Output is correct
69 Correct 164 ms 59112 KB Output is correct
70 Correct 183 ms 58960 KB Output is correct
71 Correct 169 ms 51240 KB Output is correct
72 Correct 199 ms 52928 KB Output is correct
73 Correct 175 ms 47556 KB Output is correct
74 Correct 149 ms 47036 KB Output is correct
75 Correct 153 ms 46080 KB Output is correct
76 Correct 153 ms 46844 KB Output is correct
77 Correct 155 ms 45960 KB Output is correct
78 Correct 170 ms 42636 KB Output is correct
79 Correct 141 ms 46904 KB Output is correct