Submission #1229472


Source Code Expand

#include<cstring>
#include<cstdlib>
#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#define N 210000
#define LL long long
#define inf (1e9)+(1e8)
using namespace std;
struct node{int x,y,d;}a[2*N];
int f[2*N],n,m,q,fa[N];
LL ans;
int find(int x)
{
	if(fa[x]!=x) fa[x]=find(fa[x]);
	return fa[x];
}
bool cmp(node x,node y)
{
	if(x.d<y.d) return 1;
	return 0;
}
int main()
{
	scanf("%d%d",&n,&q);
	for(int i=0;i<2*n;i++) f[i]=inf;
	while(q--)
	{
		int x,y,d;scanf("%d%d%d",&x,&y,&d);
		a[++m].x=x;a[m].y=y;a[m].d=d;
		f[x]=min(f[x],d+1);
		f[y]=min(f[y],d+2);
	}
	for(int i=1;i<2*n;i++) f[i]=min(f[i],f[i-1]+2);
	for(int i=n;i<2*n;i++) f[i-n]=min(f[i-n],f[i]);
	for(int i=0;i<n;i++) if(f[i]!=inf) a[++m].x=i,a[m].y=(i+1)%n,a[m].d=f[i];
	sort(a+1,a+m+1,cmp);
	for(int i=0;i<n;i++) fa[i]=i;
	for(int i=1;i<=m;i++)
	{
		int x=find(a[i].x),y=find(a[i].y);
		if(x!=y)
		{
			ans+=a[i].d;
			fa[x]=y;
		}
	}
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Submission Time
Task G - Zigzag MST
User la1la1la
Language C++14 (GCC 5.4.1)
Score 1300
Code Size 1009 Byte
Status AC
Exec Time 119 ms
Memory 10496 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:26: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:30:37: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   int x,y,d;scanf("%d%d%d",&x,&y,&d);
                                     ^

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 2304 KB
01-02.txt AC 68 ms 4352 KB
01-03.txt AC 104 ms 7680 KB
01-04.txt AC 33 ms 8704 KB
01-05.txt AC 22 ms 7424 KB
01-06.txt AC 27 ms 7936 KB
01-07.txt AC 23 ms 6656 KB
01-08.txt AC 22 ms 6528 KB
01-09.txt AC 27 ms 6400 KB
01-10.txt AC 63 ms 6400 KB
01-11.txt AC 89 ms 5504 KB
01-12.txt AC 102 ms 7296 KB
01-13.txt AC 103 ms 7424 KB
01-14.txt AC 103 ms 7424 KB
01-15.txt AC 105 ms 7424 KB
01-16.txt AC 103 ms 7424 KB
01-17.txt AC 103 ms 7424 KB
01-18.txt AC 82 ms 10496 KB
01-19.txt AC 22 ms 6656 KB
01-20.txt AC 24 ms 6400 KB
01-21.txt AC 44 ms 6400 KB
01-22.txt AC 88 ms 7296 KB
01-23.txt AC 86 ms 7296 KB
01-24.txt AC 24 ms 9472 KB
01-25.txt AC 119 ms 10496 KB
01-26.txt AC 34 ms 8960 KB
01-27.txt AC 30 ms 7936 KB
01-28.txt AC 69 ms 8064 KB
01-29.txt AC 84 ms 6528 KB
01-30.txt AC 99 ms 8960 KB
sample-01.txt AC 2 ms 2304 KB
sample-02.txt AC 2 ms 2304 KB
sample-03.txt AC 2 ms 2304 KB