【Floyd】【2020.8.23NOIP模拟赛】最优路线

$Link$

$luoguT145192$

$Description$

$Sample$ $Input$

3 3 
2 3 3 
1 2 2 
2 3 3 
1 3 1 

$Sample$ $Output$

0 6 3 
6 0 6 
3 6 0

$Hint$

对于 20%的数据，n<=5,m<=8。
对于 50%的数据，n<=50
对于 100%的数据，n<=500,m<=n*(n-1)/2，
				边权和点权不超过 10^9。

$Solution$

按点权排序然后跑$floyed$，中转点和枚举的$i,j$一定是最大的三个点，然后判断一下是否要更新就好了
加快读快输，开long long

$Code$

#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#define ll long long

using namespace std;

int n, m;
int a[505];
ll w[505][505], f[505][505];


struct awsl
{ 
	ll x;
	int num;
}s[124755];

ll maxx(ll a, ll b)
{
	if (a > b) return a;
	else return b;
}

ll minx(ll a, ll b)
{
	if (a > b) return b;
	else return a;
}

bool cmp(awsl a, awsl b)
{return a.x < b.x;} 

int read() 
{
	ll x = 0, flag = 1; char ch = getchar();
	while (ch < '0' || ch > '9') {if (ch == '-') flag = -1; ch = getchar();}
	while (ch >= '0' && ch <= '9'){x = x * 10 + ch - '0'; ch = getchar();}
	return x * flag;
}

void write(ll x)
{
    if (x < 0) { 
		x = -x; 
		putchar('-');
	}
	if (x > 9) write(x / 10);
	putchar(x % 10 + 48);
	return;
}

int main()
{
	memset(w, 0x7f, sizeof(w));
	memset(f, 0x7f, sizeof(f));
	n = read(); m = read();
	for (int i = 1; i <= n; ++i) { 
		a[i] = read();
		s[i].x = a[i]; s[i].num = i;
	} 
	for (int i = 1; i <= m; ++i)
	{
		ll u, v, l;
		u = read(); v = read(); l = read();
		w[v][u] = w[u][v] = l;
		f[u][v] = f[v][u] = (ll) l * maxx(a[u], a[v]);
	}
	sort(s + 1, s + n + 1, cmp);
	for (int i = 1; i <= n; ++i)
	{
		int t = s[i].num;
		for (int j = 1; j <= n; ++j)
		for (int k = 1; k <= n; ++k)
			if (j != t && k != t && k != j)
			if (w[j][k] > maxx(w[j][t], w[k][t]))
			{
				w[j][k] = maxx(w[j][t], w[t][k]);
				f[j][k] = minx(f[j][k], w[j][k] * maxx(a[t], maxx(a[k], a[j])));
			}
	}
	for (int i = 1; i <= n; ++i)
	{
		for (int j = 1; j <= n; ++j)
		{
			if (i == j) putchar('0');
			else if (f[i][j] == f[0][0]) printf("-1");
			else write(f[i][j]);
			putchar(' ');
		}
		putchar('\n');
	}
	return 0;
}