Pagini recente » Cod sursa (job #2918300) | Cod sursa (job #2157927) | Cod sursa (job #2711812) | Cod sursa (job #2586318) | Cod sursa (job #847489)
Cod sursa(job #847489)
#include <fstream>
using namespace std;
int main () {
int nr, n, m, s, a, b, c, i;
bool corect;
ifstream in("distante.in");
ofstream out("distante.out");
in >> nr;
for (; nr > 0; nr--) {
corect = true;
in >> n >> m >> s;
int dist[n + 1];
for (i = 1; i <= n; i++) {
in >> dist[i];
}
for (i = 0; i < m; i++) {
in >> a >> b >> c;
if (corect && (dist[a] + c < dist[b] || dist[b] + c < dist[a])) {
corect = false;
}
}
out << (corect ? "DA" : "NU") << '\n';
}
in.close();
out.close();
return 0;
}