Submission #6360124
Source Code Expand
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
#define fre(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
using namespace std;
inline int read(){
int sum=0,f=1;char ch=getchar();
while(ch>'9' || ch<'0'){if(ch=='-')f=-1;ch=getchar();}
while(ch>='0' && ch<='9'){sum=sum*10+ch-'0';ch=getchar();}
return f*sum;
}
const int N=200001;
struct edge{int x,y;ll w;}a[N<<1];
int n,m,tot,fa[N];ll f[N],ans;
inline void add(int x,int y,ll z){
a[++tot]=(edge){x,y,z};
}
inline int find(int x){return x==fa[x]? x:fa[x]=find(fa[x]);}
inline bool cmp(edge a,edge b){return a.w<b.w;}
int main(){
n=read();m=read();
for(int i=1;i<=n;i++) fa[i]=i;
memset(f,0x3f,sizeof(f));
while(m--){
int x=read(),y=read();ll z=read();
add(x,y,z);f[x]=min(f[x],z+1);f[y]=min(f[y],z+2);
}
for(int i=1;i<=(n<<1);i++) f[i%n+1]=min(f[i%n+1],f[(i-1)%n+1]+2);
for(int i=1;i<=n;i++) add(i,i%n+1,f[i]);
sort(a+1,a+tot+1,cmp);
for(int i=1;i<=tot;i++){
int aa=find(a[i].x),b=find(a[i].y);
if(aa!=b) ans+=a[i].w,fa[aa]=b;
}
printf("%lld\n",ans);
return 0;
}
Submission Info
Submission Time |
|
Task |
G - Zigzag MST |
User |
vjudge2 |
Language |
Bash (GNU bash v4.3.11) |
Score |
0 |
Code Size |
1105 Byte |
Status |
RE |
Exec Time |
10 ms |
Memory |
752 KB |
Judge Result
Set Name |
sample |
all |
Score / Max Score |
0 / 0 |
0 / 1300 |
Status |
|
|
Set Name |
Test Cases |
sample |
sample-01.txt, sample-02.txt, sample-03.txt |
all |
sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
RE |
10 ms |
752 KB |
01-02.txt |
RE |
2 ms |
504 KB |
01-03.txt |
RE |
2 ms |
504 KB |
01-04.txt |
RE |
2 ms |
504 KB |
01-05.txt |
RE |
2 ms |
504 KB |
01-06.txt |
RE |
2 ms |
504 KB |
01-07.txt |
RE |
2 ms |
504 KB |
01-08.txt |
RE |
2 ms |
504 KB |
01-09.txt |
RE |
2 ms |
504 KB |
01-10.txt |
RE |
2 ms |
504 KB |
01-11.txt |
RE |
2 ms |
504 KB |
01-12.txt |
RE |
2 ms |
504 KB |
01-13.txt |
RE |
2 ms |
504 KB |
01-14.txt |
RE |
2 ms |
504 KB |
01-15.txt |
RE |
2 ms |
504 KB |
01-16.txt |
RE |
2 ms |
504 KB |
01-17.txt |
RE |
2 ms |
504 KB |
01-18.txt |
RE |
2 ms |
504 KB |
01-19.txt |
RE |
2 ms |
504 KB |
01-20.txt |
RE |
2 ms |
504 KB |
01-21.txt |
RE |
2 ms |
504 KB |
01-22.txt |
RE |
2 ms |
504 KB |
01-23.txt |
RE |
2 ms |
504 KB |
01-24.txt |
RE |
2 ms |
504 KB |
01-25.txt |
RE |
2 ms |
504 KB |
01-26.txt |
RE |
2 ms |
504 KB |
01-27.txt |
RE |
2 ms |
504 KB |
01-28.txt |
RE |
2 ms |
504 KB |
01-29.txt |
RE |
2 ms |
504 KB |
01-30.txt |
RE |
2 ms |
504 KB |
sample-01.txt |
RE |
2 ms |
504 KB |
sample-02.txt |
RE |
2 ms |
504 KB |
sample-03.txt |
RE |
2 ms |
504 KB |