Submission #2164044


Source Code Expand

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
struct edge{
	int x,y;
	ll z;
} gs[400400];
int n,m;
ll ans;
ll best[200200];

int p[200200];
int par(int x){
	return (p[x]==x)?x:(p[x]=par(p[x]));
}

int main(){
	scanf("%d%d",&n,&m);
	memset(best,0x7f,sizeof best);
	for (int i=0;i<n;++i)
		p[i]=i;

	for (int i=0;i<m;++i){
		static int x,y;
		static ll z;
		scanf("%d%d%lld",&x,&y,&z);
		gs[i]=(edge){x,y,z};
		best[x]=min(best[x],z+1);
		best[y]=min(best[y],z+2);
	}

	for (int it=0;it<2;++it)
		for (int i=0;i<n;++i)
			best[(i+1)%n]=min(best[(i+1)%n],best[i]+2);

	for (int i=0;i<n;++i)
		gs[m+i]=(edge){i,(i+1)%n,best[i]};

	sort(gs,gs+m+n,[](const edge &a,const edge &b){return a.z<b.z;});
	for (int i=0;i<m+n;++i){
		int fa=par(gs[i].x);
		int fb=par(gs[i].y);
		if (fa!=fb){
			ans+=gs[i].z;
			p[fa]=fb;
		}
	}
	printf("%lld\n", ans);
}

Submission Info

Submission Time
Task G - Zigzag MST
User vjudge4
Language C++14 (GCC 5.4.1)
Score 1300
Code Size 864 Byte
Status AC
Exec Time 101 ms
Memory 12032 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:18: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:26:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%lld",&x,&y,&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 2 ms 3584 KB
01-02.txt AC 66 ms 5632 KB
01-03.txt AC 101 ms 9088 KB
01-04.txt AC 21 ms 8704 KB
01-05.txt AC 13 ms 7424 KB
01-06.txt AC 17 ms 7936 KB
01-07.txt AC 16 ms 6784 KB
01-08.txt AC 16 ms 6528 KB
01-09.txt AC 22 ms 6400 KB
01-10.txt AC 57 ms 8448 KB
01-11.txt AC 84 ms 8064 KB
01-12.txt AC 96 ms 8832 KB
01-13.txt AC 96 ms 8832 KB
01-14.txt AC 96 ms 8832 KB
01-15.txt AC 97 ms 8832 KB
01-16.txt AC 96 ms 8832 KB
01-17.txt AC 96 ms 8832 KB
01-18.txt AC 73 ms 11904 KB
01-19.txt AC 15 ms 6784 KB
01-20.txt AC 20 ms 6400 KB
01-21.txt AC 41 ms 8448 KB
01-22.txt AC 83 ms 8832 KB
01-23.txt AC 83 ms 8832 KB
01-24.txt AC 16 ms 9472 KB
01-25.txt AC 93 ms 12032 KB
01-26.txt AC 21 ms 8960 KB
01-27.txt AC 24 ms 7936 KB
01-28.txt AC 63 ms 9984 KB
01-29.txt AC 79 ms 8960 KB
01-30.txt AC 90 ms 10368 KB
sample-01.txt AC 2 ms 3584 KB
sample-02.txt AC 2 ms 3584 KB
sample-03.txt AC 2 ms 3584 KB