제출 #854286

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
854286		errorgorn	Security Guard (JOI23_guard)	C++17	50 / 100	130 ms	19100 KiB

guard

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << ": " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(int x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n,m,k;
int arr[200005];
vector<ii> edges;
int p[200005];

int par(int i){
	if (p[i]==i) return i;
	else return p[i]=par(p[i]);
}

signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n>>m>>k;
	rep(x,1,n+1) cin>>arr[x];
	
	int ans=*max_element(arr+1,arr+n+1)-accumulate(arr+1,arr+n+1,0LL);
	
	rep(x,0,m){
		int a,b; cin>>a>>b;
		edges.pub({a,b});
	}
	
	sort(all(edges),[](ii i,ii j){
		return arr[i.fi]+arr[i.se]<arr[j.fi]+arr[j.se];
	});
	
	rep(x,1,n+1) p[x]=x;
	for (auto [a,b]:edges){
		int val=arr[a]+arr[b];
		a=par(a),b=par(b);
		if (a==b) continue;
		ans+=val;
		p[a]=b;
	}
	
	cout<<ans<<endl;

}

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 12 / 12
• Subtask 4: 13 / 13
• Subtask 5: 0 / 8
• Subtask 6: 0 / 18
• Subtask 7: 0 / 24