【题解】LuoGu1608：路径统计

原题传送门
没什么特别之处，就是最短路+统计路径
主要是一些坑点

• 有重边
• 单向边

我不得已的用邻接矩阵存了
Code：

#include <bits/stdc++.h>
#define maxn 2010
using namespace std;
int dis[maxn], n, m, cnt[maxn], vis[maxn], line[maxn][maxn];
struct node{
	int val, len;
	bool operator < (const node &x) const{ return x.len < len; }
};
priority_queue <node> q;

inline int read(){
	int s = 0, w = 1;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') w = -1;
	for (; isdigit(c); c = getchar()) s = (s << 1) + (s << 3) + (c ^ 48);
	return s * w;
}

int main(){
	n = read(), m = read();
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j) line[i][j] = 1e9;
	for (int i = 1; i <= m; ++i){
		int x = read(), y = read(), z = read();
		line[x][y] = min(line[x][y], z)/*, line[y][x] = min(line[y][x], z)*/;
	}
	for (int i = 2; i <= n; ++i) dis[i] = 1e9;
	cnt[1] = 1;
	q.push((node){1, 0});
	while (!q.empty()){
		node tmp = q.top(); q.pop();
		int u = tmp.val;
		if (vis[u]) continue;
		vis[u] = 1;
		for (int i = 1; i <= n; ++i)
		if (line[u][i] < 1e9){
			if (dis[i] > dis[u] + line[u][i]){
				dis[i] = dis[u] + line[u][i], cnt[i] = cnt[u];
				if (!vis[i]) q.push((node){i, dis[i]});
			} else
			if (dis[i] == dis[u] + line[u][i]) cnt[i] += cnt[u];
		}
	}
	if (dis[n] < 1e9) printf("%d %d\n", dis[n], cnt[n]); else puts("No answer");
	return 0;
}