Submission #5030245

---

Source Code Expand

#include<bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fin(x) freopen(x,"r",stdin)
#define fout(x) freopen(x,"w",stdout)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll inf=0xc0c0c0c0c0c0c0c0;
const double pi=acos(-1);
const ll MAX=2e5+7;
ll N,Q;
struct node{
	ll A,B,C;
};
bool operator<(node n1,node n2){return n1.C>n2.C;}
ll fa[MAX];
ll find(ll x){return fa[x]==x?x:fa[x]=find(fa[x]);}
priority_queue<node>que;
int main()
{
	scanf("%lld%lld",&N,&Q);
	for(ll i=0;i<N;i++)
		fa[i]=i;
	while(Q--)
	{
		node n;
		scanf("%lld%lld%lld",&n.A,&n.B,&n.C);
		que.push(n);
		n.A=(n.A+1)%N;n.C++;
		que.push(n);
	}
	ll block=N;
	ll res=0;
	while(block!=1)
	{
		node n=que.top();
		que.pop();
		ll a=find(n.A),b=find(n.B);
		if(a!=b)
		{
			res+=n.C;
			fa[a]=b;
			n.A=(n.A+1)%N;
			n.B=(n.B+1)%N;
			n.C+=2;
			block--;
			que.push(n);
		}
		// prllf("%lld\n",block);
	}
	printf("%lld\n",res);
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:26:25: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld",&N,&Q);
                         ^
./Main.cpp:32:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld",&n.A,&n.B,&n.C);
                                       ^

Judge Result