Submission #3968103


Source Code Expand

#include<bits/stdc++.h>
#define ll long long
using namespace std;
struct aaa{
	int x,y,val;
}a[1000001];
int n,m,fa[1000001],d[1000001],tot,ans;
bool cmp(aaa a,aaa b){
	return a.val<b.val;
}
void build(int t,int k,int s){
	tot++;
	a[tot].x=t;a[tot].y=k;a[tot].val=s;
}
int find(int x){
	if(x==fa[x])return x;
	return fa[x]=find(fa[x]);
}
int main(){
	int i,t,k,s,now,x,y;
	memset(d,44,sizeof(d));
	scanf("%d%d",&n,&m);
	for(i=1;i<=m;i++){
		scanf("%d%d%d",&t,&k,&s);
		build(t,k,s);
		d[t]=min(d[t],s+1);d[k]=min(d[k],s+2);
	}
	for(i=0;i<n;i++)d[i]=min(d[i],d[(i-1+n)%n]+2);
	//puts("-1");
	for(i=0;i<n;i++)d[i]=min(d[i],d[(i-1+n)%n]+2);
	for(i=0;i<n;i++)build(i,(i+1)%n,d[i]);
	//puts("-2");
	sort(a+1,a+tot+1,cmp);
	for(i=1;i<n;i++)fa[i]=i;
	now=n-1;
	for(i=1;i<=tot&&now;i++){
		//printf("%d\n",i);
		x=find(a[i].x);y=find(a[i].y);
		if(x!=y){
			fa[x]=y;now--;
			ans+=a[i].val;
		}
	}
	printf("%d",ans);
}

Submission Info

Submission Time
Task G - Zigzag MST
User xielinhan
Language C++ (GCC 5.4.1)
Score 0
Code Size 954 Byte
Status WA
Exec Time 120 ms
Memory 14848 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:22: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:24:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&t,&k,&s);
                           ^

Judge Result

Set Name sample all
Score / Max Score 0 / 0 0 / 1300
Status
AC × 2
WA × 1
AC × 9
WA × 27
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 WA 4 ms 6400 KB
01-02.txt AC 68 ms 8448 KB
01-03.txt WA 103 ms 14848 KB
01-04.txt WA 16 ms 10496 KB
01-05.txt WA 24 ms 11520 KB
01-06.txt WA 29 ms 12032 KB
01-07.txt WA 25 ms 10880 KB
01-08.txt WA 16 ms 10496 KB
01-09.txt WA 21 ms 12544 KB
01-10.txt WA 61 ms 12544 KB
01-11.txt WA 88 ms 12544 KB
01-12.txt WA 100 ms 14592 KB
01-13.txt WA 100 ms 14592 KB
01-14.txt WA 100 ms 14592 KB
01-15.txt WA 92 ms 14592 KB
01-16.txt WA 100 ms 14592 KB
01-17.txt WA 100 ms 14592 KB
01-18.txt WA 76 ms 14592 KB
01-19.txt WA 24 ms 10752 KB
01-20.txt AC 25 ms 10496 KB
01-21.txt AC 47 ms 12544 KB
01-22.txt AC 89 ms 14592 KB
01-23.txt AC 90 ms 14592 KB
01-24.txt WA 24 ms 12544 KB
01-25.txt WA 120 ms 14592 KB
01-26.txt WA 34 ms 10496 KB
01-27.txt WA 19 ms 12544 KB
01-28.txt WA 70 ms 12544 KB
01-29.txt WA 87 ms 12544 KB
01-30.txt WA 81 ms 14592 KB
sample-01.txt AC 4 ms 6400 KB
sample-02.txt WA 3 ms 6400 KB
sample-03.txt AC 4 ms 6400 KB