oj.uz

Submission #445905

# Submission time Handle Problem Language Result Execution time Memory
445905 2021-07-20T06:27:51 Z Jasiekstrz Sjekira (COCI20_sjekira) C++17
40 / 110
 1000 ms 15284 KB 
#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int N=1e5;
int tab[N+10];
vector<pair<int,int>> e[N+10];
bool vis[N+10];
priority_queue<pair<int,int>> pq;
int dfs(int x,int p)
{
	int ans=tab[x];
	for(auto [v,id]:e[x])
	{
		if(v==p || vis[id])
			continue;
		ans=max(ans,dfs(v,x));
	}
	return ans;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>tab[i];
		pq.push({tab[i],i});
	}
	for(int i=1;i<n;i++)
	{
		int a,b;
		cin>>a>>b;
		e[a].emplace_back(b,i);
		e[b].emplace_back(a,i);
	}
	long long ans=0;
	while(!pq.empty())
	{
		int x=pq.top().se;
		pq.pop();
		for(auto [v,id]:e[x])
		{
			if(vis[id])
				continue;
			vis[id]=true;
			ans+=tab[x]+dfs(v,x);
		}
	}
	cout<<ans<<"\n";
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 11636 KB Output is correct
2 Correct 52 ms 9208 KB Output is correct
3 Correct 51 ms 8572 KB Output is correct
4 Correct 58 ms 10740 KB Output is correct
5 Correct 99 ms 12576 KB Output is correct
6 Execution timed out 1097 ms 15284 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2672 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 3 ms 2636 KB Output is correct
7 Correct 3 ms 2636 KB Output is correct
8 Correct 3 ms 2636 KB Output is correct
9 Correct 4 ms 2636 KB Output is correct
10 Correct 4 ms 2636 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2672 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 71 ms 11636 KB Output is correct
7 Correct 52 ms 9208 KB Output is correct
8 Correct 51 ms 8572 KB Output is correct
9 Correct 58 ms 10740 KB Output is correct
10 Correct 99 ms 12576 KB Output is correct
11 Execution timed out 1097 ms 15284 KB Time limit exceeded
12 Halted 0 ms 0 KB -