Submission #712326

#	Time	Username	Problem	Language	Result	Execution time	Memory
712326		study	timeismoney (balkan11_timeismoney)	C++17	40 / 100	6 ms	724 KiB

timeismoney

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

const int N = 201;

int comp[N],siz[N];
int sum=0;
vector<pair<int,int>> ans;

int getComp(int node){
	if (comp[node] != node) comp[node] = getComp(comp[node]);
	return comp[node];
}

bool merge(int a, int b){
	a = getComp(a);
	b = getComp(b);
	if (a != b){
		if (siz[a] < siz[b]) swap(a,b);
		//cout << a << ' ' << b << ' ' << cost << endl;
		siz[a] += siz[b];
		comp[b] = a;
		return true;
	}
	return false;
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int n,m;
	cin >> n >> m;
	vector<tuple<int,int,int>> v;
	for (int i=0; i<m; ++i){
		int x,y,t,c;
		cin >> x >> y >> t >> c;
		v.emplace_back(t,x,y);
	}
	for (int i=0; i<n; ++i){
		siz[i] = 1;
		comp[i] = i;
	}
	sort(v.begin(),v.end());
	for (auto [t,x,y]:v){
		if (merge(x,y)){
			sum += t;
			ans.emplace_back(x,y);
		}
	}
	cout << sum << ' ' << sum << '\n';
	for (auto i:ans) cout << i.first << ' ' << i.second << '\n';
	return 0;
}

• Subtask 1: 40 / 100