# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
197039 | mario05092929 | Fireworks (APIO16_fireworks) | C++11 | 284 ms | 47400 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.
#if 1
#include <bits/stdc++.h>
using namespace std;
int n,m,p[300005],c[300005],sz[300005];
long long s[300005],l,r;
priority_queue <long long> *q[300005];
int main()
{
scanf("%d %d", &n, &m);
for(int i = 2;i <= n+m;i++)
{
scanf("%d %d", &p[i], &c[i]);
}
for(int i = n+1;i <= n+m;i++)
{
q[i] = new priority_queue<long long>(2,0);
}
for(int i = n+m;i >= 1;i--)
{
while(sz[i]--) q[i] -> pop();
r = q[i] -> top();
q[i] -> pop();
l = q[i] -> top();
q[i] -> pop();
q[i] -> push(l+c[i]);
q[i] -> push(r+c[i]);
s[p[i]] += s[i]+c[i];
if(!q[p[i]])
{
q[p[i]] = q[i];
continue;
}
if(q[p[i]] -> size() < q[i] -> size()) swap(q[p[i]],q[i]);
while(!q[i] -> empty())
{
q[p[i]] -> push(q[i] -> top());
q[i] -> pop();
}
sz[p[i]]++;
}
q[0] -> pop();
while(!q[0] -> empty())
{
s[0] -= q[0] -> top();
q[0] -> pop();
}
printf("%lld",s[0]);
return 0;
}
#endif // 1
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... |