Task: | Laskettelukeskus |
Sender: | Niilo |
Submission time: | 2023-10-30 17:33:21 +0200 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 53 |
#2 | ACCEPTED | 47 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 2 | details |
#2 | ACCEPTED | 0.00 s | 1, 2 | details |
#3 | ACCEPTED | 0.00 s | 1, 2 | details |
#4 | ACCEPTED | 0.13 s | 2 | details |
#5 | ACCEPTED | 0.13 s | 2 | details |
#6 | ACCEPTED | 0.00 s | 1, 2 | details |
#7 | ACCEPTED | 0.10 s | 2 | details |
#8 | ACCEPTED | 0.00 s | 1, 2 | details |
#9 | ACCEPTED | 0.12 s | 2 | details |
#10 | ACCEPTED | 0.00 s | 1, 2 | details |
#11 | ACCEPTED | 0.12 s | 2 | details |
#12 | ACCEPTED | 0.00 s | 1, 2 | details |
#13 | ACCEPTED | 0.12 s | 2 | details |
Code
#include<bits/stdc++.h>using namespace std;typedef long long ll;int n;ll c[100001];ll c2[100001];int par[100001]; // tree (parent)pair<int,int> ar[100000]; // tree (depth, index)ll ans;int main() {cin >> n;for (int i=0; i < n-1; i++) {int a, b;cin >> a >> b;if (par[b-1]) {while (true);}par[b-1] = a;}for (int i=0; i < n; i++) {cin >> c[i];ar[i].second = i;}// depth treear[0].first = -1;stack<int> st;for (int i=1; i < n; i++) {if (ar[i].first == 0) {st.push(ar[i].second);while (!st.empty()) {int ind = st.top();int pind = par[ind]-1;int d = ar[pind].first;if (d == 0) {st.push(pind);} else {ar[ind].first = d - 1;st.pop();}}}}sort(ar, ar + n);// algorithmfor (int i=0; i < n; i++) {int ind = ar[i].second;int pind = par[ind]-1;ll dif = c[ind] - c2[ind];if (dif > 0) {ans += dif;c2[ind] += dif;}c2[pind] += c2[ind];}cout << ans;}
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 |