Submission #7650652


Source Code Expand

#include <bits/stdc++.h>
#define int long long
#define inf 0x3f3f3f3f
#define re register
#define N 301200
#define pii pair<int,int>
#define mp make_pair
#define fi first
#define se second
#define mod 1000000007
using namespace std;
struct edge{
	int u,v,d;
}e[N<<1];
inline int read(){
	int x=0,w=0;char ch=getchar();
	while (!isdigit(ch))w|=ch=='-',ch=getchar();
	while (isdigit(ch))x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
	return w?-x:x;
}
int f[N],g[N],ans,n,Q,cnt;
inline bool cmp(edge a,edge b){
	return a.d<b.d;
}
int find(int k){return f[k]==k?k:f[k]=find(f[k]);}
void Kr(){
	sort(e+1,e+1+cnt,cmp);
	for (int i=1,t=0;i<=cnt;++i){
		int x=find(e[i].u),y=find(e[i].v);
		if (x==y)continue;
		f[x]=y;
		++t;ans+=e[i].d;
		if (t==n-1)break;
	}
}
signed main(){
	n=read(),Q=read();
	memset(g,0x3f,sizeof(g));
	while (Q--){
		int u=read()+1,v=read()+1,d=read();
		e[++cnt]=(edge){u,v,d};
		g[u]=min(g[u],d+1);g[v]=min(g[v],d+2);
	}
	for (int i=1;i<=n;++i)
		g[i]=min(g[i],g[(i-2+n)%n+1]+2),f[i]=i;
	for (int i=1;i<=n;++i)
		g[i]=min(g[i],g[(i-2+n)%n+1]+2),e[++cnt]=(edge){i,i+1,g[i]};
	Kr();
	printf("%d\n",ans);
	return 0;
}

Submission Info

Submission Time
Task G - Zigzag MST
User heyuanjie
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1174 Byte
Status WA
Exec Time 126 ms
Memory 14848 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:49:19: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]
  printf("%d\n",ans);
                   ^

Judge Result

Set Name sample all
Score / Max Score 0 / 0 0 / 1300
Status
AC × 3
AC × 8
WA × 28
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 3 ms 6400 KB
01-02.txt AC 50 ms 10496 KB
01-03.txt WA 97 ms 14848 KB
01-04.txt WA 45 ms 11904 KB
01-05.txt WA 30 ms 11520 KB
01-06.txt WA 38 ms 11904 KB
01-07.txt WA 31 ms 10752 KB
01-08.txt WA 30 ms 10624 KB
01-09.txt WA 33 ms 10496 KB
01-10.txt WA 62 ms 12544 KB
01-11.txt WA 78 ms 12544 KB
01-12.txt WA 94 ms 14592 KB
01-13.txt WA 94 ms 14592 KB
01-14.txt WA 94 ms 14592 KB
01-15.txt WA 96 ms 14592 KB
01-16.txt WA 95 ms 14592 KB
01-17.txt WA 94 ms 14592 KB
01-18.txt WA 79 ms 14592 KB
01-19.txt WA 31 ms 10880 KB
01-20.txt WA 31 ms 10496 KB
01-21.txt WA 48 ms 12544 KB
01-22.txt WA 79 ms 14592 KB
01-23.txt WA 82 ms 14592 KB
01-24.txt WA 29 ms 10496 KB
01-25.txt WA 126 ms 14592 KB
01-26.txt WA 43 ms 10496 KB
01-27.txt WA 38 ms 10496 KB
01-28.txt WA 69 ms 14592 KB
01-29.txt WA 82 ms 12544 KB
01-30.txt WA 95 ms 14592 KB
sample-01.txt AC 3 ms 6400 KB
sample-02.txt AC 3 ms 6400 KB
sample-03.txt AC 3 ms 6400 KB