Submission #992850

---

Source Code Expand

#include <cstdio>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cstdlib>
#include <iostream>

using namespace std;

#define MOD @
#define ADD(X,Y) ((X) = ((X) + (Y)) % MOD)
typedef long long i64; typedef vector<int> ivec; typedef vector<string> svec;

int N, nQ;
int A[202020], B[202020], C[202020];

int uf[303030];

int root(int p)
{
	return uf[p] < 0 ? p : (uf[p] = root(uf[p]));
}
bool join(int p, int q)
{
	p = root(p);
	q = root(q);
	if (p == q) return false;
	uf[p] += uf[q];
	uf[q] = p;
	return true;
}

int main()
{
	scanf("%d%d", &N, &nQ);
	for (int i = 0; i < nQ; ++i) {
		scanf("%d%d%d", A + i, B + i, C + i);
	}
	for (int i = 0; i < N; ++i) uf[i] = -1;

	i64 ret = 0;
	priority_queue<pair<int, pair<int, int> > > Q;
	for (int i = 0; i < nQ; ++i) {
		Q.push({ -C[i],{ A[i], B[i] } });
		Q.push({ -C[i] - 1,{ B[i], (1 + A[i]) % N } });
	}
	while (!Q.empty()) {
		auto a = Q.top(); Q.pop();
		int cost = -a.first;
		int p = a.second.first, q = a.second.second;
		if (!join(p, q)) continue;
		ret += cost;
		Q.push({ -(cost + 2), {(p + 1) % N, (q + 1) % N} });

	}

	printf("%lld\n", ret);

	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:41:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &nQ);
                        ^
./Main.cpp:43:39: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", A + i, B + i, C + i);
                                       ^

Judge Result