Submission #374490

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
374490	2021-03-07T10:33:16 Z	VEGAnn	Sjekira (COCI20_sjekira)	C++14	110 / 110	50 ms	3940 KB

sjekira

#include <bits/stdc++.h>
#define MP make_pair
#define PB push_back
#define all(x) x.begin(),x.end()
#define i3 array<int,3>
#define pi3 pair<pair<int, int>, int>
#define ft first
#define sd second
using namespace std;
typedef long double ld;
typedef long long ll;
const ld E = 1e-9;
const int N = 100100;
vector<pi3> edgs;
int n, pre[N];
ll t[N], mx[N], ans = 0;

int get(int x) { return (pre[x] == x ? x : pre[x] = get(pre[x])); }

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> n;

    for (int i = 0; i < n; i++) {
        cin >> t[i];
        pre[i] = i;
        mx[i] = t[i];
    }

    for (int i = 1; i < n; i++){
        int x, y; cin >> x >> y; x--; y--;

//        edgs.PB({t[x] + t[y], x, y});
//        edgs.PB(MP(MP(t[x] + t[y], x), y));
        edgs.PB(MP(MP(max(t[x], t[y]), x), y));
    }

    sort(all(edgs));

    for (pi3 cr : edgs){
//        int x = cr[1], y = cr[2];
        int x = cr.ft.sd, y = cr.sd;

        x = get(x);
        y = get(y);

        ans += mx[x];
        ans += mx[y];

        mx[x] = max(mx[x], mx[y]);
        pre[y] = x;
    }

    cout << ans;

    return 0;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	36 ms	3556 KB	Output is correct
2	Correct	26 ms	2408 KB	Output is correct
3	Correct	25 ms	2408 KB	Output is correct
4	Correct	28 ms	3300 KB	Output is correct
5	Correct	43 ms	3940 KB	Output is correct
6	Correct	50 ms	3940 KB	Output is correct
7	Correct	35 ms	3684 KB	Output is correct
8	Correct	32 ms	3556 KB	Output is correct
9	Correct	21 ms	2280 KB	Output is correct
10	Correct	38 ms	3940 KB	Output is correct

Subtask #3

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	364 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct

Subtask #4

60.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	0 ms	364 KB	Output is correct
4	Correct	0 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	36 ms	3556 KB	Output is correct
7	Correct	26 ms	2408 KB	Output is correct
8	Correct	25 ms	2408 KB	Output is correct
9	Correct	28 ms	3300 KB	Output is correct
10	Correct	43 ms	3940 KB	Output is correct
11	Correct	50 ms	3940 KB	Output is correct
12	Correct	35 ms	3684 KB	Output is correct
13	Correct	32 ms	3556 KB	Output is correct
14	Correct	21 ms	2280 KB	Output is correct
15	Correct	38 ms	3940 KB	Output is correct
16	Correct	1 ms	364 KB	Output is correct
17	Correct	1 ms	364 KB	Output is correct
18	Correct	1 ms	364 KB	Output is correct
19	Correct	1 ms	364 KB	Output is correct
20	Correct	1 ms	364 KB	Output is correct
21	Correct	10 ms	1324 KB	Output is correct
22	Correct	9 ms	1196 KB	Output is correct
23	Correct	42 ms	3940 KB	Output is correct
24	Correct	31 ms	3300 KB	Output is correct
25	Correct	31 ms	3300 KB	Output is correct
26	Correct	20 ms	2152 KB	Output is correct
27	Correct	23 ms	2280 KB	Output is correct
28	Correct	34 ms	3428 KB	Output is correct
29	Correct	22 ms	2280 KB	Output is correct
30	Correct	44 ms	3940 KB	Output is correct