Pagini recente » Cod sursa (job #511476) | Cod sursa (job #1413163) | Cod sursa (job #2931313) | Cod sursa (job #1693216) | Cod sursa (job #2749234)
//#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("distante.in");
ofstream cout("distante.out");
int dist[50005],d[50005];
vector <pair<int,int> > v[50005];
void redo(int n){
for(int i=1;i<=n;i++){
v[i].clear();
}
}
int main()
{
int t,n,m,s,a,b,c;
cin>>t;
while(t--){
cin>>n>>m>>s;
for(int i=1;i<=n;i++){
cin>>dist[i];
}
for(int i=1;i<=m;i++){
cin>>a>>b>>c;
v[a].push_back(make_pair(b,c));
v[b].push_back(make_pair(a,c));
}
int ok=0;
for(int i=1;i<=n;i++){
d[i]=50000005;
}
if(dist[s]!=0){
ok=1;
}
d[s]=0;
for(int i=1;i<=n;i++){
for(auto u:v[i]){
if(u.first!=s)
d[u.first]=min(d[u.first],dist[i]+u.second);
}
}
for(int i=1;i<=n;i++){
if(d[i]!=dist[i]){
ok=1;
}
}
if(ok==1){
cout<<"NU\n";
}
else
cout<<"DA\n";
redo(n);
}
return 0;
}