Cod sursa(job #2059983)
Utilizator | Data | 7 noiembrie 2017 19:44:52 | |
---|---|---|---|
Problema | Distante | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include<fstream>
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int cor[50001],t,n,m,s,y,c,x,i;
int main()
{
f>>t;
for(int q=1;q<=t;q++)
{
f>>n>>m>>s;
for(i=1;i<=n;i++)
f>>cor[i];
int ok=1;
if(cor[s]!=0)
{
ok=0;
}
for(i=1;i<=m;i++)
{
f>>x>>y>>c;
if(cor[x]+c<cor[y]||cor[y]+c<cor[y])
ok=0;
}
if(ok==0)
g<<"NU"<<'\n';
else
g<<"DA"<<'\n';
}
return 0;
}