oj.uz

Submission #702505

# Submission time Handle Problem Language Result Execution time Memory
702505 2023-02-24T08:21:34 Z Chal1shkan Sjekira (COCI20_sjekira) C++14
110 / 110
 63 ms 11604 KB 
# include <bits/stdc++.h>

# define pb push_back
# define ff first
# define ss second
# define nl "\n"
# define sz(x) ((int)(x).size())
# define deb(x) cerr << #x  << " = " << x << endl; 

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const ll maxn = 1e5 + 25;
const ll inf = 1e18 + 0;
const ll mod = 998244353;
const ll dx[] = {-1, 1, 0, 0};
const ll dy[] = {0, 0, -1, 1};

using namespace std;

ll n, a[maxn];
vector <ll> g[maxn];
ll ord[maxn];
ll q[maxn];

bool cmp (ll x, ll y)
{
	return (a[x] < a[y]);
}

struct DSU
{
	ll par[maxn];
	DSU ()
	{
		iota(par, par + maxn, 0);	
	}	
	ll find_set (ll v)
	{
		if (v == par[v]) return v;
		return par[v] = find_set(par[v]);
	}
	void unite (ll u, ll v)
	{
		u = find_set(u);
		v = find_set(v);
		if (u != v)
		{
			par[v] = u;
			a[u] = max(a[u], a[v]);
		}
	}
} dsu;

void ma1n (/* SABR */)
{
	cin >> n;
	for (ll i = 1; i <= n; ++i)
	{
		cin >> a[i];
		q[i] = a[i];
		ord[i] = i;
	}
	for (ll i = 1; i < n; ++i)
	{
		ll u, v;
		cin >> u >> v;
		g[u].pb(v);
		g[v].pb(u);
	}
	sort(ord + 1, ord + 1 + n, cmp);
	ll ans = 0;
	for (ll i = 1; i <= n; ++i)
	{
		ll v = ord[i];
		for (ll to : g[v])
		{
			if (a[v] >= a[to])
			{
				v = dsu.find_set(v);
				to = dsu.find_set(to);
				if (v != to)
				{
					ans += a[v] + a[to];
					dsu.unite(v, to);
				}
			}
		}
	}
	cout << ans;
}       

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
//    freopen("angry.in", "r", stdin);
//    freopen("angry.out", "w", stdout);
    int ttt = 1;
//  cin >> ttt;
    for (int test = 1; test <= ttt; ++test)
    {
//      cout << "Case " << test << ":" << ' ';
        ma1n();
    }
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 8092 KB Output is correct
2 Correct 32 ms 7040 KB Output is correct
3 Correct 31 ms 6976 KB Output is correct
4 Correct 33 ms 7332 KB Output is correct
5 Correct 56 ms 9068 KB Output is correct
6 Correct 43 ms 9764 KB Output is correct
7 Correct 35 ms 10260 KB Output is correct
8 Correct 33 ms 9816 KB Output is correct
9 Correct 21 ms 7568 KB Output is correct
10 Correct 41 ms 11428 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3468 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3468 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 4 ms 3540 KB Output is correct
7 Correct 3 ms 3480 KB Output is correct
8 Correct 2 ms 3412 KB Output is correct
9 Correct 3 ms 3540 KB Output is correct
10 Correct 3 ms 3540 KB Output is correct

Subtask #4
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 3412 KB Output is correct
2 Correct 2 ms 3468 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3468 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 45 ms 8092 KB Output is correct
7 Correct 32 ms 7040 KB Output is correct
8 Correct 31 ms 6976 KB Output is correct
9 Correct 33 ms 7332 KB Output is correct
10 Correct 56 ms 9068 KB Output is correct
11 Correct 43 ms 9764 KB Output is correct
12 Correct 35 ms 10260 KB Output is correct
13 Correct 33 ms 9816 KB Output is correct
14 Correct 21 ms 7568 KB Output is correct
15 Correct 41 ms 11428 KB Output is correct
16 Correct 4 ms 3540 KB Output is correct
17 Correct 3 ms 3480 KB Output is correct
18 Correct 2 ms 3412 KB Output is correct
19 Correct 3 ms 3540 KB Output is correct
20 Correct 3 ms 3540 KB Output is correct
21 Correct 13 ms 5248 KB Output is correct
22 Correct 11 ms 4988 KB Output is correct
23 Correct 63 ms 11160 KB Output is correct
24 Correct 43 ms 8984 KB Output is correct
25 Correct 38 ms 8928 KB Output is correct
26 Correct 26 ms 7056 KB Output is correct
27 Correct 34 ms 7804 KB Output is correct
28 Correct 42 ms 8956 KB Output is correct
29 Correct 26 ms 7164 KB Output is correct
30 Correct 60 ms 11604 KB Output is correct