Pagini recente » Cod sursa (job #2607644) | Cod sursa (job #252756) | Cod sursa (job #1666009) | Istoria paginii runda/simulare_oji_2023_clasa_9_10_martie/clasament | Cod sursa (job #146249)
Cod sursa(job #146249)
#include <stdio.h>
#include <string.h>
int n, m, s, t, d[50005];
int main()
{
freopen("distante.in","r",stdin);
freopen("distante.out","w",stdout);
scanf("%d",&t);
int i, ok, x, y, c;
while (t--)
{
ok = 1;
scanf("%d %d %d",&n,&m,&s);
for (i = 1; i <= n; i++) scanf("%d",&d[i]);
if (d[s]) ok = 0;
else
for (i = 1; i <= m; i++)
{
scanf("%d %d %d",&x,&y,&c);
if (d[x] + c < d[y]) { ok = 0; break;}
if (d[y] + c < d[x]) { ok = 0; break;}
}
if (ok) printf("DA\n");
else printf("NU\n");
}
return 0;
}