Pagini recente » Cod sursa (job #2597856) | Cod sursa (job #2022220) | Cod sursa (job #2000117) | Cod sursa (job #1103791) | Cod sursa (job #1389966)
#include<fstream>
#include<string>
using namespace std;
const int nmax = 50001;
int d[50001];
ifstream fin("distante.in");
ofstream fout("distante.out");
int main()
{
int t;
fin >> t;
for (; t; t--)
{
int n, m, s;
fin >> n >> m >> s;
for (int i = 1; i <= n; i++)
{
fin >> d[i];
}
bool g = 0;
for (int i = 1; i <= m; i++)
{
int x, y, w;
fin >> x >> y >> w;
if (d[x] > d[y] + w || d[y] > d[x] + w)
{
g = 1;
}
}
(g == 0&&!d[s]) ? fout << "DA\n" : fout << "NU\n";
}
}