Pagini recente » Cod sursa (job #2697210) | Cod sursa (job #2886948) | Cod sursa (job #3293652) | Cod sursa (job #2288906) | Cod sursa (job #1016170)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("distante.in");
ofstream g ("distante.out");
int n, m, nodSursa;
int cost[50002];
int eOk ()
{
int a, b, c;
int ok=1;
for (int i=1; i<=m; i++)
{
f>>a>>b>>c;
if (cost[a]+c<cost[b]) ok=0;
if (cost[b]+c<cost[a]) ok=0;
}
if (cost[nodSursa]) ok=0;
return ok;
}
int main ()
{
int ok, a, b, c, nrTeste;
f>>nrTeste;
for (int i=1; i<=nrTeste; i++)
{
f>>n>>m>>nodSursa;
for (int i=1; i<=n; i++) f>>cost[i];
if (eOk ()) g<<"DA";
else g<<"NU";
g<<'\n';
}
return 0;
}