P2502 [HAOI2006]旅行(最小生成树魔改)

最新推荐文章于 2024-09-21 14:53:30 发布

野指针*

最新推荐文章于 2024-09-21 14:53:30 发布

阅读量120

点赞数

分类专栏：图论文章标签： c++ 算法

本文链接：https://blog.csdn.net/CK1513710764/article/details/126511321

版权

图论专栏收录该内容

9 篇文章 0 订阅

订阅专栏

思路:

想用dijkstra + SPFA写的,但是没写出来.然后我们看到边数很小,可以想到一个m^2logm的做法,就是枚举最大边,然后枚举最小边加边进去,直到s与t联通,我们对边从大到小排个序即可.

代码:

#include <bits/stdc++.h>
#define int long long                                         
#define IOS ios::sync_with_stdio(false), cin.tie(0) 
#define ll long long 
// #define double long double
#define ull unsigned long long 
#define PII pair<int, int> 
#define PDI pair<double, int> 
#define PDD pair<double, double> 
#define debug(a) cout << #a << " = " << a << endl 
#define point(n) cout << fixed << setprecision(n)
#define all(x) (x).begin(), (x).end() 
#define mem(x, y) memset((x), (y), sizeof(x)) 
#define lbt(x) (x & (-x)) 
#define SZ(x) ((x).size()) 
#define inf 0x3f3f3f3f 
#define INF 0x3f3f3f3f3f3f3f3f
namespace nqio{const unsigned R = 4e5, W = 4e5; char *a, *b, i[R], o[W], *c = o, *d = o + W, h[40], *p = h, y; bool s; struct q{void r(char &x){x = a == b && (b = (a = i) + fread(i, 1, R, stdin), a == b) ? -1 : *a++;} void f(){fwrite(o, 1, c - o, stdout); c = o;} ~q(){f();}void w(char x){*c = x;if (++c == d) f();} q &operator >>(char &x){do r(x);while (x <= 32); return *this;} q &operator >>(char *x){do r(*x); while (*x <= 32); while (*x > 32) r(*++x); *x = 0; return *this;} template<typename t> q&operator>>(t &x){for (r(y),s = 0; !isdigit(y); r(y)) s |= y == 45;if (s) for (x = 0; isdigit(y); r(y)) x = x * 10 - (y ^ 48); else for (x = 0; isdigit(y); r(y)) x = x * 10 + (y ^ 48); return *this;} q &operator <<(char x){w(x);return *this;}q &operator<< (char *x){while (*x) w(*x++); return *this;}q &operator <<(const char *x){while (*x) w(*x++); return *this;}template<typename t> q &operator<< (t x) {if (!x) w(48); else if (x < 0) for (w(45); x; x /= 10) *p++ = 48 | -(x % 10); else for (; x; x /= 10) *p++ = 48 | x % 10; while (p != h) w(*--p);return *this;}}qio; }using nqio::qio;
using namespace std;
const int N = 2e6 + 10;
int n, m, fa[N], s, t;
struct rec {
	int u, v, w;
	bool operator< (const rec &i) const {
		return w < i.w;
	}
} e[N];
int find(int x) {
	return x == fa[x] ? x : fa[x] = find(fa[x]);
}
void merge(int x, int y) {
	int fx = find(x), fy = find(y);
	if (fx == fy) return;
	fa[fx] = fy;
}
signed main() {
	qio >> n >> m;
	for (int i = 1; i <= m; ++i)
		qio >> e[i].u >> e[i].v >> e[i].w;
	qio >> s >> t;
	sort(e + 1, e + 1 + m);
	int mx = INF, mn = 1;
	for (int i = 1; i <= m; ++i) {
		for (int j = 1; j <= m; ++j) fa[j] = j;
		for (int j = i; j >= 1; --j) {
			merge(e[i].u, e[i].v);
			merge(e[j].u, e[j].v);
			if (find(s) == find(t) && e[i].w * mn < e[j].w * mx) mx = e[i].w, mn = e[j].w; 
		}
	}
	if (mx == INF && mn == 1) return qio << "IMPOSSIBLE\n", 0;
	int gcd = __gcd(mx, mn);
	mx /= gcd, mn /= gcd;
	if (mn != 1) qio << mx << "/" << mn << "\n";
	else qio << mx << "\n";
}