B - Build Roads（Gym - 103118B ）完全图求最小生成树

本题给了一个生成两点间距离的函数，每次赋对一个点赋值，两边的边长位顶点值的gcd

int xorshift64()
{
	int x = seed;
	x ^= x << 13;
	x ^= x >> 7;
	x ^= x << 17;
	return seed = x;
}
int gen()
{
	return xorshift64() % (r - l + 1) + l;
}

 尝试几组 l r seed 值会发现，求得的边长大多数为1，l==r时边长为 l，所以在数据量小时跑krusal求最小生成树，数据量大时可以直接根据规律求出答案。

#include<iostream>
#include<queue>
#include<algorithm>
#include<cstring>
#include<map>
#include<set>
const int N = 1e6 + 6006;
const int M = 4 * N;
#define mod %998244353 
#define FAST ios::sync_with_stdio(false);
#define endl '\n'
#define int unsigned long long 
#define rep(i,n)for(int i=1;i<=n;++i)
#define sc(n) scanf("%d",&n);
using namespace std;
int n, l, r, seed, a[200001];
int  b[N], k[N], p[N];
struct node
{
	int u;
	int v;
	int w;
}edge[N];
typedef pair<int, int>PII;
priority_queue<PII, vector<PII>, greater<PII>>Q;
int find(int x)
{
	if (x != p[x])p[x] = find(p[x]);
	return p[x];
}
int gcd(int a, int b)
{
	return b > 0 ? gcd(b, a % b) : a;
}
int xorshift64()
{
	int x = seed;
	x ^= x << 13;
	x ^= x >> 7;
	x ^= x << 17;
	return seed = x;
}
int gen()
{
	return xorshift64() % (r - l + 1) + l;
}
int cnt = 0;
bool cmp(node a, node b)
{
	return a.w < b.w;
}
int kruskal()
{
	int res = 0;
	sort(edge + 1, edge + 1 + cnt, cmp);
	int k = 0;
	for (int i = 1; i <= cnt; i++)
	{
		if (k == n - 1)break;
		int a = edge[i].u, b = edge[i].v;
		if (find(a) != find(b))
		{
			res += edge[i].w;
			p[find(a)] = find(b);
			k++;
		}
	}
	return res;
}
signed main()
{
	FAST;
	cin >> n >> l >> r >> seed;
	if (n >= 5000)
	{
		if (l >= r)
		{
			cout << (n - 1) * l << endl;
			return 0;
		}
		else
		{
			cout << (n - 1) << endl;
			return 0;
		}
	}
	for (int i = 1; i <= n; i++)p[i] = i;
	for (int i = 1; i <= n; i++)
		a[i] = gen();
	for (int i = 1; i <= n; i++)
	{
		for (int j = i + 1; j <= n; j++)
		{
			cnt++;
			edge[cnt].u = i;
			edge[cnt].v = j;
			edge[cnt].w = gcd(a[i], a[j]);
		}
	}
	int res = kruskal();
	cout << res << endl;
	return 0;
}