Cod sursa(job #1484518)
Utilizator | Data | 11 septembrie 2015 13:04:56 | |
---|---|---|---|
Problema | Distante | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.61 kb |
#include<iostream>
#include<fstream>
#include<cmath>
using namespace std;
ifstream fin ("distante.in");
ofstream fout ("distante.out");
int main ()
{
int i,j,cnt,d[50005],T,n,cost,m,s,ok,x,y;
fin >> T;
for (cnt=1; cnt <=T; cnt++)
{
fin >> n >> m >> s;
for (i=1; i<=n; i++)
fin >> d[i];
ok=1;
for (i=1; i<=m; i++)
{
fin >> x >> y >> cost;
if (d[x] + cost < d[y] || d[y] + cost < d[x])
ok=0;
}
if (ok==1) fout <<"DA\n";
else fout <<"NU\n";
}
fin.close();
fout.close();
return 0;
}