Task: | Laskettelukeskus |
Sender: | Militalex |
Submission time: | 2023-11-06 21:42:27 +0200 |
Language: | C++ (C++20) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.00 s | 1, 2 | details |
#2 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#3 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#4 | WRONG ANSWER | 0.05 s | 2 | details |
#5 | WRONG ANSWER | 0.05 s | 2 | details |
#6 | ACCEPTED | 0.00 s | 1, 2 | details |
#7 | ACCEPTED | 0.05 s | 2 | details |
#8 | ACCEPTED | 0.00 s | 1, 2 | details |
#9 | ACCEPTED | 0.04 s | 2 | details |
#10 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#11 | WRONG ANSWER | 0.04 s | 2 | details |
#12 | ACCEPTED | 0.00 s | 1, 2 | details |
#13 | ACCEPTED | 0.04 s | 2 | details |
Code
#include <bits/stdc++.h>using namespace std;// Shorter typestypedef long long ll;typedef unsigned long long ull;typedef vector<ll> vll;typedef vector<ull> vull;typedef pair<ll,ll> pll;typedef vector<vll> adjList;typedef vector<vector<pll>> adjwList;// Macros#define LOOP(i, start, end) for (auto i = start; i <= end; i++)#define FE_LOOP(i, collection) LOOP(i, 0, collection.size()-1)#define SORT(v) sort(v.begin(), v.end())#define REV_SORT(v) sort(v.rbegin(), v.rend())// Variablesll n;adjList adj;vll needs;void read_input(){cin >> n;needs = vll(n+1);adj = adjList(n+1, vll());LOOP(i, 0, n-2){ll a, b;cin >> a >> b;adj[a].push_back(b);//adj[b].push_back(a);}LOOP(i, 1, n-1){cin >> needs[i];}}// Libs// Solutionvoid solve(){vector<bool> visited(adj.size()+1, false);queue<pll> q;q.emplace(1, needs[0]);ll bestSum = needs[0];while (!q.empty()){ll node = q.front().first;ll has = q.front().second;q.pop();visited[node] = true;ll childNeeds = 0;for (ll child : adj[node]){if (visited[child]) continue;childNeeds += needs[child];q.emplace(child, needs[child]);}if (childNeeds > has){bestSum += childNeeds - has;}}cout << bestSum << "\n";}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);read_input();solve();return 0;}
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: WRONG ANSWER
input |
---|
100 1 73 1 64 64 23 1 88 ... |
correct output |
---|
2675 |
user output |
---|
2833 |
Test 3
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
100 1 36 36 56 56 59 36 97 ... |
correct output |
---|
2808 |
user output |
---|
2929 |
Test 4
Group: 2
Verdict: WRONG ANSWER
input |
---|
100000 1 45452 1 74209 45452 78960 45452 79820 ... |
correct output |
---|
28399367694319 |
user output |
---|
29682534262157 |
Test 5
Group: 2
Verdict: WRONG ANSWER
input |
---|
100000 1 31165 1 23263 31165 89516 31165 53122 ... |
correct output |
---|
28546840313799 |
user output |
---|
29840581472990 |
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: WRONG ANSWER
input |
---|
100 1 2 1 3 2 4 2 5 ... |
correct output |
---|
2809 |
user output |
---|
3025 |
Test 11
Group: 2
Verdict: WRONG ANSWER
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 |