oj.uz

Submission #702507

# Submission time Handle Problem Language Result Execution time Memory
702507 2023-02-24T08:22:18 Z Chal1shkan Sjekira (COCI20_sjekira) C++14
110 / 110
 69 ms 9544 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 (q[v] >= q[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 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 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 7868 KB Output is correct
2 Correct 40 ms 6744 KB Output is correct
3 Correct 33 ms 6740 KB Output is correct
4 Correct 35 ms 7024 KB Output is correct
5 Correct 55 ms 8864 KB Output is correct
6 Correct 44 ms 9544 KB Output is correct
7 Correct 43 ms 8524 KB Output is correct
8 Correct 35 ms 8140 KB Output is correct
9 Correct 21 ms 6580 KB Output is correct
10 Correct 54 ms 9328 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 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 2 ms 3412 KB Output is correct
7 Correct 3 ms 3412 KB Output is correct
8 Correct 2 ms 3508 KB Output is correct
9 Correct 3 ms 3412 KB Output is correct
10 Correct 2 ms 3412 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 3412 KB Output is correct
3 Correct 2 ms 3412 KB Output is correct
4 Correct 2 ms 3412 KB Output is correct
5 Correct 2 ms 3412 KB Output is correct
6 Correct 45 ms 7868 KB Output is correct
7 Correct 40 ms 6744 KB Output is correct
8 Correct 33 ms 6740 KB Output is correct
9 Correct 35 ms 7024 KB Output is correct
10 Correct 55 ms 8864 KB Output is correct
11 Correct 44 ms 9544 KB Output is correct
12 Correct 43 ms 8524 KB Output is correct
13 Correct 35 ms 8140 KB Output is correct
14 Correct 21 ms 6580 KB Output is correct
15 Correct 54 ms 9328 KB Output is correct
16 Correct 2 ms 3412 KB Output is correct
17 Correct 3 ms 3412 KB Output is correct
18 Correct 2 ms 3508 KB Output is correct
19 Correct 3 ms 3412 KB Output is correct
20 Correct 2 ms 3412 KB Output is correct
21 Correct 13 ms 4796 KB Output is correct
22 Correct 12 ms 4656 KB Output is correct
23 Correct 69 ms 9192 KB Output is correct
24 Correct 38 ms 7508 KB Output is correct
25 Correct 39 ms 7572 KB Output is correct
26 Correct 25 ms 6104 KB Output is correct
27 Correct 29 ms 6584 KB Output is correct
28 Correct 50 ms 7768 KB Output is correct
29 Correct 26 ms 6356 KB Output is correct
30 Correct 67 ms 9524 KB Output is correct