Submission #4419187

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<queue>

#define N 201000
#define ll long long
#define RG register
#define pr pair<ll,int> 
#define mkp make_pair
#define fi first
#define sc second

using namespace std;

inline int read(){
    RG int x=0,t=1;RG char ch=getchar();
    while((ch<'0'||ch>'9')&&ch!='-')ch=getchar();
    if(ch=='-')t=-1,ch=getchar();
    while(ch<='9'&&ch>='0')x=x*10+ch-48,ch=getchar();
    return x*t;
}

int n,Q,top,rem[N],fa[N];
struct mona { int x,y,w; } s[N<<3];
inline bool cmp(mona x,mona y) { return x.w<y.w; }
inline int Find(int x) { if(fa[x]!=x) fa[x]=Find(fa[x]); return fa[x]; }

int main(){
	n=read(),Q=read();
	for(RG int i=1;i<=n;++i) rem[i]=2e9,fa[i]=i;
	while(Q--){
		int A=read()+1,B=read()+1,C=read();
		s[++top]=(mona) { A,B,C };
		rem[A]=min(rem[A],C+1),rem[B]=min(rem[B],C+2);
	}
	for(RG int i=1;i<=n;++i) { int j=i==1?n:i-1; rem[i]=min(rem[j]+2,rem[i]); }
	for(RG int i=1;i<=n;++i) { int j=i==1?n:i-1; rem[i]=min(rem[j]+2,rem[i]); }
	for(RG int i=1;i<=n;++i) { int j=i==n?1:i+1; s[++top]=(mona) { i,j,rem[i] }; }
	sort(s+1,s+1+top,cmp); ll ans=0;
	for(RG int i=1;i<=top;++i){
		int fx=Find(s[i].x),fy=Find(s[i].y);
		if(fx!=fy) fa[fx]=fy,ans+=s[i].w;
	}   printf("%lld\n",ans);
}

Submission Info

Judge Result