Submission #994278

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep1(i,n) for(int i=1;i<=(int)(n);i++)
#define all(c) c.begin(),c.end()
#define pb push_back
#define fs first
#define sc second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
using namespace std;
template<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){return o<<"("<<p.fs<<","<<p.sc<<")";}
template<class T> ostream& operator<<(ostream& o,const vector<T> &vc){o<<"sz = "<<vc.size()<<endl<<"[";for(const T& v:vc) o<<v<<",";o<<"]";return o;}
typedef long long ll;
const int MQ=200000;
const int MN=200000;
int N,Q;
int its[MQ],a[MQ],b[MQ];
int nouse[MQ];
bool e[MQ];
typedef pair<ll,int> P;	//cost,id
priority_queue<P,vector<P>,greater<P> > que;

struct unionfind{
	int par[MN];
	void init(int N){rep(i,N) par[i]=i;}
	int find(int x){
		if(par[x]==x) return x;
		return par[x]=find(par[x]);
	}
	bool same(int x,int y){
		return find(x)==find(y);
	}
	void unite(int x,int y){
		x=find(x),y=find(y);
		if(x==y) return;
		par[y]=x;
	}
}UF;

void iter(int id){
	if(!e[id]){
		a[id]++;
		if(a[id]==N) a[id]=0;
	}else{
		b[id]++;
		if(b[id]==N) b[id]=0;
	}
	e[id]^=1;
}
int main(){
	cin>>N>>Q;
	UF.init(N);
	rep(i,Q){
		ll c;
		cin>>a[i]>>b[i]>>c;
		que.push(P(c,i));
	}
	int tm=0;
	ll ans=0;
	while(tm!=N-1){
		P p=que.top();que.pop();
		int id=p.sc;
		ll c=p.fs;
		if(a[id]==b[id]){
//			printf("continue id=%d    %d,%d\n",id,a[id],b[id]);
			iter(id);
			que.push(P(c+1,id));
		}else if(UF.same(a[id],b[id])){
//			printf("no use id=%d    %d,%d\n",id,a[id],b[id]);
			nouse[id]++;
			iter(id);
			if(que.size()<=10||nouse[id]<=10) que.push(P(c+1,id));
			continue;
		}else{
			UF.unite(a[id],b[id]);
			tm++;
//			printf("unite id=%d   %d,%d\n",id,a[id],b[id]);
			ans+=c;
			iter(id);
			que.push(P(c+1,id));
		}
	}
	cout<<ans<<endl;
}

Submission Info

Judge Result