pat1003

最新推荐文章于 2022-09-06 12:42:28 发布

cyy想变强

最新推荐文章于 2022-09-06 12:42:28 发布

阅读量108

点赞数

分类专栏： pat

本文链接：https://blog.csdn.net/qq_40178140/article/details/80645700

版权

pat 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

#include<iostream>
#include<vector>
#include<map>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
#define INF 9999999
int N, M, yourstart, yourend;
int teamnum[510];
int g[510][510];
int dist[510];
int cnt[510];
int team[510];
int main()
{
	//freopen("test.txt", "r", stdin);
	cin >> N >> M >> yourstart >> yourend;
	for (int i = 0; i < N; ++i) {
		cin >> teamnum[i];
	}
	for (int m = 0; m < 510; ++m)
		for (int n = 0; n < 510; ++n)
			g[m][n] = INF;
	for (int i = 0; i < M; ++i) {
		int s, e, l;
		cin >> s >> e >> l;
		g[s][e] = l;
		g[e][s] = l;
	}
	int ok[510];
	for (int k = 0; k < 510; ++k) {
		cnt[k] = 1;
		team[k] = teamnum[k];
		ok[k] = 0;
	}
	for (int i = 0; i < N; ++i)
	{
		dist[i] = g[yourstart][i];
		if (dist[i] != INF && i != yourstart)
			team[i] = teamnum[yourstart] + teamnum[i];
	}
	ok[yourstart] = 1;
	
	for (int i = 0; i < N - 1; ++i)
	{
		int mindist = INF, index;
		for (int j = 0; j < N; ++j) {
			if (ok[j] == 0 && dist[j] < mindist) {
				mindist = dist[j];
				index = j;
			}
		}
		ok[index] = 1;
		for (int m = 0; m < N; ++m) {
			if (ok[m] == 0 && dist[m] > dist[index] + g[index][m])
			{
				cnt[m] = cnt[index];
				team[m] = team[index] + teamnum[m];
				dist[m] = dist[index] + g[index][m];
			}
			else if (ok[m] == 0 && dist[m] == dist[index] + g[index][m])
			{
				cnt[m] += cnt[index];
				if (team[m] < team[index] + teamnum[m])
					team[m] = team[index] + teamnum[m];
			}
		}
	}
	cout << cnt[yourend] << " " << team[yourend];
	return 0;
}

注意dj算法不仅可以算最短路，也可以算到一个节点的路径和队伍和，原理和最短路类似，通过上一个节点的信息更新下一个节点