Pagini recente » Cod sursa (job #2770897) | Cod sursa (job #93053) | Cod sursa (job #566970) | Cod sursa (job #2297889) | Cod sursa (job #998048)
Cod sursa(job #998048)
#include <cstdio>
using namespace std;
const int NMAX = 50005;
int T, N, M, S, A, B, C, D[NMAX];
int main()
{
freopen("distante.in", "r", stdin);
freopen("distante.out", "w", stdout);
scanf("%i", &T);
for(; T; T --)
{
scanf("%i %i %i", &N, &M, &S);
for(int i = 1; i <= N; ++ i) scanf("%i", &D[i]);
bool OK = 1;
for(int i = 1; i <= M; ++ i)
{
scanf("%i %i %i", &A, &B, &C);
if(D[A] + C < D[B] || D[B] + C < D[A]) OK = 0;
}
if(OK) printf("DA\n");
else printf("NU\n");
}
return 0;
}