Submission #2509203
Source Code Expand
#include<stdio.h>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=2000000000;
struct edge{
int x,y,v;
edge(int a=0,int b=0,int c=0){x=a;y=b;v=c;}
}e[400010];
bool operator<(edge a,edge b){return a.v<b.v;}
int m[200010],fa[200010];
int get(int x){return fa[x]==x?x:(fa[x]=get(fa[x]));}
int main(){
int n,q,M,i,a,b,c;
ll ans;
scanf("%d%d",&n,&q);
for(i=0;i<n;i++)m[i]=inf;
while(q--){
scanf("%d%d%d",&a,&b,&c);
M++;
e[M]=edge(a,b,c);
m[a]=min(m[a],c+1);
m[b]=min(m[b],c+2);
}
for(i=0;i<n;i++)m[(i+1)%n]=min(m[(i+1)%n],m[i]+2);
for(i=0;i<n;i++)m[(i+1)%n]=min(m[(i+1)%n],m[i]+2);
for(i=0;i<n;i++){
M++;
e[M]=edge(i,(i+1)%n,m[i]);
}
for(i=0;i<n;i++)fa[i]=i;
sort(e+1,e+M+1);
ans=0;
for(i=1;i<=M;i++){
a=get(e[i].x);
b=get(e[i].y);
if(a!=b){
fa[a]=b;
ans+=e[i].v;
}
}
printf("%lld",ans);
}
Submission Info
Submission Time
2018-05-13 19:29:33+0900
Task
G - Zigzag MST
User
jefflyy
Language
C++ (GCC 5.4.1)
Score
1300
Code Size
900 Byte
Status
AC
Exec Time
94 ms
Memory
9472 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:16:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&q);
^
./Main.cpp:19:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&a,&b,&c);
^
Judge Result
Set Name
sample
all
Score / Max Score
0 / 0
1300 / 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
AC
2 ms
4864 KB
01-02.txt
AC
61 ms
4864 KB
01-03.txt
AC
91 ms
6656 KB
01-04.txt
AC
20 ms
8704 KB
01-05.txt
AC
13 ms
7424 KB
01-06.txt
AC
17 ms
7936 KB
01-07.txt
AC
15 ms
6784 KB
01-08.txt
AC
16 ms
6528 KB
01-09.txt
AC
21 ms
6400 KB
01-10.txt
AC
55 ms
6400 KB
01-11.txt
AC
81 ms
5632 KB
01-12.txt
AC
93 ms
6400 KB
01-13.txt
AC
91 ms
6400 KB
01-14.txt
AC
92 ms
6400 KB
01-15.txt
AC
94 ms
6400 KB
01-16.txt
AC
92 ms
6400 KB
01-17.txt
AC
90 ms
6400 KB
01-18.txt
AC
68 ms
9472 KB
01-19.txt
AC
15 ms
6784 KB
01-20.txt
AC
19 ms
6400 KB
01-21.txt
AC
39 ms
6400 KB
01-22.txt
AC
79 ms
6400 KB
01-23.txt
AC
78 ms
6400 KB
01-24.txt
AC
16 ms
9472 KB
01-25.txt
AC
88 ms
9472 KB
01-26.txt
AC
20 ms
9088 KB
01-27.txt
AC
23 ms
7936 KB
01-28.txt
AC
59 ms
7936 KB
01-29.txt
AC
74 ms
6656 KB
01-30.txt
AC
87 ms
7936 KB
sample-01.txt
AC
2 ms
4864 KB
sample-02.txt
AC
2 ms
4864 KB
sample-03.txt
AC
2 ms
4864 KB