求调
  • 板块学术版
  • 楼主fish_gugu
  • 当前回复0
  • 已保存回复0
  • 发布时间2024/8/9 17:49
  • 上次更新2024/8/9 19:18:31
查看原帖
求调
759436
fish_gugu楼主2024/8/9 17:49

https://www.luogu.com.cn/problem/P1967

我拼死拼活写的东东MLE了(是数据范围的错),求调

#include <bits/stdc++.h>
using namespace std;

int n,m;
const int maxn = 1e3 + 5,maxm = 5e4 + 5;
struct Esxyz
{
	int u,v,w;
	bool operator < (const Esxyz & o) const
	{
		return w < o.w;
	}
}e[maxm];

int fa[maxn];
int ans[maxn][maxn];

void init(int n)
{
	for(int i = 1;i <= n;i++) fa[i] = i;
}

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

void calAns(int x,int y,int w)
{
	for(int i = 1;i <= n;i++)
	{
		if(find(i) != x) continue;
		for(int j = 1;j <= n;j++)
		{
			if(find(j) != y) continue;
			ans[i][j] = ans[j][i] = w;
		}
	}
}

void merge(int x,int y,int w)
{
	x = find(x);
	y = find(y);
	if(x == y) return;
	calAns(x,y,w);
	fa[y] = x;
}

int main()
{
	cin >> n >> m;
	for(int i = 0;i < m;i++) cin >> e[i].u >> e[i].v >> e[i].w;
	init(n);
	sort(e,e + m);
	memset(ans,-1,sizeof(ans));
	for(int i = m - 1;i >= 0;i--) merge(e[i].u,e[i].v,e[i].w);
	int q;
	cin >> q;
	for(int i = 1;i <= q;i++)
	{
		int x,y;
		cin >> x >> y;
		cout << ans[x][y] << endl;
	}
	return 0;
}
2024/8/9 17:49
加载中...