Pagini recente » Cod sursa (job #1361193) | Cod sursa (job #747177) | Cod sursa (job #36565) | Borderou de evaluare (job #1978049) | Cod sursa (job #862411)
Cod sursa(job #862411)
#include<cstdio>
#define maxn 50002
int tst ;
int dist[maxn] ;
void query()
{
int n, m, sursa ;
scanf("%d%d%d", &n, &m, &sursa);
bool ok = true ;
for(int i = 1; i <= n; ++i )
scanf("%d", &dist[i]);
if( dist[sursa] != 0 )
ok = false ;
for(int i = 1; i <= m;++i )
{
int a, b, cost ;
scanf("%d%d%d", &a, &b, &cost);
if( dist[a] + cost < dist[b] )
ok = false ;
}
if( ok )
printf("DA\n");
else
printf("NU\n");
}
int main()
{
freopen("distante.in", "r", stdin);
freopen("distante.out", "w", stdout);
scanf("%d", &tst);
for(int i = 1; i <= tst; ++i )
query();
return 0 ;
}