Pagini recente » Cod sursa (job #2358556) | Cod sursa (job #2339291) | Cod sursa (job #2688719) | Cod sursa (job #1064055) | Cod sursa (job #2426886)
#include <fstream>
using namespace std;
ifstream in ("distante.in");
ofstream out ("distante.out");
int main() {
int t;
in >> t;
while (t --) {
int n, m, s;
in >> n >> m >> s;
int dist[n + 1];
for (int i = 1; i <= n; i ++) {
in >> dist[i];
}
if (dist[s] != 0) {
out << "NU\n";
continue;
}
bool pp = true;
for (int j = 0; j < m; j ++) {
int a, b, c;
in >> a >> b >> c;
if (dist[a] + c < dist[b] || dist[b] + c < dist[a]) {
pp = false;
}
}
if (pp) {
out << "DA\n";
} else {
out << "NU\n";
}
}
return 0;
}