Pagini recente » Cod sursa (job #2289621) | Cod sursa (job #1201247) | Cod sursa (job #1946574) | Cod sursa (job #2506880) | Cod sursa (job #1065694)
#include <fstream>
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
const int nmax= 50000;
int gd[nmax+1];
int main( ) {
int t;
fin>>t;
for ( ; t>0; --t ) {
int n, m, s;
fin>>n>>m>>s;
for ( int i= 1; i<=n; ++i ) {
fin>>gd[i];
}
int x= 1;
if ( gd[s]!=0 ) {
x= 0;
}
for ( ; m>0; --m ) {
int a, b, c;
fin>>a>>b>>c;
if ( gd[a]+c<gd[b] || gd[b]+c<gd[a] ) {
x= 0;
}
}
if ( x==1 ) {
fout<<"DA\n";
} else {
fout<<"NU\n";
}
}
return 0;
}