Submission #2177332


Source Code Expand

#include <cstdio>
#include <algorithm>
using namespace std;

struct init{
	int x,y;
	long long z;
}e[600007];
int n,m;
int f[200007];
long long d[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+=e[i].z;
			if((++t)==n-1)	break;
		}
	}
	return ;
}

int main()
{
	scanf("%d%d",&n,&m);
	for(int i=0;i<=n;++i)	d[i]=1e9*1e9;
	for(int i=1;i<=m;++i)
	{
		scanf("%d%d%d",&e[i].x,&e[i].y,&e[i].z);
		++e[i].x,++e[i].y;
		d[e[i].x]=min(d[e[i].x],e[i].z+1);
		d[e[i].y]=min(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
Task G - Zigzag MST
User vjudge4
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1033 Byte
Status WA
Exec Time 114 ms
Memory 10624 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:47:41: warning: format ‘%d’ expects argument of type ‘int*’, but argument 4 has type ‘long long int*’ [-Wformat=]
   scanf("%d%d%d",&e[i].x,&e[i].y,&e[i].z);
                                         ^
./Main.cpp:43: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:47: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
AC × 3
AC × 27
WA × 9
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 2176 KB
01-02.txt AC 64 ms 4224 KB
01-03.txt AC 97 ms 10624 KB
01-04.txt AC 32 ms 8576 KB
01-05.txt AC 20 ms 7424 KB
01-06.txt AC 26 ms 7808 KB
01-07.txt AC 21 ms 6656 KB
01-08.txt AC 20 ms 6400 KB
01-09.txt AC 24 ms 6272 KB
01-10.txt AC 57 ms 8320 KB
01-11.txt WA 83 ms 7424 KB
01-12.txt AC 95 ms 10368 KB
01-13.txt AC 96 ms 10368 KB
01-14.txt AC 96 ms 10368 KB
01-15.txt WA 98 ms 10368 KB
01-16.txt AC 95 ms 10368 KB
01-17.txt AC 96 ms 10368 KB
01-18.txt AC 79 ms 10368 KB
01-19.txt AC 21 ms 6656 KB
01-20.txt AC 22 ms 6272 KB
01-21.txt WA 40 ms 8320 KB
01-22.txt WA 84 ms 10368 KB
01-23.txt WA 83 ms 10368 KB
01-24.txt AC 20 ms 6272 KB
01-25.txt AC 114 ms 10368 KB
01-26.txt AC 30 ms 6272 KB
01-27.txt WA 27 ms 6272 KB
01-28.txt WA 64 ms 8320 KB
01-29.txt WA 82 ms 7680 KB
01-30.txt WA 93 ms 10368 KB
sample-01.txt AC 1 ms 2176 KB
sample-02.txt AC 1 ms 2176 KB
sample-03.txt AC 1 ms 2176 KB