Cod sursa(job #1699893)
| Utilizator | Data | 8 mai 2016 19:27:43 | |
|---|---|---|---|
| Problema | Distante | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream f("distante.in"); ofstream g("distante.out");
int t,n,m,s,i,x,y,c,fin[50015];
bool ok;
int main()
{
for (f >> t; t; t--){
f >> n >> m >> s;
for (i = 1; i <= n; i++)
f >> fin[i];
for (i = 1, ok = 1; i <= m; i++){
f >> x >> y >> c;
if (fin[x] + c < fin[y] || fin[y] + c < fin[x])
ok = 0;
}
if (fin[s] != 0) ok = 0;
if (ok)
g << "DA\n";
else g << "NU\n";
}
}
