Pagini recente » Cod sursa (job #2265581) | Cod sursa (job #1060516) | Cod sursa (job #3002698) | Cod sursa (job #2541207) | Cod sursa (job #1460862)
#include <fstream>
#define NMAX 50001
using namespace std;
int dist[NMAX];
int main()
{
int n, m;
int i;
int t;
int s;
int a, b, c;
bool result;
ifstream f("distante.in");
ofstream g("distante.out");
f >> t;
for(int ii = 0; ii < t; ii++)
{
result = true;
f >> n >> m >> s;
for(i = 1; i <= n; i++)
f >> dist[i];
if(dist[s])
result = false;
for(i = 0; i < m; i++)
{
f >> a >> b >> c;
if(dist[a] + c < dist[b])
result = false;
if(dist[b] + c < dist[a])
result = false;
}
if(result)
g << "DA\n";
else
g << "NU\n";
}
f.close();
g.close();
return 0;
}