oj.uz

Submission #1002221

# Submission time Handle Problem Language Result Execution time Memory
1002221 2024-06-19T11:03:29 Z dimashhh Fireworks (APIO16_fireworks) C++17
26 / 100
 15 ms 28764 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
const int  N = 4e5 + 30, MOD = 1e9 + 7;
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);
    }
    st[to].clear();
}
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 28504 KB Output is correct
2 Correct 12 ms 28508 KB Output is correct
3 Correct 12 ms 28580 KB Output is correct
4 Correct 14 ms 28492 KB Output is correct
5 Correct 12 ms 28648 KB Output is correct
6 Correct 13 ms 28644 KB Output is correct
7 Correct 12 ms 28508 KB Output is correct
8 Correct 12 ms 28508 KB Output is correct
9 Correct 12 ms 28552 KB Output is correct
10 Correct 12 ms 28508 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 28504 KB Output is correct
2 Correct 10 ms 28508 KB Output is correct
3 Correct 12 ms 28508 KB Output is correct
4 Correct 12 ms 28652 KB Output is correct
5 Correct 11 ms 28440 KB Output is correct
6 Correct 12 ms 28508 KB Output is correct
7 Correct 15 ms 28504 KB Output is correct
8 Correct 12 ms 28508 KB Output is correct
9 Correct 12 ms 28508 KB Output is correct
10 Correct 12 ms 28524 KB Output is correct
11 Correct 12 ms 28508 KB Output is correct
12 Correct 11 ms 28500 KB Output is correct
13 Correct 11 ms 28504 KB Output is correct
14 Correct 12 ms 28508 KB Output is correct
15 Correct 12 ms 28476 KB Output is correct
16 Correct 11 ms 28508 KB Output is correct
17 Correct 12 ms 28684 KB Output is correct
18 Correct 13 ms 28620 KB Output is correct
19 Correct 13 ms 28504 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 28504 KB Output is correct
2 Correct 12 ms 28508 KB Output is correct
3 Correct 12 ms 28580 KB Output is correct
4 Correct 14 ms 28492 KB Output is correct
5 Correct 12 ms 28648 KB Output is correct
6 Correct 13 ms 28644 KB Output is correct
7 Correct 12 ms 28508 KB Output is correct
8 Correct 12 ms 28508 KB Output is correct
9 Correct 12 ms 28552 KB Output is correct
10 Correct 12 ms 28508 KB Output is correct
11 Correct 12 ms 28504 KB Output is correct
12 Correct 10 ms 28508 KB Output is correct
13 Correct 12 ms 28508 KB Output is correct
14 Correct 12 ms 28652 KB Output is correct
15 Correct 11 ms 28440 KB Output is correct
16 Correct 12 ms 28508 KB Output is correct
17 Correct 15 ms 28504 KB Output is correct
18 Correct 12 ms 28508 KB Output is correct
19 Correct 12 ms 28508 KB Output is correct
20 Correct 12 ms 28524 KB Output is correct
21 Correct 12 ms 28508 KB Output is correct
22 Correct 11 ms 28500 KB Output is correct
23 Correct 11 ms 28504 KB Output is correct
24 Correct 12 ms 28508 KB Output is correct
25 Correct 12 ms 28476 KB Output is correct
26 Correct 11 ms 28508 KB Output is correct
27 Correct 12 ms 28684 KB Output is correct
28 Correct 13 ms 28620 KB Output is correct
29 Correct 13 ms 28504 KB Output is correct
30 Incorrect 14 ms 28764 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 28504 KB Output is correct
2 Correct 12 ms 28508 KB Output is correct
3 Correct 12 ms 28580 KB Output is correct
4 Correct 14 ms 28492 KB Output is correct
5 Correct 12 ms 28648 KB Output is correct
6 Correct 13 ms 28644 KB Output is correct
7 Correct 12 ms 28508 KB Output is correct
8 Correct 12 ms 28508 KB Output is correct
9 Correct 12 ms 28552 KB Output is correct
10 Correct 12 ms 28508 KB Output is correct
11 Correct 12 ms 28504 KB Output is correct
12 Correct 10 ms 28508 KB Output is correct
13 Correct 12 ms 28508 KB Output is correct
14 Correct 12 ms 28652 KB Output is correct
15 Correct 11 ms 28440 KB Output is correct
16 Correct 12 ms 28508 KB Output is correct
17 Correct 15 ms 28504 KB Output is correct
18 Correct 12 ms 28508 KB Output is correct
19 Correct 12 ms 28508 KB Output is correct
20 Correct 12 ms 28524 KB Output is correct
21 Correct 12 ms 28508 KB Output is correct
22 Correct 11 ms 28500 KB Output is correct
23 Correct 11 ms 28504 KB Output is correct
24 Correct 12 ms 28508 KB Output is correct
25 Correct 12 ms 28476 KB Output is correct
26 Correct 11 ms 28508 KB Output is correct
27 Correct 12 ms 28684 KB Output is correct
28 Correct 13 ms 28620 KB Output is correct
29 Correct 13 ms 28504 KB Output is correct
30 Incorrect 14 ms 28764 KB Output isn't correct
31 Halted 0 ms 0 KB -