Submission

[PPPPPPPPPP]

Score: 100

User: njoop

Problemset: รัฐบาล

Language: cpp

Time: 0.028 second

Submitted On: 2025-04-15 09:31:48

#include<bits/stdc++.h>
#define F first
#define S second
#define ll long long
#define pii pair<ll,ll>
#define pipi pair<pii,pii>

using namespace std;

const int N = 100, M = 10000;
int parent[N+5];
ll mst = 0, ans = 1e18;

int findparent(int n){
	if(n == parent[n]) return n;
	return parent[n] = findparent(parent[n]);
}

map<int, int> mp;

int main(){
	ios_base::sync_with_stdio(0); cin.tie(0);
	int n, m;
	cin>>n>>m;
	vector<pipi> vec(m);
	for(int i=0;i<=n;i++) parent[i] = i;
	for(int i=0;i<m;i++){
		int u, v, w;
		cin>>u>>v>>w;
		vec[i] = {{w,i},{u,v}};
	}
	sort(vec.begin(),vec.end());
	int sz = 0;
	for(int i=0;i<m;i++){
		int u = vec[i].S.F, v = vec[i].S.S;
		ll w = vec[i].F.F;
		int idx = vec[i].F.S;
		int U = findparent(u);
		int V = findparent(v);
		if(parent[u] != parent[v]){
			parent[V] = U;
			mst += w;
			mp[idx]++;
		}
	}
	for(int i=0;i<m;i++){
		vector<pipi> temp = vec;
	    if(mp[temp[i].F.S] == 0) continue;
		temp[i].F.F = 1e18;
		sort(temp.begin(),temp.end());
		for(int j=0;j<=n;j++) parent[j] = j;
		sz = n-1;
		ll val = 0;
		for(int j=0;j<m && sz;j++){
			int u = temp[j].S.F, v = temp[j].S.S;
			ll w = temp[j].F.F;
			int idx = temp[i].F.S;
			int U = findparent(u);
			int V = findparent(v);
			if(parent[u] != parent[v]){
				parent[V] = U;
				val += w;
				sz--;
			}
		}
		if(val >= mst) ans = min(ans,val);
	}
	cout<<mst<<' '<<ans;
	
}
/*
5 8
1 3 75
3 4 51
2 4 19
3 2 95
2 5 42
5 4 31
1 2 9
3 5 66
*/