Pagini recente » Istoria paginii runda/simulare_oji_sergiu_2 | Cod sursa (job #1996483) | Cod sursa (job #2944045) | Monitorul de evaluare | Cod sursa (job #1075089)
#include<cstdio>
#include<vector>
using namespace std;
struct muchie {int x,y,c;} G[50005];
int t,m,n,s,d[50005];
void rez()
{
int x,y,c,i;
bool ok;
scanf("%d%d%d",&n,&m,&s);
for (i=1;i<=n;++i) scanf("%d",&d[i]);
for (i=1;i<=m;++i)
{
scanf("%d%d%d",&x,&y,&c);
G[2*i-1].x=x, G[2*i-1].y=y, G[2*i-1].c=c;
G[2*i].x=x, G[2*i].y=y, G[2*i].c=c;
}
for (i=1,ok=true;i<=2*m && ok;++i)
if (d[G[i].x]+G[i].c<d[G[i].y])
ok=false;
if (ok) printf("DA\n");
else printf("NU\n");
}
int main()
{
int i;
freopen("distante.in","r",stdin);
freopen("distante.out","w",stdout);
scanf("%d",&t);
for (i=0;i<t;++i)
rez();
return 0;
}