Cod sursă (job #718651)

#include <bits/stdc++.h>
using ll=long long;
#define S second
#define F first
#define endl '\n'
#define spid ios_base::sync_with_stdio(false);cin.tie(NULL);
const int mod=1e9+7;
const double pi=3.14159265359;
const int maxn=10001;
using namespace std;

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}
	
	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
	
	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};

ll t=1,n,m,k;
ll parent[maxn],rang[maxn];
vector<pair<int,pair<int,int>>> A;

int find(int i){
	int ans;
	if(parent[i]==i){
		return i;
	}
	else ans=find(parent[i]);
	parent[i]=ans;
	return ans;
}

void unite(int a,int b){
	int repa=find(a);
	int repb=find(b);
	if(rang[repa]==rang[repb]){
		parent[repa]=repb;
		rang[repb]++;
	}
	else if(rang[repa]>rang[repb]){
		parent[repb]=repa;
	}
	else{
		parent[repa]=repb;
	}
}

int createMST(){
	int ans=0;
	for(auto it:A){
		int a=it.S.F,b=it.S.S;
		int val=it.F;
		if(find(a)==find(b))continue;
		else{
			unite(a,b);
		}
		ans+=val;
	}
	return ans;
} 

int main(){
	InParser fin("zapada.in");
	//ifstream cin("grader_test5.in");
	ofstream cout("zapada.out");
	fin>>n>>m>>k;
	for(int i=0;i<m;i++){
		int c1,c2,c3;
		fin>>c1>>c2>>c3;
		A.push_back({c3,{c1-1,c2-1}});
	}
	for(int i=0;i<n;i++){
		parent[i]=i;
		rang[i]=1;
	}
	sort(A.begin(),A.end());
	cout<<createMST()<<endl;
	while(k--){
		int c1,c2,c3;
		fin>>c1>>c2>>c3;
		for(int i=0;i<n;i++){
			parent[i]=i;
			rang[i]=1;
		}
		A.push_back({c3,{c1-1,c2-1}});
		sort(A.begin(),A.end());
		cout<<createMST()<<endl;
	}
}