Pagini recente » Cod sursa (job #2931976) | Cod sursa (job #2981833) | Cod sursa (job #2192710) | Cod sursa (job #850745) | Cod sursa (job #640294)
Cod sursa(job #640294)
#include <fstream>
#define PII pair<int,int>
#define st first
#define nd second
#define MP make_pair
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
const int INF = int(2e9);
int N , M , S , D[50001];
void solve_test()
{
fin>>N>>M>>S;
int x , y , c , ans = 1;
for(int i=1;i<=N;++i)
fin>>D[i];
for(;M;M--)
{
fin>>x>>y>>c;
if(D[x] + c<D[y] || D[y] + c<D[x])
ans = 0;
}
fout<<(ans == 1 ? "DA\n" :"NU\n");
}
int main()
{
int T;
for(fin>>T;T;T--)
solve_test();
return 0;
}