Laskettelukeskus

input/code.cpp:59:1: warning: "/*" within comment [-Wcomment]
   59 | /*
      |  
input/code.cpp: In function 'int main()':
input/code.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |   scanf("%d\n", &count);
      |   ~~~~~^~~~~~~~~~~~~~~~
input/code.cpp:35:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     scanf("%hu %hu\n", &temp1, &temp2);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   48 |     scanf("%u", &requireds[i]);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~

#include <string>
#include <array>
#include <iostream>
#include <sstream>
#include <vector>
#include <ios>
#include <cstdio>

std::array<unsigned int, 100000> requireds;
std::array<std::vector<unsigned short int>, 100000> nodes;

int calculate(int cur_node) {
  std::vector<unsigned short int> children = nodes[cur_node];
  unsigned int t = 0;
  for (int c : children) {
    t += calculate(c);
  }
  if (t > requireds[cur_node - 1]) {
    return t;
  } else {
    return requireds[cur_node - 1];
  }
}

int main() {
  std::ios_base::sync_with_stdio(false);
  int count;
  //std::cin >> count;
  scanf("%d\n", &count);

  short unsigned int temp1;
  short unsigned int temp2;

  for (int i = 0; i < (count - 1); i++) {
    scanf("%hu %hu\n", &temp1, &temp2);
    //std::cin >> temp1 >> temp2;
    nodes[temp1].push_back(temp2);
  }


  //std::string input;
  //std::getline(std::cin, input);
  //std::getline(std::cin, input);
  //std::cin.ignore();
  //std::istringstream ss(input);

  for (int i = 0; i < count; i++) {
    scanf("%u", &requireds[i]);
    //std::cin >> requireds[i];
  }
  /*
  std::cout << "[";
  for (auto chara : input) {
      std::cout << chara;
  }
  
  std::cout << "]";

/*   
  for (int i = 0; i < count; i++) {
    std::cin >> requireds[i];
  }
*/
  std::cout << calculate(1);
}
/*
$nodes = Hash.new { Array.new }

while rows.length > 0
  a, b = rows.shift
  $nodes[a] |= [b]
end

def calculate(current)
  children = $nodes[current]
  #puts "#{current}, #{children}"
  if !children.empty?
    t = 0
    children.each { |c| t += calculate(c) }
    if t >= $requireds[current - 1]
      return t
    end
  end
  return $requireds[current - 1] # shift
end

count = gets.chomp.to_i
 
rows = []
(count - 1).times do
  rows << gets.chomp.split(" ").map(&:to_i)
end

$requireds = gets.chomp.split(" ").map(&:to_i)


# hash stores parent
# parent through child until child has no child, then take thing and return with alg
puts calculate(1)
*/

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 2

Verdict: RUNTIME ERROR

Test 5

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: RUNTIME ERROR

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: RUNTIME ERROR

Test 12

Group: 1, 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: RUNTIME ERROR