#include<iostream>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N=1010;
int g[N][N],dist[N],q[N],n,m,k;
bool st[N];
bool dijistra(){
memset(dist,0x3f,sizeof dist);
memset(st, 0, sizeof st);
dist[q[0]]=0;
for(int i=0;i<n;i++){
int t=q[i];
for(int j=1;j<=n;j++){
if(!st[j]&&dist[j]<dist[t]){
return false;
}
}
st[t]=true;
for(int j=1;j<=n;j++) dist[j]=min(dist[j],dist[t]+g[t][j]);
}
return true;
}
int main()
{
memset(g,0x3f,sizeof g);
cin>>n>>m;
while(m--){
int a,b,c;
cin>>a>>b>>c;
g[a][b]=g[b][a]=c;
}
int s;
cin>>s;
while(s--){
for(int i=0;i<n;i++) cin>>q[i];
if(dijistra()) cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
return 0;
}
AcWing 4275. Dijkstra序列
最新推荐文章于 2024-07-18 23:31:00 发布