oj.uz

답안 #864070

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
864070 2023-10-21T21:14:49 Z MilosMilutinovic Sjekira (COCI20_sjekira) C++14
110 / 110
 84 ms 11464 KB 
#include<bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;

template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}

int readint(){
	int x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

int n,a[100005],v[200005],nxt[200005],h[100005],tot,ord[100005],fa[100005],mx[100005];
vector<pii> edg;
set<pii> st;
ll ans=0;

void addedge(int x,int y){
	v[++tot]=y; nxt[tot]=h[x]; h[x]=tot;
	v[++tot]=x; nxt[tot]=h[y]; h[y]=tot;
}

void ins(int x,int y){
	if(x>y) swap(x,y);
	if(st.find(mp(x,y))!=st.end()) return;
	st.insert(mp(x,y));
	edg.pb(mp(x,y));
}

int getf(int x){return fa[x]==x?x:fa[x]=getf(fa[x]);}

void merge(int x,int y){
	x=getf(x); y=getf(y);
	ans+=mx[x];
	ans+=mx[y];
	fa[y]=x;
	mx[x]=max(mx[x],mx[y]);
}

int main(){
	n=readint();
	for(int i=1;i<=n;i++) a[i]=readint();
	for(int i=1;i<n;i++) addedge(readint(),readint());
	for(int i=1;i<=n;i++) ord[i]=i;
	sort(ord+1,ord+n+1,[&](int i,int j){return a[i]>a[j];});
	for(int i=1;i<=n;i++){
		int x=ord[i];
		for(int p=h[x];p;p=nxt[p]) ins(x,v[p]);
	}
	reverse(edg.begin(),edg.end());
	for(int i=1;i<=n;i++) fa[i]=i,mx[i]=a[i];
	for(auto&p:edg) merge(p.fi,p.se);
	printf("%lld\n",ans);
	return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 9652 KB Output is correct
2 Correct 37 ms 7076 KB Output is correct
3 Correct 38 ms 6868 KB Output is correct
4 Correct 42 ms 7736 KB Output is correct
5 Correct 69 ms 11312 KB Output is correct
6 Correct 35 ms 11460 KB Output is correct
7 Correct 30 ms 9928 KB Output is correct
8 Correct 26 ms 8980 KB Output is correct
9 Correct 19 ms 5924 KB Output is correct
10 Correct 39 ms 11464 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 456 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #4
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 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 348 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 53 ms 9652 KB Output is correct
7 Correct 37 ms 7076 KB Output is correct
8 Correct 38 ms 6868 KB Output is correct
9 Correct 42 ms 7736 KB Output is correct
10 Correct 69 ms 11312 KB Output is correct
11 Correct 35 ms 11460 KB Output is correct
12 Correct 30 ms 9928 KB Output is correct
13 Correct 26 ms 8980 KB Output is correct
14 Correct 19 ms 5924 KB Output is correct
15 Correct 39 ms 11464 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 15 ms 2884 KB Output is correct
22 Correct 12 ms 2476 KB Output is correct
23 Correct 84 ms 11316 KB Output is correct
24 Correct 52 ms 7876 KB Output is correct
25 Correct 50 ms 7664 KB Output is correct
26 Correct 32 ms 5356 KB Output is correct
27 Correct 36 ms 6092 KB Output is correct
28 Correct 60 ms 7956 KB Output is correct
29 Correct 34 ms 5580 KB Output is correct
30 Correct 72 ms 11332 KB Output is correct