Pagini recente » Cod sursa (job #1044136) | Cod sursa (job #1079539) | Cod sursa (job #2672355) | Cod sursa (job #1737629) | Cod sursa (job #1374468)
#include <fstream>
#define nmax 50001
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int D[nmax];
int t;
int main()
{f>>t;
int n,m,s,x,y,z,i,ok;
while(t)
{ok=0;
f>>n>>m>>s;
for(i=1;i<=n;++i)
f>>D[i];
for(i=1;i<=m;++i)
{f>>x>>y>>z;
if((D[x]>D[y]+z) || D[y]>D[x]+z) ok=1;
}
if(D[s]!=0) ok=1;
if(ok==1) g<<"NU"<<"\n";
else g<<"DA"<<"\n";
--t;
}
return 0;
}