Cod sursa(job #2198824)
| Utilizator | Data | 25 aprilie 2018 17:13:13 | |
|---|---|---|---|
| Problema | Distante | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream in("distante.in");
ofstream out("distante.out");
const int NMAX = 50002;
int d[NMAX];
bool test() {
int n, m, s;
in >> n >> m >> s;
for (int i = 1; i <= n; i ++)
in >> d[i];
bool R = 0;
if (d[s] != 0) R = 1;
int a, b, c;
for (int i = 1; i <= m; i ++) {
in >> a >> b >> c;
if (d[a] + c < d[b] || d[b] + c < d[a])
R = 1;
}
return R;
}
int main()
{
int t;
in >> t;
while (t --)
if (!test())
out << "DA\n";
else
out << "NU\n";
return 0;
}
