Submission #5808823


Source Code Expand

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define LL long long
#define ri register int
#define N 200500

struct edge{
  int u,v,l;
	bool operator < (const edge &rhs) const {
	  return l<rhs.l;
	}
} e[N<<1];
int f[N],v[N];
int n,m;
LL ans;

int findroot(int x){
  if (f[x]==x) return x;
	return f[x]=findroot(f[x]);
}

using namespace std;
int main(){
  scanf("%d %d",&n,&m);
	for (ri i=0;i<n;i++) v[i]=2000000000;
	for (ri i=1;i<=m;i++) {
	  scanf("%d %d %d",&e[i].u,&e[i].v,&e[i].l);
		v[e[i].u]=min(e[i].l+1,v[e[i].u]);
		v[e[i].v]=min(e[i].l+2,v[e[i].v]);
	}
	for (ri i=0;i<n;i++) f[i]=i;
	for (ri i=0;i<2*n;i++) v[(i+1)%n]=min(v[(i+1)%n],v[i%n]+2);
	int cc=m;
	for (ri i=0;i<n-1;i++) e[++cc]=(edge){i,i+1,v[i]};
	e[++cc]=(edge){n-1,0,v[n-1]};
	sort(e+1,e+cc+1);

	for (ri i=1;i<=cc;i++) {
	  int r1=findroot(e[i].u),r2=findroot(e[i].v);
		if (r1==r2) continue;
		f[r1]=r2;
		ans+=e[i].l;
	}
	cout<<ans<<endl;
}

Submission Info

Submission Time
Task G - Zigzag MST
User luogu_bot1
Language C++ (GCC 5.4.1)
Score 1300
Code Size 992 Byte
Status AC
Exec Time 91 ms
Memory 9600 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:26:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&n,&m);
                       ^
./Main.cpp:29:45: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d %d %d",&e[i].u,&e[i].v,&e[i].l);
                                             ^

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 256 KB
01-02.txt AC 62 ms 2816 KB
01-03.txt AC 89 ms 6784 KB
01-04.txt AC 20 ms 6656 KB
01-05.txt AC 13 ms 5376 KB
01-06.txt AC 16 ms 5888 KB
01-07.txt AC 14 ms 4736 KB
01-08.txt AC 15 ms 4480 KB
01-09.txt AC 20 ms 4352 KB
01-10.txt AC 54 ms 6400 KB
01-11.txt AC 78 ms 5632 KB
01-12.txt AC 89 ms 6528 KB
01-13.txt AC 89 ms 6528 KB
01-14.txt AC 90 ms 6528 KB
01-15.txt AC 91 ms 6528 KB
01-16.txt AC 89 ms 6528 KB
01-17.txt AC 89 ms 6528 KB
01-18.txt AC 68 ms 9600 KB
01-19.txt AC 14 ms 4736 KB
01-20.txt AC 18 ms 4352 KB
01-21.txt AC 38 ms 6400 KB
01-22.txt AC 77 ms 6528 KB
01-23.txt AC 77 ms 6528 KB
01-24.txt AC 15 ms 7424 KB
01-25.txt AC 89 ms 9600 KB
01-26.txt AC 20 ms 6912 KB
01-27.txt AC 22 ms 5888 KB
01-28.txt AC 58 ms 7936 KB
01-29.txt AC 74 ms 6528 KB
01-30.txt AC 84 ms 8064 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB