Pagini recente » Cod sursa (job #488111) | Cod sursa (job #1875757) | Cod sursa (job #2717255) | Cod sursa (job #2473323) | Cod sursa (job #2830208)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int T, n, m, s, d[50005];
int main()
{
int a, b, c;
fin >> T;
for(int pas = 1; pas <= T; pas++)
{
bool v = 1;
fin >> n >> m >> s;
for(int i = 1; i <= n; i++)
fin >> d[i];
if(d[s] != 0)
v = 0;
for(int i = 1; i <= m; i++)
{
fin >> a >> b >> c;
if(d[a] + c < d[b] || d[b] + c < d[a])
v = 0;
}
if(v == 0)
fout << "NU\n";
else
fout << "DA\n";
}
return 0;
}