Task: | Laskettelukeskus |
Sender: | Mariia |
Submission time: | 2023-11-03 18:44:57 +0200 |
Language: | C++ (C++11) |
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.14 s | 2 | details |
#5 | ACCEPTED | 0.14 s | 2 | details |
#6 | ACCEPTED | 0.00 s | 1, 2 | details |
#7 | ACCEPTED | 0.11 s | 2 | details |
#8 | ACCEPTED | 0.00 s | 1, 2 | details |
#9 | ACCEPTED | 0.13 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.13 s | 2 | details |
Code
#include <iostream>#include <vector>#include <algorithm>#include <queue>using namespace std;typedef long long ll;ll n, m, k;vector<vector<ll>> g;vector<ll> dist;vector<ll> p;vector<ll> sz;vector<ll> ma;bool cmp(ll a, ll b) {return dist[b] < dist[a];}ll get(ll x) {if (p[x] == x) {return x;} else {return p[x] = get(p[x]);}}void unite(ll a, ll b) {a = get(a);b = get(b);if (a == b) {return;}/*if (sz[a] > sz[b]) {ll tmp = a;a = b;b = tmp;} */p[a] = b;}int main() {ll n; cin >> n;vector<ll> vert(n);p.resize(n);sz.resize(n);for (ll i = 0; i < n; i++) {vert[i] = i;p[i] = i; sz[i] = 1;}g.resize(n);for (ll i = 0; i < n - 1; i++) {ll u, v; cin >> u >> v;g[u - 1].push_back(v - 1);}queue<ll> q;dist.resize(n);q.push(0); dist[0] = 0;while (q.size() > 0) {ll v = q.front();q.pop();for (ll u : g[v]) {dist[u] = dist[v] + 1;q.push(u);}}ma.resize(n);for (ll i = 0; i < n; i++) {cin >> ma[i];}sort(vert.begin(), vert.end(), cmp);//cout << vert.size() << ' ';for (ll v : vert) {ll sum = 0;for (ll u : g[v]) {unite(v, u);sum += ma[u];}ma[v] = max(ma[v], sum);//cout << v << ' ' << ma[v] << '\n';}cout << ma[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: 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 |