Cod sursa(job #583296)
| Utilizator | Data | 19 aprilie 2011 15:34:40 | |
|---|---|---|---|
| Problema | Distante | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.7 kb |
#include<cstdio>
using namespace std;
int n,m,S,t,T,i,x,y,cost,dist[50001];
int main()
{
freopen("distante.in","r",stdin);
freopen("distante.out","w",stdout);
scanf("%d",&T);
for(t=1;t<=T;t++)
{
scanf("%d %d %d",&n,&m,&S);
for(i=1;i<=n;i++)
scanf("%d",&dist[i]);
bool ok=true;
if(dist[S])
ok=false;
for(i=1;i<=m;i++)
{
scanf("%d %d %d",&x,&y,&cost);
if(dist[x]+cost<dist[y] || dist[y]+cost<dist[x])
{
ok=false;
}
}
if(ok)
printf("DA\n");
else
printf("NU\n");
}
return 0;
}
