# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
47695 | square1001 | Fireworks (APIO16_fireworks) | C++14 | 2069 ms | 268180 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 <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int N, M, p[300009], c[300009], deg[300009]; vector<long long> v[300009];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> N >> M;
long long sum = 0;
for (int i = 1; i < N + M; i++) {
cin >> p[i] >> c[i];
deg[--p[i]]++;
sum += c[i];
}
for (int i = N + M - 1; i >= 0; i--) {
if (i >= N) {
v[i].push_back(c[i]);
v[i].push_back(c[i]);
}
else {
sort(v[i].begin(), v[i].end());
for (int j = 0; j < deg[i] - 1; j++) v[i].pop_back();
v[i][v[i].size() - 1] += c[i];
v[i][v[i].size() - 2] += c[i];
}
if (i != 0) {
v[p[i]].insert(v[p[i]].end(), v[i].begin(), v[i].end());
}
}
for (int i = 0; i < v[0].size(); i++) {
sum -= (v[0][i] - (i == 0 ? 0 : v[0][i - 1])) * (v[0].size() - i - 1);
}
cout << sum << '\n';
return 0;
}
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... |