CSES - Datatähti 2024 alku - Results
Submission details
Task:Laskettelukeskus
Sender:rottis
Submission time:2023-10-31 22:13:04 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#10.01 s1, 2details
#20.01 s1, 2details
#30.01 s1, 2details
#4--2details
#50.86 s2details
#6ACCEPTED0.01 s1, 2details
#7--2details
#80.01 s1, 2details
#90.08 s2details
#100.01 s1, 2details
#110.61 s2details
#120.01 s1, 2details
#130.61 s2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:38:16: warning: unused variable 'i' [-Wunused-variable]
   38 |   unsigned int i = 0;
      |                ^

Code

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

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 (unsigned short int c : children) {
    t += calculate(c);
  }
  if (t > requireds[cur_node - 1]) {
    return t;
  } else {
    return requireds[cur_node - 1];
  }
}

int main() {
  int count;
  std::cin >> count;

  int temp1;
  int temp2;

  for (int i = 0; i < (count - 1); i++) {
    std::cin >> temp1 >> temp2;
    nodes[temp1].push_back(temp2);
  }

  std::string input;
  std::getline(std::cin, input);
  std::istringstream ss(input);
  unsigned int i = 0;

  for (int i = 0; i < count; i++) {
    ss >> 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 details

Test 1

Group: 1, 2

Verdict:

input
5
1 2
1 3
3 4
3 5
...

correct output
6

user output
0

Test 2

Group: 1, 2

Verdict:

input
100
1 73
1 64
64 23
1 88
...

correct output
2675

user output
0

Test 3

Group: 1, 2

Verdict:

input
100
1 36
36 56
56 59
36 97
...

correct output
2808

user output
0

Test 4

Group: 2

Verdict:

input
100000
1 45452
1 74209
45452 78960
45452 79820
...

correct output
28399367694319

user output
(empty)

Test 5

Group: 2

Verdict:

input
100000
1 31165
1 23263
31165 89516
31165 53122
...

correct output
28546840313799

user output
(empty)

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:

input
100000
1 66038
1 56789
56789 7403
66038 69542
...

correct output
0

user output
(empty)

Test 8

Group: 1, 2

Verdict:

input
100
1 2
2 3
3 4
4 5
...

correct output
100

user output
0

Test 9

Group: 2

Verdict:

input
100000
1 2
2 3
3 4
4 5
...

correct output
1000000000

user output
21845

Test 10

Group: 1, 2

Verdict:

input
100
1 2
1 3
2 4
2 5
...

correct output
2809

user output
0

Test 11

Group: 2

Verdict:

input
100000
1 2
1 3
2 4
2 5
...

correct output
26053917212428

user output
(empty)

Test 12

Group: 1, 2

Verdict:

input
100
1 2
1 3
2 4
2 5
...

correct output
5000

user output
0

Test 13

Group: 2

Verdict:

input
100000
1 2
1 3
2 4
2 5
...

correct output
50000000000000

user output
(empty)