Pagini recente » Cod sursa (job #3176722) | Cod sursa (job #398079) | Cod sursa (job #1394750) | Cod sursa (job #1607938) | Cod sursa (job #160076)
Cod sursa(job #160076)
#include<cstdio>
#include<vector>
using namespace std;
const int lim=2000000000;
int n,m,s,x,y,c,ok[50001],t,i,aux,j;
vector<pair<int,int> > v[50001];
int main()
{
freopen("distante.in","r",stdin);
freopen("distante.out","w",stdout);
scanf("%d",&t);
for(;t;t--){
scanf("%d %d %d",&n,&m,&s);
for(i=1;i<=n;i++){
scanf("%d",&ok[i]);
v[i].clear();}
for(i=1;i<=m;i++){
scanf("%d %d %d",&x,&y,&c);
v[x].push_back(make_pair(y,c));
v[y].push_back(make_pair(x,c));}
//check();
for(i=1;i<=n;i++){
if(i==s) continue;
x=lim;
for(j=0;j<v[i].size();j++){
y=v[i][j].first;c=v[i][j].second;
if(x>ok[y]+c) x=ok[y]+c;}
if(x!=ok[i]) break;}
if(ok[s]==0 && i==n+1) printf("DA\n");
else printf("NU\n");
}
fclose(stdout);
return 0;
}