Submission #554438

#	Time	Username	Problem	Language	Result	Execution time	Memory
554438		amunduzbaev	Reconstruction Project (JOI22_reconstruction)	C++17	7 / 100	5066 ms	5336 KiB

reconstruction

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

#define int long long
#define ar array

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, m; cin>>n>>m;
	vector<int> a(m), b(m), w(m), p(m);
	for(int i=0;i<m;i++){
		p[i] = i;
		cin>>a[i]>>b[i]>>w[i];
		a[i]--, b[i]--;
	}
	
	int q; cin>>q;
	while(q--){
		int x; cin>>x;
		sort(p.begin(), p.end(), [&](int i, int j){
			return abs(w[i] - x) < abs(w[j] - x);
		});
		
		vector<int> par(n), sz(n, 1);
		iota(par.begin(), par.end(), 0);
		function<int(int)> f = [&](int x){
			return (par[x] == x ? x : par[x] = f(par[x]));
		};
		auto merge = [&](int a, int b){
			a = f(a), b = f(b);
			if(a == b) return false;
			if(sz[a] < sz[b]) swap(a, b);
			sz[a] += sz[b], par[b] = a;
			return true;
		};
		
		int res = 0;
		for(auto i : p){
			if(merge(a[i], b[i])){
				res += abs(w[i] - x);
			}
		}
		
		cout<<res<<"\n";
	}
}

• Subtask 1: 3 / 3
• Subtask 2: 4 / 4
• Subtask 3: 0 / 7
• Subtask 4: 0 / 28
• Subtask 5: 0 / 35
• Subtask 6: 0 / 23