# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
106301 | alexpetrescu | Fireworks (APIO16_fireworks) | C++14 | 20 ms | 16896 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 <cstdio>
#include <queue>
#include <algorithm>
#include <vector>
//FILE *fin = fopen("a.in", "r"), *fout = fopen("a.out", "w");
#define fin stdin
#define fout stdout
#define ll long long
#define MAXN 300000
std::vector < int > g[MAXN + 1];
ll d[MAXN + 1];
int c[MAXN + 1];
std::priority_queue < ll > q[MAXN + 1];
void dfs(int x) {
for (auto &y : g[x]) {
dfs(y);
d[x] += d[y];
while (!q[y].empty()) {
q[x].push(q[y].top());
q[y].pop();
}
}
for (int i = g[x].size(); i > bool(c[x]); i--) {
d[x] += q[x].top();
q[x].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... |