Submission #1229465


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[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[n-i]=min(f[n-i],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 0
Code Size 1007 Byte
Status RE
Exec Time 159 ms
Memory 6656 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 0 / 1300
Status
AC × 3
AC × 8
WA × 11
RE × 17
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 69 ms 3072 KB
01-03.txt RE 157 ms 4352 KB
01-04.txt WA 28 ms 6656 KB
01-05.txt WA 30 ms 6016 KB
01-06.txt WA 27 ms 6272 KB
01-07.txt WA 23 ms 5248 KB
01-08.txt WA 22 ms 5120 KB
01-09.txt WA 27 ms 5120 KB
01-10.txt RE 131 ms 4352 KB
01-11.txt RE 157 ms 3968 KB
01-12.txt RE 159 ms 4352 KB
01-13.txt RE 158 ms 4352 KB
01-14.txt RE 159 ms 4352 KB
01-15.txt RE 157 ms 4352 KB
01-16.txt RE 158 ms 4352 KB
01-17.txt RE 158 ms 4352 KB
01-18.txt RE 154 ms 4352 KB
01-19.txt WA 22 ms 5248 KB
01-20.txt WA 24 ms 4992 KB
01-21.txt RE 117 ms 4352 KB
01-22.txt RE 152 ms 4352 KB
01-23.txt RE 150 ms 4352 KB
01-24.txt WA 18 ms 4992 KB
01-25.txt RE 156 ms 4352 KB
01-26.txt WA 21 ms 5888 KB
01-27.txt WA 19 ms 4352 KB
01-28.txt RE 138 ms 4352 KB
01-29.txt RE 152 ms 3968 KB
01-30.txt RE 158 ms 4352 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