oj.uz

Submission #836966

# Submission time Handle Problem Language Result Execution time Memory
836966 2023-08-24T18:31:39 Z urieg Fireworks (APIO16_fireworks) C++17
26 / 100
 17 ms 30476 KB 
#include<bits/stdc++.h>
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define ve vector
typedef long long ll;
using namespace std;

const int N = 350000;
priority_queue<ll> ql[N];
priority_queue<ll, vector<ll>, greater<ll>> qr[N];
unsigned long long ans=0;
vector<pair<int, ll>> g[N];

void add(ll val, int& i, int x){
    if(ql[i].top()<val && val < qr[i].top()){
        if(x<0){
            ql[i].push(val);
        }
        else{
            qr[i].push(val);
        }
    }
    else if(ql[i].top()>=val){
        if(x>0){
            ans += ql[i].top()-val;
            qr[i].push(ql[i].top());
            ql[i].pop();
        }
        ql[i].push(val);
    }
    else if(qr[i].top()<=val){
        if(x<0){
            ans += val-qr[i].top();
            ql[i].push(qr[i].top());
            qr[i].pop();
        }
        qr[i].push(val);
    }
}

void unite(int v, int u){
    bool sw = 0;
    if(ql[u].size()+qr[u].size() > ql[v].size()+qr[v].size()){swap(v, u); sw=1;}

    while(!ql[u].empty()){
        add(ql[u].top(), v, -1);
        ql[u].pop();
    }
    while(!qr[u].empty()){
        add(qr[u].top(), v, 1);
        qr[u].pop();
    }
    if(sw){
        ql[v].swap(ql[u]);
        qr[v].swap(qr[u]);
    }
}

void dfs(int v){
    for(int i = 0;i<g[v].size();i++){
        int son = g[v][i].first;
        ll w = g[v][i].second;
        dfs(son);
        if(!g[son].size()){
            ql[son].push(w);
            qr[son].push(w);
        }
        else{
            int l = ql[son].top(), r = qr[son].top();
            ql[son].pop();
            ql[son].push(l+w);
            while(!qr[son].empty())qr[son].pop();
            qr[son].push(r+w);
        }
        unite(v, son);
    }
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    int n, m;
    cin>>n>>m;
    for(int i = 1; i<n+m;i++){
        int an;ll c;
        cin>>an>>c;an--;
        g[an].push_back({i, c});
    }
    dfs(0);
    cout<<ans<<'\n';


    return 0;
}

Compilation message

fireworks.cpp: In function 'void dfs(int)':
fireworks.cpp:61:20: 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]
   61 |     for(int i = 0;i<g[v].size();i++){
      |                   ~^~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 30420 KB Output is correct
2 Correct 13 ms 30420 KB Output is correct
3 Correct 13 ms 30448 KB Output is correct
4 Correct 13 ms 30420 KB Output is correct
5 Correct 14 ms 30464 KB Output is correct
6 Correct 13 ms 30468 KB Output is correct
7 Correct 14 ms 30420 KB Output is correct
8 Correct 14 ms 30384 KB Output is correct
9 Correct 13 ms 30472 KB Output is correct
10 Correct 13 ms 30412 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 30420 KB Output is correct
2 Correct 13 ms 30420 KB Output is correct
3 Correct 13 ms 30412 KB Output is correct
4 Correct 12 ms 30420 KB Output is correct
5 Correct 13 ms 30420 KB Output is correct
6 Correct 14 ms 30396 KB Output is correct
7 Correct 14 ms 30432 KB Output is correct
8 Correct 14 ms 30420 KB Output is correct
9 Correct 13 ms 30420 KB Output is correct
10 Correct 13 ms 30424 KB Output is correct
11 Correct 14 ms 30448 KB Output is correct
12 Correct 13 ms 30420 KB Output is correct
13 Correct 13 ms 30476 KB Output is correct
14 Correct 14 ms 30420 KB Output is correct
15 Correct 17 ms 30420 KB Output is correct
16 Correct 13 ms 30420 KB Output is correct
17 Correct 13 ms 30440 KB Output is correct
18 Correct 13 ms 30420 KB Output is correct
19 Correct 13 ms 30420 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 30420 KB Output is correct
2 Correct 13 ms 30420 KB Output is correct
3 Correct 13 ms 30448 KB Output is correct
4 Correct 13 ms 30420 KB Output is correct
5 Correct 14 ms 30464 KB Output is correct
6 Correct 13 ms 30468 KB Output is correct
7 Correct 14 ms 30420 KB Output is correct
8 Correct 14 ms 30384 KB Output is correct
9 Correct 13 ms 30472 KB Output is correct
10 Correct 13 ms 30412 KB Output is correct
11 Correct 14 ms 30420 KB Output is correct
12 Correct 13 ms 30420 KB Output is correct
13 Correct 13 ms 30412 KB Output is correct
14 Correct 12 ms 30420 KB Output is correct
15 Correct 13 ms 30420 KB Output is correct
16 Correct 14 ms 30396 KB Output is correct
17 Correct 14 ms 30432 KB Output is correct
18 Correct 14 ms 30420 KB Output is correct
19 Correct 13 ms 30420 KB Output is correct
20 Correct 13 ms 30424 KB Output is correct
21 Correct 14 ms 30448 KB Output is correct
22 Correct 13 ms 30420 KB Output is correct
23 Correct 13 ms 30476 KB Output is correct
24 Correct 14 ms 30420 KB Output is correct
25 Correct 17 ms 30420 KB Output is correct
26 Correct 13 ms 30420 KB Output is correct
27 Correct 13 ms 30440 KB Output is correct
28 Correct 13 ms 30420 KB Output is correct
29 Correct 13 ms 30420 KB Output is correct
30 Incorrect 13 ms 30448 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 30420 KB Output is correct
2 Correct 13 ms 30420 KB Output is correct
3 Correct 13 ms 30448 KB Output is correct
4 Correct 13 ms 30420 KB Output is correct
5 Correct 14 ms 30464 KB Output is correct
6 Correct 13 ms 30468 KB Output is correct
7 Correct 14 ms 30420 KB Output is correct
8 Correct 14 ms 30384 KB Output is correct
9 Correct 13 ms 30472 KB Output is correct
10 Correct 13 ms 30412 KB Output is correct
11 Correct 14 ms 30420 KB Output is correct
12 Correct 13 ms 30420 KB Output is correct
13 Correct 13 ms 30412 KB Output is correct
14 Correct 12 ms 30420 KB Output is correct
15 Correct 13 ms 30420 KB Output is correct
16 Correct 14 ms 30396 KB Output is correct
17 Correct 14 ms 30432 KB Output is correct
18 Correct 14 ms 30420 KB Output is correct
19 Correct 13 ms 30420 KB Output is correct
20 Correct 13 ms 30424 KB Output is correct
21 Correct 14 ms 30448 KB Output is correct
22 Correct 13 ms 30420 KB Output is correct
23 Correct 13 ms 30476 KB Output is correct
24 Correct 14 ms 30420 KB Output is correct
25 Correct 17 ms 30420 KB Output is correct
26 Correct 13 ms 30420 KB Output is correct
27 Correct 13 ms 30440 KB Output is correct
28 Correct 13 ms 30420 KB Output is correct
29 Correct 13 ms 30420 KB Output is correct
30 Incorrect 13 ms 30448 KB Output isn't correct
31 Halted 0 ms 0 KB -