Pagini recente » Cod sursa (job #1647752) | Cod sursa (job #2633770) | Cod sursa (job #488050) | Cod sursa (job #1483733) | Cod sursa (job #1457329)
#include <stdio.h>
using namespace std;
const int Dim = 50005;
const int INF = 0x3f3f3f3f;
int N,M,S,T,D[Dim];
int main()
{
freopen("distante.in","r",stdin);
freopen("distante.out","w",stdout);
scanf("%d",&T);
while(T--)
{
bool ok = true;
scanf("%d%d%d",&N,&M,&S);
for (int i = 1;i <= N;i++)
scanf("%d",&D[i]);
if (D[S])
ok = false;
while(M--)
{
int A,B,C;
scanf("%d%d%d",&A,&B,&C);
if (D[A] + C < D[B] || D[B] + C < D[A])
ok = false;
}
if (ok)
printf("DA\n"); else printf("NU\n");
}
}