oj.uz

Submission #625392

# Submission time Handle Problem Language Result Execution time Memory
625392 2022-08-10T10:32:12 Z socpite Fireworks (APIO16_fireworks) C++14
7 / 100
 5 ms 7356 KB 
#include<bits/stdc++.h>
using namespace std;

#define f first
#define s second

typedef long long ll;

const int maxn = 3e5+5;
const ll inf = 1e18;

ll ans = 0;

int n, m;
int w[maxn];
vector<int> tree[maxn];

pair<ll, int> dfs(int x){
    if(x > n)return {w[x], w[x]};
    vector<pair<ll, int>> op;
    for(auto v: tree[x]){
        auto tmp = dfs(v);
        op.push_back({tmp.f, 0});
        op.push_back({tmp.s, 1});
    }
    sort(op.begin(), op.end());
    ll mid = op[op.size()/2].f;
    for(auto v: op){
        if(v.s)ans += max(0LL, mid - v.f);
        else ans += max(0LL, v.f-mid);
    }
    return {op[op.size()/2-1].f+w[x], op[op.size()/2].f+w[x]};
}

int main(){
    cin >> n >> m;
    for(int i = 2; i <= n+m; i++){
        int x;
        cin >> x >> w[i];
        tree[x].push_back(i);
    }
    dfs(1);
    cout << ans;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 5 ms 7252 KB Output is correct
5 Correct 5 ms 7268 KB Output is correct
6 Correct 4 ms 7252 KB Output is correct
7 Correct 4 ms 7356 KB Output is correct
8 Correct 4 ms 7356 KB Output is correct
9 Correct 5 ms 7252 KB Output is correct
10 Correct 4 ms 7252 KB Output is correct

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7252 KB Output is correct
2 Correct 4 ms 7252 KB Output is correct
3 Incorrect 4 ms 7356 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 5 ms 7252 KB Output is correct
5 Correct 5 ms 7268 KB Output is correct
6 Correct 4 ms 7252 KB Output is correct
7 Correct 4 ms 7356 KB Output is correct
8 Correct 4 ms 7356 KB Output is correct
9 Correct 5 ms 7252 KB Output is correct
10 Correct 4 ms 7252 KB Output is correct
11 Correct 3 ms 7252 KB Output is correct
12 Correct 4 ms 7252 KB Output is correct
13 Incorrect 4 ms 7356 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 5 ms 7252 KB Output is correct
5 Correct 5 ms 7268 KB Output is correct
6 Correct 4 ms 7252 KB Output is correct
7 Correct 4 ms 7356 KB Output is correct
8 Correct 4 ms 7356 KB Output is correct
9 Correct 5 ms 7252 KB Output is correct
10 Correct 4 ms 7252 KB Output is correct
11 Correct 3 ms 7252 KB Output is correct
12 Correct 4 ms 7252 KB Output is correct
13 Incorrect 4 ms 7356 KB Output isn't correct
14 Halted 0 ms 0 KB -