Pagini recente » Cod sursa (job #27119) | Cod sursa (job #27595) | Cod sursa (job #1844877) | Cod sursa (job #2610373) | Cod sursa (job #2033934)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int dist[50005];
int main()
{
int i, N, M, S, T, x, y, c, ans;
fin >> T;
int test;
for( test = 1; test <= T; test++){
ans = 1;
fin >> N >> M >> S;
for(i = 1; i <= N; i++)
fin >> dist[i];
if (dist[S] != 0) ans = 0;
for(i = 1; i <= M; i++)
{
fin >> x >> y >> c;
if(dist[x] + c < dist[y] || dist[y] + c < dist[x])
ans = 0;
}
if(ans == 1)
fout << "DA\n";
else fout << "NU\n";
}
fout.close();
return 0;
}