Submission #993221

---

Source Code Expand

#include<stdio.h>
#include<vector>
#include<algorithm>
#include<map>
using namespace std;
#define SIZE 200000
class unionfind
{
public:
	int par[SIZE];
	int ran[SIZE];
	int ren[SIZE];
	void init()
	{
		for(int i=0;i<SIZE;i++)
		{
			par[i]=i;
			ran[i]=0;
			ren[i]=1;
		}
	}
	int find(int a)
	{
		if(a==par[a])return a;
		else return par[a]=find(par[a]);
	}
	void unite(int a,int b)
	{
		a=find(a);
		b=find(b);
		if(a==b)return;
		if(ran[a]>ran[b])
		{
			par[b]=a;
			ren[a]+=ren[b];
		}
		else
		{
			par[a]=b;
			ren[b]+=ren[a];
		}
		if(ran[a]==ran[b])ran[b]++;
	}
};
unionfind uf;
typedef long long ll;
typedef pair<ll,ll>pii;
map<ll,vector<pii> >ma;
int main()
{
	uf.init();
	int num,query;
	scanf("%d%d",&num,&query);
	for(int i=0;i<query;i++)
	{
		int za,zb,zc;
		scanf("%d%d%d",&za,&zb,&zc);
		ma[zc].push_back(make_pair(za,zb));
		ma[zc+1].push_back(make_pair((za+1)%num,zb));
		ma[zc+2].push_back(make_pair((za+1)%num,(zb+1)%num));
		ma[zc+3].push_back(make_pair((za+2)%num,(zb+1)%num));
	}
	map<ll,vector<pii> >::iterator it=ma.begin();
	ll ret=0;
	for(;;)
	{
		if(it==ma.end())break;
		pair<ll,vector<pii> >z=*it;
		it++;
		for(int i=0;i<z.second.size();i++)
		{
			if(uf.find(z.second[i].first)!=uf.find(z.second[i].second))
			{
				uf.unite(z.second[i].first,z.second[i].second);
				ma[z.first+2].push_back(make_pair((z.second[i].first+1)%num,(z.second[i].second+1)%num));
				ma[z.first+4].push_back(make_pair((z.second[i].first+2)%num,(z.second[i].second+2)%num));
				ret+=z.first;
			}
		}
	}
	printf("%lld\n",ret);
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:53:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&num,&query);
                           ^
./Main.cpp:57:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&za,&zb,&zc);
                              ^

Judge Result