Submission #992576

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back

#define N 400010

int n, m;
int f[N];
int px[N], py[N], pz[N];
set<PII> A;

int fa(int x) {
	if (f[x] == x) return x;
	f[x] = fa(f[x]);
	return f[x];
}

int main() {
	cin >> n >> m;
	for (int i = 0; i < m; i ++) {
		cin >> px[i] >> py[i] >> pz[i];
		A.insert(mp(pz[i], i));
		px[i+m] = py[i]; py[i+m] = (px[i]+1)%n; pz[i+m] = pz[i]+1;
		A.insert(mp(pz[i]+1, i+m));
	}
	for (int i = 0; i < n; i ++) f[i] = i;
	ll S = 0;
	while (!A.empty()) {
		PII _x = *A.begin();
		A.erase(A.begin());
		int i = _x.se; 
		int z = _x.fi;
		int x = px[i];
		int y = py[i];
		if (fa(x) != fa(y)) {
			S += z;
			f[fa(x)] = fa(y);
			(px[i] += 1) %= n;
			(py[i] += 1) %= n;
			A.insert(mp(z+2, i));
		}
	}
	cout << S << endl;
	return 0;
}

Submission Info

Judge Result