oj.uz

Submission #1002216

# Submission time Handle Problem Language Result Execution time Memory
1002216 2024-06-19T11:01:07 Z dimashhh Fireworks (APIO16_fireworks) C++17
26 / 100
 749 ms 524288 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
const int  N = 4e5 + 30, MOD = 1e9 + 7;
#define int ll
int n,m;
vector<pair<int,int>> g[N];
multiset<ll> st[N];
ll h[N],l[N],r[N];
int mx[N];
void merge(int v,int to){
    if((int)st[v].empty() < (int)st[to].size()){
        st[v].swap(st[to]);
        swap(mx[v],mx[to]);
        swap(l[v],l[to]);
        swap(r[v],r[to]);
    }
    mx[v]+=mx[to];
    for(int j:st[to]){
        st[v].insert(j);
    }
}
void dfs(int v,int W = 0){
    if(g[v].empty()){
        st[v].insert(W);
        st[v].insert(W);
        mx[v] = 1;
        h[v] = 0;
        l[v] = r[v] = W;
        return;
    }
    for(auto [to,w]:g[v]){
        dfs(to,w);
        merge(v,to);
    }
    while(mx[v] > 1){
        mx[v]--;
        st[v].erase(st[v].find(*st[v].rbegin()));
    }
    ll x = (*st[v].rbegin());
    st[v].erase(st[v].find(*st[v].rbegin()));
    ll y = (*st[v].rbegin());
    st[v].erase(st[v].find(*st[v].rbegin()));
    st[v].insert(x + W);
    st[v].insert(y + W);
    r[v] = (*st[v].rbegin());
    l[v] = (*(++(st[v].rbegin())));
}
ll E = 0;
void test(){
    cin >> n >> m;
    for(int i = 2;i <= n + m;i++){
        int a,b;
        cin >> a >> b;
        g[a].push_back({i,b});
        E += b;
    }
    dfs(1);
    st[1].erase(--st[1].end());
    ll H = 0;
    for(int i:st[1]){
        E -= i;
    }
    cout << E << '\n';
}
signed main() {
    ios_base::sync_with_stdio(false);cin.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        test();
    }
}

Compilation message

