oj.uz

Submission #684400

# Submission time Handle Problem Language Result Execution time Memory
684400 2023-01-21T06:03:41 Z PoonYaPat Fireworks (APIO16_fireworks) C++14
26 / 100
 16 ms 26324 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int n,m,l[300001],r[300001],w[300001];
ll Ymin[300001];
vector<int> adj[300001];
priority_queue<int, vector<int>, greater<int>> rsq[300001];
priority_queue<int> lsq[300001];

void dfs(int x) {
    int cnt=0;
    priority_queue<int, vector<int>, greater<int>> temp;

    if (!adj[x].size()) {
        l[x]=w[x]; r[x]=w[x];
        Ymin[x]=0;
        lsq[x].push(l[x]);
        rsq[x].push(r[x]);
        return;
    }

    for (auto s : adj[x]) {
        ++cnt;
        dfs(s);

        Ymin[x]+=Ymin[s];

        if (lsq[x].size()) {
            if (l[s]>r[x]) Ymin[x]+=l[s]-r[x];
            if (r[s]<l[x]) Ymin[x]+=l[x]-r[s];
        }

        if (lsq[s].size()+rsq[s].size()>lsq[x].size()+temp.size()) swap(lsq[x],lsq[s]), swap(temp,rsq[s]);

        if (lsq[x].size()) {
            while (!lsq[s].empty()) {
                if (lsq[s].top()>=temp.top()) temp.push(lsq[s].top());
                else lsq[x].push(lsq[s].top());
                lsq[s].pop();
            }

            while (!rsq[s].empty()) {
                if (rsq[s].top()>=temp.top()) temp.push(rsq[s].top());
                else lsq[x].push(rsq[s].top());
                rsq[s].pop();
            }
        }

        while (temp.size()>cnt) lsq[x].push(temp.top()), temp.pop();
        while (temp.size()<cnt) temp.push(lsq[x].top()), lsq[x].pop();

        l[x]=lsq[x].top();
        r[x]=temp.top();

    }

    l[x]+=w[x];
    r[x]+=w[x];
    lsq[x].pop(); lsq[x].push(l[x]);
    rsq[x].push(r[x]);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>m;
    for (int i=2; i<=n+m; ++i) {
        int u; cin>>u>>w[i];
        adj[u].push_back(i);
    }
    dfs(1);
    cout<<Ymin[1];
}

Compilation message

fireworks.cpp: In function 'void dfs(int)':
fireworks.cpp:50:27: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int, std::vector<int>, std::greater<int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   50 |         while (temp.size()>cnt) lsq[x].push(temp.top()), temp.pop();
      |                ~~~~~~~~~~~^~~~
fireworks.cpp:51:27: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int, std::vector<int>, std::greater<int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |         while (temp.size()<cnt) temp.push(lsq[x].top()), lsq[x].pop();
      |                ~~~~~~~~~~~^~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 26068 KB Output is correct
2 Correct 13 ms 26156 KB Output is correct
3 Correct 15 ms 26168 KB Output is correct
4 Correct 13 ms 26124 KB Output is correct
5 Correct 12 ms 26076 KB Output is correct
6 Correct 14 ms 26068 KB Output is correct
7 Correct 12 ms 26068 KB Output is correct
8 Correct 12 ms 26188 KB Output is correct
9 Correct 14 ms 26156 KB Output is correct
10 Correct 13 ms 26068 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 26068 KB Output is correct
2 Correct 16 ms 26156 KB Output is correct
3 Correct 14 ms 26152 KB Output is correct
4 Correct 12 ms 26196 KB Output is correct
5 Correct 14 ms 26068 KB Output is correct
6 Correct 13 ms 26068 KB Output is correct
7 Correct 12 ms 26112 KB Output is correct
8 Correct 13 ms 26168 KB Output is correct
9 Correct 13 ms 26160 KB Output is correct
10 Correct 14 ms 26324 KB Output is correct
11 Correct 13 ms 26100 KB Output is correct
12 Correct 13 ms 26196 KB Output is correct
13 Correct 13 ms 26196 KB Output is correct
14 Correct 12 ms 26196 KB Output is correct
15 Correct 13 ms 26068 KB Output is correct
16 Correct 15 ms 26160 KB Output is correct
17 Correct 14 ms 26196 KB Output is correct
18 Correct 13 ms 26120 KB Output is correct
19 Correct 13 ms 26136 KB Output is correct

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 26068 KB Output is correct
2 Correct 13 ms 26156 KB Output is correct
3 Correct 15 ms 26168 KB Output is correct
4 Correct 13 ms 26124 KB Output is correct
5 Correct 12 ms 26076 KB Output is correct
6 Correct 14 ms 26068 KB Output is correct
7 Correct 12 ms 26068 KB Output is correct
8 Correct 12 ms 26188 KB Output is correct
9 Correct 14 ms 26156 KB Output is correct
10 Correct 13 ms 26068 KB Output is correct
11 Correct 13 ms 26068 KB Output is correct
12 Correct 16 ms 26156 KB Output is correct
13 Correct 14 ms 26152 KB Output is correct
14 Correct 12 ms 26196 KB Output is correct
15 Correct 14 ms 26068 KB Output is correct
16 Correct 13 ms 26068 KB Output is correct
17 Correct 12 ms 26112 KB Output is correct
18 Correct 13 ms 26168 KB Output is correct
19 Correct 13 ms 26160 KB Output is correct
20 Correct 14 ms 26324 KB Output is correct
21 Correct 13 ms 26100 KB Output is correct
22 Correct 13 ms 26196 KB Output is correct
23 Correct 13 ms 26196 KB Output is correct
24 Correct 12 ms 26196 KB Output is correct
25 Correct 13 ms 26068 KB Output is correct
26 Correct 15 ms 26160 KB Output is correct
27 Correct 14 ms 26196 KB Output is correct
28 Correct 13 ms 26120 KB Output is correct
29 Correct 13 ms 26136 KB Output is correct
30 Incorrect 13 ms 26196 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 26068 KB Output is correct
2 Correct 13 ms 26156 KB Output is correct
3 Correct 15 ms 26168 KB Output is correct
4 Correct 13 ms 26124 KB Output is correct
5 Correct 12 ms 26076 KB Output is correct
6 Correct 14 ms 26068 KB Output is correct
7 Correct 12 ms 26068 KB Output is correct
8 Correct 12 ms 26188 KB Output is correct
9 Correct 14 ms 26156 KB Output is correct
10 Correct 13 ms 26068 KB Output is correct
11 Correct 13 ms 26068 KB Output is correct
12 Correct 16 ms 26156 KB Output is correct
13 Correct 14 ms 26152 KB Output is correct
14 Correct 12 ms 26196 KB Output is correct
15 Correct 14 ms 26068 KB Output is correct
16 Correct 13 ms 26068 KB Output is correct
17 Correct 12 ms 26112 KB Output is correct
18 Correct 13 ms 26168 KB Output is correct
19 Correct 13 ms 26160 KB Output is correct
20 Correct 14 ms 26324 KB Output is correct
21 Correct 13 ms 26100 KB Output is correct
22 Correct 13 ms 26196 KB Output is correct
23 Correct 13 ms 26196 KB Output is correct
24 Correct 12 ms 26196 KB Output is correct
25 Correct 13 ms 26068 KB Output is correct
26 Correct 15 ms 26160 KB Output is correct
27 Correct 14 ms 26196 KB Output is correct
28 Correct 13 ms 26120 KB Output is correct
29 Correct 13 ms 26136 KB Output is correct
30 Incorrect 13 ms 26196 KB Output isn't correct
31 Halted 0 ms 0 KB -