Pagini recente » Cod sursa (job #2761170) | Cod sursa (job #143682) | Cod sursa (job #2248134) | Cod sursa (job #41094) | Cod sursa (job #862402)
Cod sursa(job #862402)
#include<cstdio>
#include<cstring>
using namespace std ;
#define maxn 50010
int tst ;
int n, m, sursa ;
int dist[maxn] ;
int main()
{
freopen("distante.in", "r", stdin);
freopen("distante.out", "w", stdout);
scanf("%d", &tst);
for(int j = 1; j <= tst; ++j )
{
bool ok = true ;
memset( dist, 0, sizeof(dist) ) ;
scanf("%d%d%d", &n, &m, &sursa);
for(int i = 1; i <= n; ++i )
scanf("%d", &dist[i]);
if( dist[sursa] )
ok = false ;
for(int i = 1; i <= m; ++i )
{
int a, b, cost ;
scanf("%d%d%d", &a, &b, &cost);
if( dist[b] > dist[a] + cost )
{
ok = false ;
break ;
}
}
if( ok == true )
printf("DA\n");
else
printf("NU\n");
}
return 0 ;
}