Cod sursa(job #853970)
Utilizator | Data | 12 ianuarie 2013 17:01:49 | |
---|---|---|---|
Problema | Distante | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream>
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int t,i,n,ok,m,s,c,x,y,d[50001];
int main()
{
f>>t;
for(;t;--t)
{
f>>n>>m>>s;
for(i=1;i<=n;++i)
f>>d[i];
ok=1;
for(i=1;i<=m;++i)
{
f>>x>>y>>c;
if(d[x]+c<d[y])
ok=0;
}
if(d[s])
ok=0;
if(ok)
g<<"DA\n";
else
g<<"NU\n";
}
return 0;
}