Cod sursa(job #1926163)
| Utilizator | Data | 14 martie 2017 00:01:06 | |
|---|---|---|---|
| Problema | Distante | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int n, m, t, s, D[50000], sol;
int main()
{
f>>t;
while(t--)
{
sol = 1;
f>>n>>m>>s;
for(int i = 1; i <= n; i++) f>>D[i];
if(D[s]!=0) sol = 0;
while(m--)
{
int x, y, c;
f>>x>>y>>c;
if(D[x] + c < D[y]) sol = 0;
}
if(sol == 0) g<<"NU\n";
else g<<"DA\n";
}
return 0;
}
