# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
97564 | oolimry | Fireworks (APIO16_fireworks) | C++14 | 416 ms | 68768 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 pair<int, long long> ii;
vector<ii> adj[300005];
long long val[300005];
long long pw[300005];
priority_queue<long long> pq[300005];
void dfs(int u){
if(adj[u].size() == 0){
pq[u].push(pw[u]);
pq[u].push(pw[u]);
val[u] = 0;
return;
}
long long highest = 0;
for(long long i = 0;i < adj[u].size();i++){
int v = adj[u][i].first;
long long w = adj[u][i].second;
dfs(v);
if(pq[u].empty())
highest += val[v];
else if(pq[u].top() > pq[v].top())
highest += val[v] + abs(pq[v].top() - pq[u].top());
else
highest += val[v] + (i) * abs(pq[v].top() - pq[u].top());
if(pq[v].size() > pq[u].size()) swap(pq[v],pq[u]);
while(!pq[v].empty()){
pq[u].push(pq[v].top());
pq[v].pop();
}
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... |