蓝桥杯2023（十四届）国赛——删边问题（丑陋并查集/Tarjan）

删边问题

1.删边问题 - 蓝桥云课 (lanqiao.cn)

还行，用并查集暴力求解的话，能过30%，考试的时候就选她了！

丑陋的暴力并查集：30%

#include <iostream>
#include <vector>
#include <unordered_map>
using namespace std;

//先试试用暴力能骗多少分

#define ll long long
const int N = 2e5 + 2;

struct Edge
{
	int x, y;
}edge[N];

int n, m;
ll val[N] = { 0 };	//点的权值
int pre[N] = { 0 };
int ans = 0x3f3f3f3f;

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

int find(int a)
{
	int root = a;
	while (pre[root] != root)
		root = pre[root];
	while (pre[a] != a)
	{
		int fa = pre[a];
		pre[a] = root;
		a = fa;
	}
	return root;
}

void join(int a, int b)
{
	int fa = find(a), fb = find(b);
	if (fa != fb)	pre[fa] = fb;
}

int getcal()
{
	int cnt =