|
#include <bits/stdc++.h>
#define scf0(a) scanf("%s",&a)
#define scf1(a) scanf("%d",&a)
#define scf2(a,b) scanf("%d%d",&a,&b)
#define scf3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define scf4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d)
#define MEM(a,b) memset(a,b,sizeof(a))
#define pii pair<int,int>
#define pdd pair<double,double>
#define LL long long
using namespace std;
const int maxn = 500 + 5;
const int INF = 0x3f3f3f3f;
int n, m, s, d;
int u, v, len;
int val[maxn];
int mp[maxn][maxn];
void Dijstra(){
bool vis[maxn];
MEM(vis, false);
int dist[maxn]; //当前点的最短距离
MEM(dist, INF);
int tot_val[maxn]; //当前点的最大点权
MEM(tot_val, 0);
tot_val[s] = val[s];
dist[s] = 0;
vis[s] = true;
int diff[maxn]; //当前点不同最短路径方案数
for(int i = 0; i <= n; i++) diff[i] = 1; //方案数都为1
map<int,int>fa; //记录路径
fa.clear();
fa[s] = -1;
for(int i = 0; i < n; i++) {
if(i != s && dist[i] < INF) {
dist[i] = mp[s][i];
tot_val[i] = val[s] + val[i];
fa[i] = s;
}
}
for(int k = 0; k < n - 1; k++){ //找 n-1 个点
int minn = INF, pos;
for(int i = 0; i < n; i++) {
if(vis[i] == false) {
if(dist[i] < minn) {
minn = dist[i];
pos = i;
}
}
}
vis[pos] = true;
// cout << pos << endl;
for(int i = 0; i < n; i++) {
if(vis[i] == false) {
if(dist[pos] + mp[pos][i] < dist[i]) {
dist[i] = dist[pos] + mp[pos][i];
tot_val[i] = tot_val[pos] + val[i];
fa[i] = pos;
diff[i] = diff[pos]; //开始写成diff[i] = 1，WA了7分，应该继pos的路径数才对啊！
}
else if(dist[pos] + mp[pos][i] == dist[i]) {
diff[i] += diff[pos]; //开始写成diff[i]++， WA了7分，应该继pos的路径数才对啊！
if(tot_val[i] < tot_val[pos] + val[i]){
tot_val[i] = tot_val[pos] + val[i];
fa[i] = pos;
}
}
}
}
}
//输出
cout << diff[d] << ‘ ‘;
stack<int>sta;
int sum = val[d];
sta.push(d);
while(fa[d] != -1) {
d = fa[d];
sum += val[d];
sta.push(d);
}
cout << sum << endl;
bool cnt = false;
while(!sta.empty()) {
if(cnt) cout << ‘ ‘;cnt = true;
cout << sta.top();
sta.pop();
}
cout << endl;
}
int main() {
MEM(mp, INF);
scf4(n, m, s, d);
for(int i = 0; i < n; i++) scf1(val[i]);
for(int i = 0; i < m; i++) {
scf3(u, v, len);
mp[u][v] = min(mp[u][v], len); //数据最终不卡相同路径值，但要注意这一点
mp[v][u] = mp[u][v];
}
Dijstra();
}
|
