Submission #3968108
Source Code Expand
#include<bits/stdc++.h>
#define ll long long
using namespace std;
struct aaa{
ll x,y,val;
}a[1000001];
ll n,m,fa[1000001],d[1000001],tot,ans;
bool cmp(aaa a,aaa b){
return a.val<b.val;
}
void build(ll t,ll k,ll s){
tot++;
a[tot].x=t;a[tot].y=k;a[tot].val=s;
}
ll find(ll x){
if(x==fa[x])return x;
return fa[x]=find(fa[x]);
}
int main(){
ll i,t,k,s,now,x,y;
memset(d,44,sizeof(d));
scanf("%lld%lld",&n,&m);
for(i=1;i<=m;i++){
scanf("%lld%lld%lld",&t,&k,&s);
build(t,k,s);
d[t]=min(d[t],s+1);d[k]=min(d[k],s+2);
}
for(i=0;i<n;i++)d[i]=min(d[i],d[(i-1+n)%n]+2);
//puts("-1");
for(i=0;i<n;i++)d[i]=min(d[i],d[(i-1+n)%n]+2);
for(i=0;i<n;i++)build(i,(i+1)%n,d[i]);
//puts("-2");
sort(a+1,a+tot+1,cmp);
for(i=1;i<n;i++)fa[i]=i;
now=n-1;
for(i=1;i<=tot&&now;i++){
//prllf("%d\n",i);
x=find(a[i].x);y=find(a[i].y);
if(x!=y){
fa[x]=y;now--;
ans+=a[i].val;
}
}
printf("%lld",ans);
}
Submission Info
Submission Time
2019-01-09 22:00:19+0900
Task
G - Zigzag MST
User
xielinhan
Language
C++ (GCC 5.4.1)
Score
1300
Code Size
957 Byte
Status
AC
Exec Time
146 ms
Memory
23040 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:22:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld",&n,&m);
^
./Main.cpp:24:33: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld%lld",&t,&k,&s);
^
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
4 ms
10496 KB
01-02.txt
AC
76 ms
14592 KB
01-03.txt
AC
123 ms
23040 KB
01-04.txt
AC
51 ms
18944 KB
01-05.txt
AC
35 ms
17664 KB
01-06.txt
AC
43 ms
18176 KB
01-07.txt
AC
37 ms
17024 KB
01-08.txt
AC
36 ms
16768 KB
01-09.txt
AC
41 ms
18688 KB
01-10.txt
AC
81 ms
20736 KB
01-11.txt
AC
103 ms
20736 KB
01-12.txt
AC
124 ms
22784 KB
01-13.txt
AC
126 ms
22784 KB
01-14.txt
AC
125 ms
22784 KB
01-15.txt
AC
127 ms
22784 KB
01-16.txt
AC
124 ms
22784 KB
01-17.txt
AC
125 ms
22784 KB
01-18.txt
AC
100 ms
22784 KB
01-19.txt
AC
36 ms
16896 KB
01-20.txt
AC
41 ms
16768 KB
01-21.txt
AC
68 ms
18688 KB
01-22.txt
AC
121 ms
22784 KB
01-23.txt
AC
108 ms
22784 KB
01-24.txt
AC
35 ms
18688 KB
01-25.txt
AC
146 ms
22784 KB
01-26.txt
AC
49 ms
16640 KB
01-27.txt
AC
45 ms
18688 KB
01-28.txt
AC
93 ms
20736 KB
01-29.txt
AC
106 ms
20736 KB
01-30.txt
AC
130 ms
22784 KB
sample-01.txt
AC
5 ms
10496 KB
sample-02.txt
AC
5 ms
10496 KB
sample-03.txt
AC
5 ms
10496 KB