邻接矩阵完全版本Dijkstra （未优化）

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

const int maxn = 510;
const int inf = 0x3f3f3f;
int n, m, st, ed;
int G[maxn][maxn], w[maxn], weight[maxn], num[maxn], d[maxn];
bool vis[maxn] = {false};

void dijkstra(int s) {
	fill (d, d + maxn, inf);
	fill (num, num + maxn, 0);
	fill (w, w + maxn, 0);
	d[s] = 0;
	num[s] = 1;
	w[s] = weight[s];
	
	for ( int i = 0; i < n; i++ ){
		int u = -1, MIN = inf;
		for ( int j = 0; j < n; j++) {
			if (!vis[j] && MIN > d[j]) {
				u = j;
				MIN = d[j];
			}
		}
		
		if (u == -1) return ;
		vis[u] = 1;
		
		for ( int v = 0; v < n; v ++) {
			if (!vis[v] ) {
				if (d[v] > d[u] + G[u][v]) {
					d[v] = d[u] + G[u][v];
					w[v] = weight[v] + w[u];
					num[v] = num[u];
				} 
				else if (d[v] == d[u] + G[u][v]) {
					num[v] += num[u];
					w[v] = max(w[v], w[u] + weight[v]);
				}
			}
		}
	}
}

int main() {
	cin >> n >> m >> st >> ed;
	for (int i = 0; i < n; i++) {
		cin >> weight[i];
	}
	
	fill (G[0], G[0] + maxn * maxn, inf);
	
	for (int i = 0; i < m; i++) {
		int a, b, c;
		cin >> a >> b >> c;
		G[a][b] = G[b][a] = c;
	}
	dijkstra(st);
	cout << num[ed] << " " << w[ed] << endl;
	return 0;
}