# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
714933 | Spade1 | Fireworks (APIO16_fireworks) | C++14 | 228 ms | 75620 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>
//#include <grader.h>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define ll long long
#define ld long double
#define st first
#define nd second
#define pb push_back
#define INF INT_MAX
using namespace std;
const int N = 3e5 + 10;
vector<int> adj[N];
priority_queue<ll> q[N];
ll c[N];
void dfs(int i) {
if (adj[i].empty()) {
q[i].push(c[i]);
q[i].push(c[i]);
return;
}
for (auto j : adj[i]) {
dfs(j);
if (q[i].size() < q[j].size()) swap(q[i], q[j]);
while (!q[j].empty()) q[i].push(q[j].top()), q[j].pop();
}
for (int k = 1; k < adj[i].size(); ++k) q[i].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... |