Submission #4421653


Source Code Expand

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
const int N=4e5+10;
struct Ed{int fr,to,w;}E[N];
int f[N],n,Q,fa[N],cc;
long long Ans;
int cmp(const Ed&A,const Ed&B) {return A.w<B.w;}
int find(int x) {return fa[x]==x?x:fa[x]=find(fa[x]);}
void Work()
{
	for(int i=0;i<=n-2;i++)
		f[i+1]=min(f[i+1],f[i]+2);
	f[0]=min(f[0],f[n-1]+2);
}
int main()
{
	cin>>n>>Q;
	memset(f,63,sizeof(f));
	for(int i=1;i<=Q;i++)
	{
		int x,y,w;scanf("%d%d%d",&x,&y,&w);
		E[i]=(Ed){x,y,w};
		f[x]=min(f[x],w+1);
		f[y]=min(f[y],w+2);
	}
	cc=Q;Work();Work();
	for(int i=0;i<=n-2;i++)
		E[++cc]=(Ed){i,i+1,f[i]};
	E[++cc]=(Ed){n-1,0,f[n-1]};
	sort(E+1,E+cc+1,cmp);
	for(int i=1;i<=n;i++) fa[i]=i;
	for(int i=1;i<=cc;i++)
	{
		int fx=find(E[i].fr),fy=find(E[i].to);
		if(fx!=fy) Ans+=E[i].w,fa[fx]=fy;
	}
	cout<<Ans<<endl;
}

Submission Info

Submission Time
Task G - Zigzag MST
User luogu_bot3
Language C++14 (GCC 5.4.1)
Score 1300
Code Size 831 Byte
Status AC
Exec Time 117 ms
Memory 10368 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:23:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int x,y,w;scanf("%d%d%d",&x,&y,&w);
                                     ^

Judge Result

Set Name sample all
Score / Max Score 0 / 0 1300 / 1300
Status
AC × 3
AC × 36
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 2816 KB
01-02.txt AC 68 ms 4864 KB
01-03.txt AC 102 ms 7552 KB
01-04.txt AC 33 ms 7936 KB
01-05.txt AC 21 ms 6656 KB
01-06.txt AC 26 ms 7168 KB
01-07.txt AC 21 ms 6016 KB
01-08.txt AC 21 ms 5760 KB
01-09.txt AC 26 ms 5632 KB
01-10.txt AC 61 ms 6144 KB
01-11.txt AC 87 ms 5760 KB
01-12.txt AC 101 ms 7296 KB
01-13.txt AC 101 ms 7296 KB
01-14.txt AC 101 ms 7296 KB
01-15.txt AC 103 ms 7296 KB
01-16.txt AC 101 ms 7296 KB
01-17.txt AC 101 ms 7296 KB
01-18.txt AC 81 ms 10368 KB
01-19.txt AC 21 ms 5888 KB
01-20.txt AC 22 ms 5632 KB
01-21.txt AC 43 ms 5632 KB
01-22.txt AC 86 ms 7296 KB
01-23.txt AC 86 ms 7296 KB
01-24.txt AC 23 ms 8704 KB
01-25.txt AC 117 ms 10368 KB
01-26.txt AC 32 ms 8192 KB
01-27.txt AC 29 ms 7168 KB
01-28.txt AC 67 ms 7936 KB
01-29.txt AC 83 ms 6784 KB
01-30.txt AC 97 ms 8832 KB
sample-01.txt AC 2 ms 2816 KB
sample-02.txt AC 2 ms 2816 KB
sample-03.txt AC 2 ms 2816 KB