# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671075 | AdamGS | Fireworks (APIO16_fireworks) | C++17 | 220 ms | 63880 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=3e5+7;
vector<pair<int,ll>>V[LIM];
ll n, m, ans;
void DFS2(int x, ll k, priority_queue<ll>&q) {
ans+=k;
if(x>=n) {
q.push(0);
q.push(k);
q.push(k);
return;
}
DFS2(V[x][0].st, V[x][0].nd, q);
for(int i=1; i<V[x].size(); ++i) {
priority_queue<ll>p;
DFS2(V[x][i].st, V[x][i].nd, p);
if(p.size()>q.size()) swap(p, q);
while(!p.empty()) {
q.push(p.top());
p.pop();
}
}
rep(i, V[x].size()-1) q.pop();
ll a=q.top(); q.pop();
ll b=q.top(); q.pop();
q.push(a+k); q.push(b+k);
}
int main() {
ios_base::sync_with_stdio(0); cin.tie(0);
cin >> n >> m;
rep(i, n+m-1) {
ll a, b;
cin >> a >> b; --a;
V[a].pb({i+1, b});
}
priority_queue<ll>Q;
DFS2(0, 0, Q);
Q.pop();
vector<ll>P;
while(!Q.empty()) {
P.pb(Q.top());
Q.pop();
}
for(ll i=P.size()-1; i; --i) ans-=i*(P[i-1]-P[i]);
cout << ans << '\n';
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |