Submission #2177262
Source Code Expand
#include <cstdio>
#include <algorithm>
using namespace std;
struct init{
int x,y,z,to,val,next;
}e[400007];
int n,m;
int d[200007],f[200007];
long long ans;
bool cmp(init x,init y)
{
return x.z<y.z;
}
int find(int k)
{
if(f[k]==k) return k;
return f[k]=find(f[k]);
}
void kruskal()
{
int t=0;
for(int i=1;i<=n;++i) f[i]=i;
for(int i=1;i<=m+n;++i) {
int x=find(e[i].x),y=find(e[i].y);
if(x!=y)
{
f[x]=y;
ans+=1ll*e[i].z;
if((++t)==n-1) break;
}
}
return ;
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;++i) d[i]=1e9;
for(int i=1;i<=m;++i)
{
scanf("%d%d%d",&e[i].x,&e[i].y,&e[i].z);
d[e[i].x]=e[i].z+1;d[e[i].y]=e[i].z+2;
}
d[1]=min(d[1],d[n]+2);
for(int i=2;i<=n;++i) d[i]=min(d[i],d[i-1]+2);
d[1]=min(d[1],d[n]+2);e[m+1].x=n,e[m+1].y=1,e[m+1].z=d[1];
for(int i=2;i<=n;++i) {
d[i]=min(d[i],d[i-1]+2);
e[m+i].x=i-1,e[m+i].y=i,e[m+i].z=d[i];
}
sort(e+1,e+n+m+1,cmp);
kruskal();printf("%lld\n",ans);
return 0;
}
Submission Info
Submission Time
2018-03-10 12:09:35+0900
Task
G - Zigzag MST
User
vjudge4
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
968 Byte
Status
WA
Exec Time
139 ms
Memory
14208 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:41:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
./Main.cpp:45:42: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&e[i].x,&e[i].y,&e[i].z);
^
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
AC
1 ms
128 KB
01-02.txt
WA
73 ms
6784 KB
01-03.txt
WA
115 ms
11648 KB
01-04.txt
AC
41 ms
10624 KB
01-05.txt
AC
27 ms
9472 KB
01-06.txt
AC
34 ms
9856 KB
01-07.txt
AC
28 ms
8704 KB
01-08.txt
WA
27 ms
8448 KB
01-09.txt
WA
31 ms
8320 KB
01-10.txt
WA
69 ms
10368 KB
01-11.txt
WA
96 ms
9600 KB
01-12.txt
WA
113 ms
11008 KB
01-13.txt
WA
111 ms
11136 KB
01-14.txt
WA
111 ms
11136 KB
01-15.txt
WA
113 ms
11136 KB
01-16.txt
WA
111 ms
11136 KB
01-17.txt
WA
111 ms
11136 KB
01-18.txt
WA
84 ms
11136 KB
01-19.txt
AC
28 ms
8704 KB
01-20.txt
WA
29 ms
8320 KB
01-21.txt
WA
49 ms
8320 KB
01-22.txt
WA
97 ms
11136 KB
01-23.txt
WA
98 ms
11136 KB
01-24.txt
WA
26 ms
8320 KB
01-25.txt
WA
139 ms
14208 KB
01-26.txt
WA
41 ms
8320 KB
01-27.txt
WA
35 ms
8320 KB
01-28.txt
WA
76 ms
10368 KB
01-29.txt
WA
92 ms
9728 KB
01-30.txt
WA
107 ms
11136 KB
sample-01.txt
AC
1 ms
128 KB
sample-02.txt
WA
1 ms
128 KB
sample-03.txt
AC
1 ms
128 KB