https://xinyoudui.com/ac/contest/74700557200060F040B08F6/problem/10297
#include<bits/stdc++.h>
using namespace std;
int n,m,fa[500010];
long long ans;
struct Node
{
int x,y,l,w;
};
Node a[500010];
bool cmp(Node x,Node y)
{
return x.w<y.w;
}
int f(int x)
{
if(fa[x]!=x)
{
fa[x]=f(fa[x]);
}
return fa[x];
}
int main()
{
//freopen("uoj.in","r",stdin);
//freopen("uoj.out","w",stdout);
cin>>n>>m;
for(int i=1;i<=m;i++)
{
cin>>a[i].x>>a[i].y>>a[i].l>>a[i].w;
}
sort(a+1,a+m+1,cmp);
for(int i=1;i<=n;i++)
{
fa[i]=i;
}
int fx,fy;
for(int i=1,jj=1;jj<=n-1;i++)
{
for(int j=0;j<a[i].l;j++)
{
fx=f(a[i].x+j),fy=f(a[i].y+j);
if(fx!=fy)
{
jj++;
fa[fx]=fy;
ans+=a[i].w;
}
}
}
cout<<ans;
}