Pagini recente » Cod sursa (job #812857) | Cod sursa (job #3279729) | Cod sursa (job #408472) | Cod sursa (job #3283978) | Cod sursa (job #1249487)
#include <fstream>
#include <vector>
using namespace std;
#define NMax 50005
ifstream fin("distante.in");
ofstream fout("distante.out");
int T;
int n,m,s,i,ok;
int D[NMax],viz[NMax];
int a,b,c;
int rezolva()
{
ok=1;
fin>>n>>m>>s;
for(i=1;i<=n;++i)
{
fin>>D[i];
viz[i]=0;
}
if(D[s]!=0) ok=0;
viz[s]=1;
for(i=1;i<=m;++i)
{
fin>>a>>b>>c;
if(D[a]+c<D[b]) ok=0;
if(D[b]+c<D[a]) ok=0;
if(D[a]+c==D[b]) viz[b]=1;
if(D[b]+c==D[a]) viz[a]=1;
}
for(i=1;i<=n;++i) if(viz[i]==0) return 0;
return ok;
}
int main()
{
fin>>T;
while(T--)
if(rezolva()==1) fout<<"DA"<<'\n'; else fout<<"NU"<<'\n';
fin.close();
fout.close();
return 0;
}