# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
111402 | diamond_duke | Fireworks (APIO16_fireworks) | C++11 | 4 ms | 940 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 <algorithm>
#include <cstdio>
#include <vector>
using ll = long long;
struct segment
{
ll x, y, k;
segment(ll a, ll b, ll c) : x(a), y(b), k(c) {}
};
int fa[10005], faw[10005], idx[10005];
std::vector<int> son[10005];
std::vector<segment> dp[10005];
std::pair<int, int> seq[10005];
int main()
{
// freopen("uoj-205.in", "r", stdin);
int n, m;
scanf("%d%d", &n, &m);
n += m;
for (int i = 1; i < n; i++)
{
scanf("%d%d", fa + i, faw + i);
son[--fa[i]].push_back(i);
}
for (int u = n - 1; u >= 0; u--)
{
if (son[u].empty())
{
dp[u] = {{0, faw[u], -1}, {faw[u], 0, 1}};
continue;
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... |