oj.uz

Submission #872197

# Submission time Handle Problem Language Result Execution time Memory
872197 2023-11-12T13:32:42 Z Onur_Ilgaz Sjekira (COCI20_sjekira) C++17
110 / 110
 41 ms 11356 KB 
#include <bits/stdc++.h>
#define fast cin.tie(0)->sync_with_stdio(0);
#define int long long
#define inf ((int)1e18)
#define N 100000
using namespace std;
int par[N], mx[N];
vector <vector<int> > adj;
vector <pair<int, int> > arr;
vector <int> val;
int ans = 0;

int parent(int x) {
	if(par[x] == x) return x;
	par[x] = parent(par[x]);
	mx[x] = max(mx[x], mx[par[x]]);
	return par[x];
}

void merge(int x, int y) {
	x = parent(x);
	y = parent(y);
	par[y] = x;
	ans += mx[y] + mx[x];
	mx[x] = max(mx[x], mx[y]);
}

int32_t main(){
	fast
	int n;
	cin >> n;
	arr.resize(n);
	adj.resize(n);
	val.resize(n);
	for(int i = 0; i < n; i++) {
		cin >> val[i];
		arr[i].first = val[i];
		arr[i].second = i;
	}
	sort(arr.begin(), arr.end());
	for(int i = 0; i < n - 1; i++) {
		int a, b;
		cin >> a >> b;
		a--, b--;
		if(val[a] > val[b] or (val[a] == val[b] and a > b)) {
			// önce a çıkartılacak
			adj[a].push_back(b);
		}
		else {
			adj[b].push_back(a);
		}
	}
	// pre-calc for dsu
	for(int i = 0; i < n; i++) par[i] = i, mx[i] = val[i];
	// now do the merging
	for(int i = 0; i < n; i++) {
		int node = arr[i].second;
		for(auto it:adj[node]) {
			merge(node, it);
			// cout << node << " " << it << " " << ans << "\n";
		}
	}
	cout << ans << "\n";
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 6992 KB Output is correct
2 Correct 22 ms 5464 KB Output is correct
3 Correct 21 ms 5288 KB Output is correct
4 Correct 24 ms 5972 KB Output is correct
5 Correct 36 ms 8584 KB Output is correct
6 Correct 27 ms 11356 KB Output is correct
7 Correct 24 ms 9380 KB Output is correct
8 Correct 28 ms 8956 KB Output is correct
9 Correct 14 ms 5976 KB Output is correct
10 Correct 27 ms 10900 KB Output is correct

Subtask #3
30.0 / 30.0

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

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 424 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 29 ms 6992 KB Output is correct
7 Correct 22 ms 5464 KB Output is correct
8 Correct 21 ms 5288 KB Output is correct
9 Correct 24 ms 5972 KB Output is correct
10 Correct 36 ms 8584 KB Output is correct
11 Correct 27 ms 11356 KB Output is correct
12 Correct 24 ms 9380 KB Output is correct
13 Correct 28 ms 8956 KB Output is correct
14 Correct 14 ms 5976 KB Output is correct
15 Correct 27 ms 10900 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 9 ms 2396 KB Output is correct
22 Correct 7 ms 1884 KB Output is correct
23 Correct 41 ms 8228 KB Output is correct
24 Correct 28 ms 5976 KB Output is correct
25 Correct 33 ms 5928 KB Output is correct
26 Correct 19 ms 4184 KB Output is correct
27 Correct 20 ms 4700 KB Output is correct
28 Correct 29 ms 6588 KB Output is correct
29 Correct 19 ms 4444 KB Output is correct
30 Correct 40 ms 8596 KB Output is correct