제출 #1153870

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1153870		thelegendary08	Sjekira (COCI20_sjekira)	C++17	110 / 110	60 ms	20788 KiB

sjekira

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 1e5 + 5;
//pii tree[mxn * 4];
int n;
int v[mxn];
set<int> adj[mxn];
/*
void update(int k, int x){
	k += n;
	tree[k] = {x, k-n};
	for(k/=2; k>=1; k/=2){
		tree[k] = max(tree[k*2], tree[k*2+1]);
	}
}
pii quer(int l, int r){
	if(l > r)return {0,0};
	l += n; r += n;
	pii ret = {-1, 0};
	while(l <= r){
		if(l % 2 == 1)ret = max(ret, tree[l++]);
		if(r % 2 == 0)ret = max(ret, tree[r--]);
		l/=2; r/=2;
	}
	return ret;
}
*/
vpii cuts;
void solve(int x){
	vi cur;
	for(auto u : adj[x]){
		cur.pb(u);
	}
	for(auto u : cur){
		cuts.pb(mp(x,u));
		adj[x].erase(adj[x].find(u));
		adj[u].erase(adj[u].find(x));
	}
}
int sz[mxn];
int par[mxn];
int mx[mxn];
int find(int x){
	while(par[x] != x)x = par[x];
	return x;
}
int ans = 0;
void unite(int a, int b){
	a = find(a);
	b = find(b);
	ans += mx[a] + mx[b];
	if(sz[a] < sz[b])swap(a,b);
	par[b] = a;
	sz[a] += sz[b];
	mx[a] = max(mx[a], mx[b]);
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	cin>>n;
	f0r(i,n)cin>>v[i];
	/*
	f0r(i,n){
		update(i, v[i]);
	}
	*/
	f0r(i,n-1){
		in2(a,b);
		a--; b--;
		adj[a].insert(b);
		adj[b].insert(a);
	}
	//f0r(i,n)cout<<nxt[i]<<' ';
	//cout<<'\n';
	vpii w;
	f0r(i,n){
		w.pb(mp(v[i], i));
	}
	sort(rall(w));
	f0r(i,n){
		solve(w[i].second);
	}
	reverse(all(cuts));
	f0r(i,n){
		par[i] = i;
		sz[i] = 1;
		mx[i] = v[i];
	}
	f0r(i,n-1){
		unite(cuts[i].first, cuts[i].second);
	}
	out(ans);
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 30 / 30
• Subtask 4: 60 / 60