oj.uz

Submission #931349

# Submission time Handle Problem Language Result Execution time Memory
931349 2024-02-21T15:55:51 Z Whisper Sjekira (COCI20_sjekira) C++17
110 / 110
 34 ms 9860 KB 
#include "bits/stdc++.h"
#pragma GCC optimize("Ofast")

using namespace std; 
using ll = long long;
using str = string;

#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for ( int i = b ; i >= a ; i-- )
#define all(x) x.begin() , x.end()
#define ii pair<ll , int>
#define fi first
#define se second
#define debug(x) cerr << x << " ";

constexpr ll LINF = ( 1e18 + 5 );
constexpr int INF = ( 1e9 + 5 );
constexpr ll MAX = 1e6 + 5;
constexpr int MOD = 1e9;

void setupIO( const string& PROB ){
	cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
//	freopen( (PROB + ".inp").c_str(), "r", stdin);
//	freopen( (PROB + ".out").c_str(), "w", stdout);
}
bool vst[MAX];
ll cost[MAX];
struct DSU{
	ll n, ans;
	vector<ll> par, sz, mx;
	DSU( int n ): par(n + 1) , sz(n + 1), mx(n + 1){
		this->n = n; ans = 0;
	}
	void make_set(){
		for ( int i = 1 ; i <= n ; i++ ) par[i] = i, sz[i] = 1, mx[i] = cost[i];
	}
	ll Find( int u ){
		if ( u == par[u] ) return u;
		return par[u] = Find(par[u]);
	}
	bool Union( int a, int b ){
		a = Find(a);
		b = Find(b);
		if ( a == b ) return false;
		if ( sz[a] < sz[b] ) swap( a, b );
		ans += mx[a] + mx[b];
		mx[a] = max( mx[a] , mx[b] );
		sz[a] += sz[b];
		par[b] = a;
		sz[b] = 0;
		return true;
	}
};

struct Node{
	ll u, v, w;
	bool operator < ( const Node& Other ) const{
		return w < Other.w;
	}
};

void Whisper(){
	int n; cin >> n;
	vector<Node> Edge;
	for ( int i = 1 ; i <= n ; i++ ) cin >> cost[i];
	for ( int i = 1 ; i < n ; i++ ){
		Node e;
		cin >> e.v >> e.u;
		e.w = max( cost[e.v], cost[e.u] );
		Edge.push_back(e);
	}
	sort( Edge.begin() , Edge.end() );
	DSU dsu(n);
	dsu.make_set();
	for ( auto&[u, v, w] : Edge ){
		//cout << u << " " << v << " " << w << '\n';
		dsu.Union(u , v);
	}
	cout << dsu.ans;
}	

signed main(){
	setupIO("__Whisper");
    ll Test = 1; //cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        //
        cout << '\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 344 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 27 ms 9156 KB Output is correct
2 Correct 20 ms 6864 KB Output is correct
3 Correct 19 ms 6588 KB Output is correct
4 Correct 21 ms 7780 KB Output is correct
5 Correct 31 ms 9408 KB Output is correct
6 Correct 34 ms 9432 KB Output is correct
7 Correct 29 ms 9420 KB Output is correct
8 Correct 27 ms 8644 KB Output is correct
9 Correct 18 ms 6088 KB Output is correct
10 Correct 33 ms 9412 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 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 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 27 ms 9156 KB Output is correct
7 Correct 20 ms 6864 KB Output is correct
8 Correct 19 ms 6588 KB Output is correct
9 Correct 21 ms 7780 KB Output is correct
10 Correct 31 ms 9408 KB Output is correct
11 Correct 34 ms 9432 KB Output is correct
12 Correct 29 ms 9420 KB Output is correct
13 Correct 27 ms 8644 KB Output is correct
14 Correct 18 ms 6088 KB Output is correct
15 Correct 33 ms 9412 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 8 ms 4052 KB Output is correct
22 Correct 6 ms 1880 KB Output is correct
23 Correct 30 ms 9860 KB Output is correct
24 Correct 22 ms 7888 KB Output is correct
25 Correct 21 ms 8116 KB Output is correct
26 Correct 14 ms 5584 KB Output is correct
27 Correct 17 ms 6096 KB Output is correct
28 Correct 21 ms 7876 KB Output is correct
29 Correct 14 ms 5780 KB Output is correct
30 Correct 31 ms 9420 KB Output is correct