CSES - Datatähti 2024 alku - Results
Submission details
Task:Laskettelukeskus
Sender:Luc
Submission time:2023-10-30 20:41:55 +0200
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#20.00 s1, 2details
#30.00 s1, 2details
#40.07 s2details
#50.07 s2details
#6ACCEPTED0.00 s1, 2details
#7ACCEPTED0.06 s2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.05 s2details
#100.00 s1, 2details
#110.05 s2details
#12ACCEPTED0.00 s1, 2details
#13ACCEPTED0.05 s2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:6:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 |         scanf("%lld", &n);
      |         ~~~~~^~~~~~~~~~~~
input/code.cpp:11:22: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |                 scanf("%d %d", &a, &b);
      |                 ~~~~~^~~~~~~~~~~~~~~~~
input/code.cpp:15:25: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         while(i<n) scanf("%lld", &c[i++]);
      |                    ~~~~~^~~~~~~~~~~~~~~~~

Code

#include <bits/stdc++.h>
int main(){
long long n, o=0;
int a, b;
scanf("%lld", &n);
std::vector<int> r[n];
long long c[n], i=n-1;
std::vector<bool> v(n, false);
while(i--){
scanf("%d %d", &a, &b);
r[a-1].push_back(b-1);
r[b-1].push_back(a-1);
}i=0;
while(i<n) scanf("%lld", &c[i++]);
//printf("Not input overflow\n");
std::queue<int> q;
v[0]=true;
q.push(0);
o+=c[0];
while(!q.empty()){
a = q.front(); q.pop();
for(auto u : r[a]){
if(v[u]) continue;
v[u] = true;
if(c[a]-c[u]<0){
o+=c[u]-c[a];
c[a]=0;
}else c[a]-=c[u];
q.push(u);
}
}
printf("%lld\n", o);
}

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:

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

correct output
2675

user output
2815

Test 3

Group: 1, 2

Verdict:

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

correct output
2808

user output
2972

Test 4

Group: 2

Verdict:

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

correct output
28399367694319

user output
29682355434961

Test 5

Group: 2

Verdict:

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

correct output
28546840313799

user output
29841483935252

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:

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

correct output
2809

user output
3025

Test 11

Group: 2

Verdict:

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

correct output
26053917212428

user output
27093410820391

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