fireworks.cpp: In function 'void test()':
fireworks.cpp:63:8: warning: unused variable 'H' [-Wunused-variable]
   63 |     ll H = 0;
      |        ^

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 28508 KB Output is correct
2 Correct 12 ms 28644 KB Output is correct
3 Correct 11 ms 29020 KB Output is correct
4 Correct 11 ms 29040 KB Output is correct
5 Correct 10 ms 28760 KB Output is correct
6 Correct 11 ms 29020 KB Output is correct
7 Correct 15 ms 29128 KB Output is correct
8 Correct 12 ms 29020 KB Output is correct
9 Correct 10 ms 28960 KB Output is correct
10 Correct 10 ms 28984 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 28508 KB Output is correct
2 Correct 10 ms 28508 KB Output is correct
3 Correct 10 ms 28508 KB Output is correct
4 Correct 11 ms 28508 KB Output is correct
5 Correct 10 ms 28508 KB Output is correct
6 Correct 12 ms 28760 KB Output is correct
7 Correct 10 ms 28504 KB Output is correct
8 Correct 11 ms 28668 KB Output is correct
9 Correct 11 ms 28504 KB Output is correct
10 Correct 12 ms 28716 KB Output is correct
11 Correct 11 ms 28764 KB Output is correct
12 Correct 11 ms 28760 KB Output is correct
13 Correct 9 ms 28764 KB Output is correct
14 Correct 10 ms 28588 KB Output is correct
15 Correct 10 ms 28764 KB Output is correct
16 Correct 11 ms 28604 KB Output is correct
17 Correct 10 ms 28760 KB Output is correct
18 Correct 11 ms 28764 KB Output is correct
19 Correct 12 ms 28764 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 28508 KB Output is correct
2 Correct 12 ms 28644 KB Output is correct
3 Correct 11 ms 29020 KB Output is correct
4 Correct 11 ms 29040 KB Output is correct
5 Correct 10 ms 28760 KB Output is correct
6 Correct 11 ms 29020 KB Output is correct
7 Correct 15 ms 29128 KB Output is correct
8 Correct 12 ms 29020 KB Output is correct
9 Correct 10 ms 28960 KB Output is correct
10 Correct 10 ms 28984 KB Output is correct
11 Correct 10 ms 28508 KB Output is correct
12 Correct 10 ms 28508 KB Output is correct
13 Correct 10 ms 28508 KB Output is correct
14 Correct 11 ms 28508 KB Output is correct
15 Correct 10 ms 28508 KB Output is correct
16 Correct 12 ms 28760 KB Output is correct
17 Correct 10 ms 28504 KB Output is correct
18 Correct 11 ms 28668 KB Output is correct
19 Correct 11 ms 28504 KB Output is correct
20 Correct 12 ms 28716 KB Output is correct
21 Correct 11 ms 28764 KB Output is correct
22 Correct 11 ms 28760 KB Output is correct
23 Correct 9 ms 28764 KB Output is correct
24 Correct 10 ms 28588 KB Output is correct
25 Correct 10 ms 28764 KB Output is correct
26 Correct 11 ms 28604 KB Output is correct
27 Correct 10 ms 28760 KB Output is correct
28 Correct 11 ms 28764 KB Output is correct
29 Correct 12 ms 28764 KB Output is correct
30 Correct 11 ms 28764 KB Output is correct
31 Correct 12 ms 29532 KB Output is correct
32 Correct 11 ms 29412 KB Output is correct
33 Correct 12 ms 30300 KB Output is correct
34 Correct 15 ms 31324 KB Output is correct
35 Correct 21 ms 33884 KB Output is correct
36 Correct 21 ms 33360 KB Output is correct
37 Correct 22 ms 32752 KB Output is correct
38 Correct 35 ms 40612 KB Output is correct
39 Correct 24 ms 33872 KB Output is correct
40 Correct 16 ms 29280 KB Output is correct
41 Correct 11 ms 29460 KB Output is correct
42 Correct 11 ms 29276 KB Output is correct
43 Correct 244 ms 176156 KB Output is correct
44 Correct 266 ms 182896 KB Output is correct
45 Correct 264 ms 179284 KB Output is correct
46 Correct 75 ms 70568 KB Output is correct
47 Correct 103 ms 86868 KB Output is correct
48 Correct 618 ms 343272 KB Output is correct
49 Correct 749 ms 402000 KB Output is correct
50 Runtime error 745 ms 524288 KB Execution killed with signal 9
51 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 28508 KB Output is correct
2 Correct 12 ms 28644 KB Output is correct
3 Correct 11 ms 29020 KB Output is correct
4 Correct 11 ms 29040 KB Output is correct
5 Correct 10 ms 28760 KB Output is correct
6 Correct 11 ms 29020 KB Output is correct
7 Correct 15 ms 29128 KB Output is correct
8 Correct 12 ms 29020 KB Output is correct
9 Correct 10 ms 28960 KB Output is correct
10 Correct 10 ms 28984 KB Output is correct
11 Correct 10 ms 28508 KB Output is correct
12 Correct 10 ms 28508 KB Output is correct
13 Correct 10 ms 28508 KB Output is correct
14 Correct 11 ms 28508 KB Output is correct
15 Correct 10 ms 28508 KB Output is correct
16 Correct 12 ms 28760 KB Output is correct
17 Correct 10 ms 28504 KB Output is correct
18 Correct 11 ms 28668 KB Output is correct
19 Correct 11 ms 28504 KB Output is correct
20 Correct 12 ms 28716 KB Output is correct
21 Correct 11 ms 28764 KB Output is correct
22 Correct 11 ms 28760 KB Output is correct
23 Correct 9 ms 28764 KB Output is correct
24 Correct 10 ms 28588 KB Output is correct
25 Correct 10 ms 28764 KB Output is correct
26 Correct 11 ms 28604 KB Output is correct
27 Correct 10 ms 28760 KB Output is correct
28 Correct 11 ms 28764 KB Output is correct
29 Correct 12 ms 28764 KB Output is correct
30 Correct 11 ms 28764 KB Output is correct
31 Correct 12 ms 29532 KB Output is correct
32 Correct 11 ms 29412 KB Output is correct
33 Correct 12 ms 30300 KB Output is correct
34 Correct 15 ms 31324 KB Output is correct
35 Correct 21 ms 33884 KB Output is correct
36 Correct 21 ms 33360 KB Output is correct
37 Correct 22 ms 32752 KB Output is correct
38 Correct 35 ms 40612 KB Output is correct
39 Correct 24 ms 33872 KB Output is correct
40 Correct 16 ms 29280 KB Output is correct
41 Correct 11 ms 29460 KB Output is correct
42 Correct 11 ms 29276 KB Output is correct
43 Correct 244 ms 176156 KB Output is correct
44 Correct 266 ms 182896 KB Output is correct
45 Correct 264 ms 179284 KB Output is correct
46 Correct 75 ms 70568 KB Output is correct
47 Correct 103 ms 86868 KB Output is correct
48 Correct 618 ms 343272 KB Output is correct
49 Correct 749 ms 402000 KB Output is correct
50 Runtime error 745 ms 524288 KB Execution killed with signal 9
51 Halted 0 ms 0 KB -