Cod sursa(job #1206489)
Utilizator | Data | 10 iulie 2014 11:26:30 | |
---|---|---|---|
Problema | Distante | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int n,m,s,x,y,i,t,ok,c,q[50002];
int main()
{
f>>t;
for(int q1=1;q1<=t;q1++)
{
ok=1;
f>>n>>m>>s;
for(i=1;i<=n;i++) f>>q[i];
for(i=1;i<=m;i++)
{
f>>x>>y>>c;
if(q[x]+c<q[y]||q[y]+c<q[x]) ok=0;
}
if(ok==0) g<<"NU\n";
else g<<"DA\n";
}
return 0;
}