Submission #994881

---

Source Code Expand

#include<stdio.h>
#include<queue>
#include<algorithm>
#include<vector>
#include<set>
using namespace std;
int UF[210000];
//set<int>S[210000];
int FIND(int a){
	if(UF[a]<0)return a;
	return UF[a]=FIND(UF[a]);
}
int HP=5;
void UNION(int a,int b){
	a=FIND(a);b=FIND(b);if(a==b)return;UF[a]+=UF[b];UF[b]=a;
}
vector<int>vis[210000];
int main(){
	int a,b;scanf("%d%d",&a,&b);
	priority_queue<pair<pair<int,int>,pair<int,int> > >Q;
	for(int i=0;i<b;i++){
		int s,t,u;
		scanf("%d%d%d",&s,&t,&u);
		Q.push(make_pair(make_pair(-u,HP),make_pair(s,t)));
		Q.push(make_pair(make_pair(-u-1,HP),make_pair(t,(s+1)%a)));
		
	}
	long long ret=0;
	for(int i=0;i<a;i++)UF[i]=-1;
	while(Q.size()){
		int cost=-Q.top().first.first;
		int id=Q.top().first.second;
		int L=Q.top().second.first;
		int R=Q.top().second.second;
		Q.pop();
	//	printf("%d %d %d\n",cost,L,R);
		if(L==R){
		//	Q.push(make_pair(make_pair(-cost-2,id),make_pair((L+1)%a,(R+1)%a)));
			continue;
		}
				
		if(FIND(L)==FIND(R)){
			bool ok=true;
			if(id==0)ok=false;
	//		for(set<int>::iterator it=S[L].begin();it!=S[L].end();it++){
	//			if(S[R].count(*it)){
	//				ok=false;break;
	//			}
	//		}
			if(ok){

	//	S[L].insert(id);
	//	S[R].insert(id);
				Q.push(make_pair(make_pair(-cost-2,id-1),make_pair((L+1)%a,(R+1)%a)));
			}
			continue;
		}
	//	S[L].insert(id);
	//	S[R].insert(id);
		UNION(L,R);

		//printf("%d %d\n",L,R);
		ret+=cost;
		Q.push(make_pair(make_pair(-cost-2,HP),make_pair((L+1)%a,(R+1)%a)));
	}
	printf("%lld\n",ret);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:19:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  int a,b;scanf("%d%d",&a,&b);
                             ^
./Main.cpp:23:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&s,&t,&u);
                           ^

Judge Result