@[QAQ__](/user/627636) [80pts](https://www.luogu.com.cn/record/109673081)!
```cpp
for (int i = 0; i < sing[AK].size(); i++)
{
l[sing[AK][i]]--;
dis[sing[AK][i]]=max(dis[sing[AK][i]],IOI);
if(!l[sing[AK][i]])q.push(seeleAKNOI(sing[AK][i],dis[sing[AK][i]]));
}
```
这里更新的应该是 `sing[AK][i]`
by Sheez @ 2023-05-06 11:39:50
@[QAQ__](/user/627636) 以及，用 `l[AK]` 来判断是否以这个点进行松弛是错误的。
by Sheez @ 2023-05-06 11:42:45
@[QAQ__](/user/627636) 过了。
循环条件改成 `for (;!q.empty();)` 就过了
by Sheez @ 2023-05-06 11:44:56
@[Sheez](/user/939998) 能给下完整代码吗（）
by QAQ__ @ 2023-05-06 12:18:49
@[QAQ__](/user/627636)
```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];
bool vis[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 (;!q.empty();)
{
AK = q.top().x;
IOI = q.top().dis;
q.pop();
if (vis[AK])
continue;
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]]--;
dis[sing[AK][i]]=max(dis[sing[AK][i]],IOI);
if(!l[sing[AK][i]])q.push(seeleAKNOI(sing[AK][i],dis[sing[AK][i]]));
}
vis[AK]=1;
}
cout << dis[n];
}
```
by Sheez @ 2023-05-06 12:23:47
所以为什么我这题会省选T1却不会
by Sheez @ 2023-05-06 12:24:55
@[Sheez](/user/939998) 谢谢！
by QAQ__ @ 2023-05-06 12:59:03
seele老师可爱
by Sheez @ 2023-05-06 13:00:44