CSES - Datatähti 2024 alku - Results
Submission details
Task:Laskettelukeskus
Sender:rottis
Submission time:2023-11-01 10:56:18 +0200
Language:C++ (C++20)
Status:READY
Result:53
Feedback
groupverdictscore
#1ACCEPTED53
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#2ACCEPTED0.00 s1, 2details
#3ACCEPTED0.00 s1, 2details
#40.09 s2details
#50.09 s2details
#6ACCEPTED0.00 s1, 2details
#7ACCEPTED0.08 s2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.07 s2details
#10ACCEPTED0.00 s1, 2details
#110.06 s2details
#12ACCEPTED0.00 s1, 2details
#130.06 s2details

Compiler report

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

Code

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

std::array<uint32_t, 100000> requireds;
std::unordered_map<uint32_t, std::vector<uint32_t>> nodes;
// nodes => hash? reduce mem usage

uint32_t calculate(uint32_t cur_node) {
  std::vector<uint32_t> children = nodes[cur_node];
  uint64_t t = 0;
  for (uint32_t 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);
  uint32_t count;
  scanf("%d\n", &count);

  uint32_t temp1;
  uint32_t temp2;

  for (uint32_t i = 0; i < (count - 1); i++) {
    scanf("%u %u\n", &temp1, &temp2);
    nodes[temp1].push_back(temp2);
  }

  for (uint32_t i = 0; i < count; i++) {
    scanf("%u", &requireds[i]);
  }

  std::cout << calculate(1);
}

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:

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

correct output
28399367694319

user output
304640491

Test 5

Group: 2

Verdict:

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

correct output
28546840313799

user output
4082632441

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:

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

correct output
26053917212428

user output
4225356518

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:

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

correct output
50000000000000

user output
2285707264