Pagini recente » Borderou de evaluare (job #472010) | Cod sursa (job #1406227) | Cod sursa (job #3232251) | Borderou de evaluare (job #2681804) | Cod sursa (job #3239810)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int n, m, i, j, x, y, c, o, t, s;
int dist[50002];
bool ok;
static inline void Calc() {
fin >> n >> m >> s;
ok = true;
for(i = 1; i <= n; i++) fin >> dist[i];
for(i = 1; i <= m; i++) {
fin >> x >> y >> c;
if(dist[x] + c < dist[y] || dist[y] + c < dist[x]) ok = false;
}
if(dist[s]) ok = false;
if(ok) fout << "DA\n";
else fout << "NU\n";
}
int main() {
fin >> t;
while(t--) Calc();
return 0;
}