Pagini recente » Cod sursa (job #3233209) | Cod sursa (job #1482658) | Cod sursa (job #761473) | Cod sursa (job #146394) | Cod sursa (job #2529672)
#include <fstream>
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int N, T, M, S;
int dist[50000 + 5];
void Solve()
{
fin >> N >> M >> S;
for(int i = 1; i <= N; ++ i)
fin >> dist[i];
int a, b, c;
bool isOk = true;
for(int i = 1; i<= M; ++ i) {
fin >> a >> b >> c;
if(dist[a] + c < dist[b] || dist[b] + c < dist[a])
isOk = false;
}
if(dist[S] != 0 || isOk == false)
fout << "NU" << '\n';
else
fout << "DA" << '\n';
}
int main()
{
fin >> T;
for(int i = 1; i <= T; ++ i)
Solve();
return 0;
}