Submission #6769369

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int INF=1e9+7,MAXN=2e5+10,MAXM=4e5+10;
struct node {
	int u,v,w;
	node() {
		u=v=w;
	}
	node(int x,int y,int z) {
		u=x;
		v=y;
		w=z;
	}
	friend bool operator<(node x,node y) {
		return x.w<y.w;
	}
} e[MAXM];
int sz;
inline void add(int x,int y,int z) {
	e[++sz]=node(x,y,z);
}
int fa[MAXN];
int findset(int x) {
	return fa[x]==x?x:fa[x]=findset(fa[x]);
}
int N,Q;
int d[MAXN];
int main() {
	scanf("%d%d",&N,&Q);
	memset(d,0x3f,sizeof(d));
	for(int i=1,ii,jj,kk; i<=Q; i++) {
		scanf("%d%d%d",&ii,&jj,&kk);
		add(ii,jj,kk);
		d[ii]=min(d[ii],kk+1);
		d[jj]=min(d[jj],kk+2);
	}
	for(int i=0; i<N; i++) {
		d[i]=min(d[i],d[(i+N-1)%N]+2);
	}
	for(int i=0; i<N; i++) {
		d[i]=min(d[i],d[(i+N-1)%N]+2);
	}
	for(int i=0; i<=N; i++) {
		add(i,(i+1)%N,d[i]);
	}
	sort(e+1,e+sz+1);
	for(int i=1;i<N;i++){
		fa[i]=i;
	}
	int cnt=N-1,ans=0;
	for(int i=1;i<=sz&&cnt;i++){
		int f1=findset(e[i].u),f2=findset(e[i].v);
		if(f1!=f2){
			ans+=e[i].w;
			fa[f1]=f2;
			cnt--;
		}
	}
	printf("%d",ans);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&N,&Q);
                     ^
./Main.cpp:33:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&ii,&jj,&kk);
                              ^

Judge Result