Cod sursa(job #1502120)
| Utilizator | Data | 14 octombrie 2015 10:55:27 | |
|---|---|---|---|
| Problema | Distante | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include<fstream>
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int d[50001];
int t,i,n,m,s,x,y,c;
bool ok;
int main()
{
f>>t;
while(t)
{
t--;
f>>n>>m>>s;
ok=1;
for(i=1;i<=n;i++)
{
f>>d[i];
if(i==s&&d[i]!=0)
ok=0;
}
for(i=1;i<=m;i++)
{
f>>x>>y>>c;
if(d[x]+c<d[y]||d[y]+c<d[x])
ok=0;
}
if(ok==1)
g<<"DA";
else
g<<"NU";
g<<"\n";
}
return 0;
}
