这貌似是恶搞的帖子，我好像被骗了。
by Xy_top @ 2023-05-06 06:21:33
@[QAQ__](/user/627636) 草
by Bicycle_zxc @ 2023-05-06 06:42:50
@[QAQ__](/user/627636) 显然洛谷没有说错
by qifan_maker @ 2023-05-06 07:41:06
@[Xy_top](/user/637796) 没有恶搞啊/dk
by QAQ__ @ 2023-05-06 09:06:29
@[sheez](/user/939998) 来帮我调
by QAQ__ @ 2023-05-06 09:06:48
@[QAQ__](/user/627636) ~~珍爱生命，远离压行~~
by User_leo @ 2023-05-06 10:04:07
@[leo20220722](/user/757861) 这个不是我故意压的，手机上复制了一下代码就变成这样了
但是有一说一不想看这种代码可以用代码格式化工具啊
by QAQ__ @ 2023-05-06 10:05:48
......这位蒟蒻好像不会这道题 ~~先撤了~~
by User_leo @ 2023-05-06 10:12:45
仅是展开
```cpp
#include <iostream>
#include <vector>
#include <queue>
#define int long long
using namespace std;
vector<int> a[3005], seele[3005], sing[3005];
int dis[3005], l[3005];
struct seeleAKNOI {
int x, dis;
seeleAKNOI(int I_love_seele, int Seele_Vollereiyyds) {
x = I_love_seele;
dis = Seele_Vollereiyyds;
}
};
bool operator <(const seeleAKNOI &x, const seeleAKNOI &y) {
return x.dis > y.dis;
}
priority_queue<seeleAKNOI> q;
signed main() {
int n, m, u, v, w, TLEWA, AK, IOI;
cin >> n >> m;
for (int i = 1; i <= m; i++) {
cin >> u >> v >> w;
a[u].push_back(v);
seele[u].push_back(w);
}
for (int i = 1; i <= n; i++) dis[i] = 0x3fffffffffffffff;
dis[1] = 0;
for (int i = 1; i <= n; i++) {
cin >> l[i];
for (int j = 1; j <= l[i]; j++) {
cin >> TLEWA;
sing[TLEWA].push_back(i);
}
}
q.push(seeleAKNOI(1, 0));
for (int asdf = 1; asdf <= n; asdf++) {
AK = q.top().x;
IOI = q.top().dis;
q.pop();
for (int i = 0; i < a[AK].size(); i++) if (dis[a[AK][i]] > IOI + seele[AK][i]) {
dis[a[AK][i]] = IOI + seele[AK][i];
if (l[a[AK][i]]) q.push(seeleAKNOI(a[AK][i], dis[a[AK][i]]));
}
for (int i = 0; i < sing[AK].size(); i++) {
l[sing[AK][i]]--;
if (!l[sing[AK][i]]) q.push(seeleAKNOI(sing[AK][i], dis[sing[AK][i]])), dis[sing[AK][i]] = max(dis[sing[AK][i]], IOI);
}
}
cout << dis[n];
}
```
by 小胖同学 @ 2023-05-06 10:55:03
中午没作业，帮你调会
by Sheez @ 2023-05-06 11:35:13