CSES - Datatähti 2024 alku - Results
Submission details
Task:Laskettelukeskus
Sender:Luc
Submission time:2023-10-30 22:29:55 +0200
Language:C++11
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED53
#2ACCEPTED47
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#2ACCEPTED0.00 s1, 2details
#3ACCEPTED0.00 s1, 2details
#4ACCEPTED0.07 s2details
#5ACCEPTED0.07 s2details
#6ACCEPTED0.00 s1, 2details
#7ACCEPTED0.06 s2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.06 s2details
#10ACCEPTED0.00 s1, 2details
#11ACCEPTED0.05 s2details
#12ACCEPTED0.00 s1, 2details
#13ACCEPTED0.05 s2details

Compiler report

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

Code

// depth first
#include <bits/stdc++.h>

typedef long long ll;

using namespace std;

vector<int> *rr;
ll *cc;

ll dfs(int s, int e){
	ll o = 0;
	for(auto u : rr[s]) if(u != e) o+=dfs(u, s);
	return max(cc[s], o);	
}

int main(){
	int a, b, n;
	scanf("%d", &n);
	vector<int> r[n];
	ll 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++]);
	cc = &c[0];
	rr = &r[0];

	printf("%lld\n", dfs(0, 0));
	//printf("Not input overflow\n");
	
}

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