# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
873842 | LucaLucaM | Two Currencies (JOI23_currencies) | C++17 | 2503 ms | 276904 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 <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <functional>
#define int long long // merg la comisie
#warning pica asta la jboi 1000%
/**
clar la fiecare query imi caut binar cati gold coins imi pot salva
cand avem query u--v :
fie c nr de checkpoint uri de pe lantul u--v
daca incerc sa iau k gold coins, trebuie sa vad care ar fi suma celor mai mici c - k valori de pe lantul u--v
ok deci am redus problema la
"raspunde la query uri de forma 'u v k' care este suma celor mai mici k valori de pe path-ul u--v"
pai hai sa imi sortez valorile crescator
dupa asta tot imi bag cate o muchie si o sa am ceva de genu
adauga muchia la toate nodurile din subarborele lui u (presupunem ca p[u] = v)
pai bun si acum am chestii de genu "adauga x la toate valorile dintr un range"
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... |