Submission #2178442


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);
		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);
	}
	for(int i=1;i<=2;++i)
	for(int j=1;j<=n;++j)
		d[(j%n)]=min(d[(j%n)],d[j-1]+2);
	for(int i=1;i<=n;++i)
		e[m+i].x=i%n,e[m+i].y=(i+1)%n,e[m+i].z=d[(i%n)];
	sort(e+1,e+n+m+1,cmp);
	kruskal();printf("%lld\n",ans);
	return 0;
}

Submission Info

Submission Time
Task G - Zigzag MST
User vjudge5
Language C++14 (GCC 5.4.1)
Score 1300
Code Size 939 Byte
Status AC
Exec Time 117 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 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 1 ms 2176 KB
01-02.txt AC 64 ms 4224 KB
01-03.txt AC 99 ms 10624 KB
01-04.txt AC 34 ms 8576 KB
01-05.txt AC 23 ms 7424 KB
01-06.txt AC 28 ms 7808 KB
01-07.txt AC 23 ms 6656 KB
01-08.txt AC 23 ms 6400 KB
01-09.txt AC 26 ms 6272 KB
01-10.txt AC 61 ms 8320 KB
01-11.txt AC 85 ms 7424 KB
01-12.txt AC 98 ms 10368 KB
01-13.txt AC 100 ms 10368 KB
01-14.txt AC 102 ms 10368 KB
01-15.txt AC 101 ms 10368 KB
01-16.txt AC 100 ms 10368 KB
01-17.txt AC 99 ms 10368 KB
01-18.txt AC 82 ms 10368 KB
01-19.txt AC 23 ms 6656 KB
01-20.txt AC 23 ms 6272 KB
01-21.txt AC 45 ms 8320 KB
01-22.txt AC 87 ms 10368 KB
01-23.txt AC 87 ms 10368 KB
01-24.txt AC 23 ms 6272 KB
01-25.txt AC 117 ms 10368 KB
01-26.txt AC 33 ms 6272 KB
01-27.txt AC 27 ms 6272 KB
01-28.txt AC 73 ms 8320 KB
01-29.txt AC 85 ms 7680 KB
01-30.txt AC 98 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