| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1370317 | eyadooz | Sjekira (COCI20_sjekira) | C++20 | 1095 ms | 8408 KiB |
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()
#define endl '\n'
#define int long long
int a[200005], ans=0, cnt=0;
bool del[200005];
vector<int> adj[200005];
void dfs(int x, int p=-1) {
cnt=max(cnt, a[x]);
for(auto i : adj[x]) {
if(!del[i]&&i!=p) dfs(i, x);
}
}
main()
{
cin.tie(0) -> sync_with_stdio(0);
int n;
cin >> n;
for(int i = 1;i <= n;i++) cin >> a[i];
for(int i = 0;i < n-1;i++) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
adj[v].pb(u);
}
for(int i = 0;i < n;i++) {
int mx=0;
for(int u=1;u <= n;u++) {
if(!del[u]) mx=max(mx, a[u]);
}
for(int u=1;u <= n;u++) {
if(!del[u]&&a[u]==mx) {
del[u]=1;
for(auto v : adj[u]) if(!del[v]) cnt=0, dfs(v, u), ans+=cnt+mx;
break;
}
}
}
cout << ans;
}
Compilation message (stderr)
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
