| Task: | Laskettelukeskus |
| Sender: | Aatos |
| Submission time: | 2023-11-04 22:01:08 +0200 |
| Language: | C++ (C++20) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 53 |
| #2 | ACCEPTED | 47 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2 | details |
| #2 | ACCEPTED | 0.00 s | 1, 2 | details |
| #3 | ACCEPTED | 0.00 s | 1, 2 | details |
| #4 | ACCEPTED | 0.15 s | 2 | details |
| #5 | ACCEPTED | 0.15 s | 2 | details |
| #6 | ACCEPTED | 0.00 s | 1, 2 | details |
| #7 | ACCEPTED | 0.12 s | 2 | details |
| #8 | ACCEPTED | 0.00 s | 1, 2 | details |
| #9 | ACCEPTED | 0.14 s | 2 | details |
| #10 | ACCEPTED | 0.00 s | 1, 2 | details |
| #11 | ACCEPTED | 0.13 s | 2 | details |
| #12 | ACCEPTED | 0.00 s | 1, 2 | details |
| #13 | ACCEPTED | 0.14 s | 2 | details |
Code
#include <iostream>
#include <vector>
#include <stdint.h>
#include <cassert>
class Node
{
public:
Node(uint64_t val) : m_val(val) {}
void add_child(Node* child)
{
assert(child);
m_children.push_back(child);
}
uint64_t evaluate()
{
uint64_t child_sum = 0u;
for (Node* child : m_children)
{
child_sum += child->evaluate();
}
return std::max(child_sum, m_val);
}
private:
uint64_t m_val;
std::vector<Node*> m_children;
};
std::vector<Node*> create_nodes(uint32_t amount, const std::vector<uint64_t>& values)
{
std::vector<Node*> output;
for (uint32_t i = 0; i < amount; i++)
{
output.push_back(new Node(values.at(i)));
}
return output;
}
int main()
{
// inputs
uint32_t num_slopes;
std::cin >> num_slopes;
std::vector<std::vector<uint32_t> > connections(num_slopes - 1);
for (uint32_t i = 0; i < num_slopes - 1; i++)
{
for (uint32_t j = 0; j < 2; j++)
{
uint32_t input;
std::cin >> input;
connections.at(i).push_back(input);
}
}
std::vector<uint64_t> times_per_slope(num_slopes);
for (uint32_t i = 0; i < num_slopes; i++)
{
std::cin >> times_per_slope.at(i);
}
// nodes
std::vector<Node*> nodes = create_nodes(num_slopes, times_per_slope);
for (uint32_t i = 0; i < connections.size(); i++)
{
const uint32_t from = connections[i][0];
const uint32_t to = connections[i][1];
nodes[from - 1]->add_child(nodes[to - 1]);
}
//output
std::cout << nodes.at(0)->evaluate() << std::endl;
return 0;
}Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 5 1 2 1 3 3 4 3 5 ... |
| correct output |
|---|
| 6 |
| user output |
|---|
| 6 |
Test 2
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 100 1 73 1 64 64 23 1 88 ... |
| correct output |
|---|
| 2675 |
| user output |
|---|
| 2675 |
Test 3
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 100 1 36 36 56 56 59 36 97 ... |
| correct output |
|---|
| 2808 |
| user output |
|---|
| 2808 |
Test 4
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 1 45452 1 74209 45452 78960 45452 79820 ... |
| correct output |
|---|
| 28399367694319 |
| user output |
|---|
| 28399367694319 |
Test 5
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 1 31165 1 23263 31165 89516 31165 53122 ... |
| correct output |
|---|
| 28546840313799 |
| user output |
|---|
| 28546840313799 |
Test 6
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 100 1 79 79 9 79 45 45 10 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 7
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 1 66038 1 56789 56789 7403 66038 69542 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 8
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 100 1 2 2 3 3 4 4 5 ... |
| correct output |
|---|
| 100 |
| user output |
|---|
| 100 |
Test 9
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 1 2 2 3 3 4 4 5 ... |
| correct output |
|---|
| 1000000000 |
| user output |
|---|
| 1000000000 |
Test 10
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 100 1 2 1 3 2 4 2 5 ... |
| correct output |
|---|
| 2809 |
| user output |
|---|
| 2809 |
Test 11
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 1 2 1 3 2 4 2 5 ... |
| correct output |
|---|
| 26053917212428 |
| user output |
|---|
| 26053917212428 |
Test 12
Group: 1, 2
Verdict: ACCEPTED
| input |
|---|
| 100 1 2 1 3 2 4 2 5 ... |
| correct output |
|---|
| 5000 |
| user output |
|---|
| 5000 |
Test 13
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 100000 1 2 1 3 2 4 2 5 ... |
| correct output |
|---|
| 50000000000000 |
| user output |
|---|
| 50000000000000 |
