Cod sursa(job #1094894)
Utilizator | Data | 29 ianuarie 2014 23:13:19 | |
---|---|---|---|
Problema | Distante | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<fstream>
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int t,n,m,i,s,d[50005],x,y,c,ok;
int main()
{
f>>t;
while(t-->0)
{
f>>n>>m>>s;
ok=1;
for(i=1;i<=n;++i) f>>d[i];
if(d[s]!=0) ok=0;
for(i=1;i<=m;++i){
f>>x>>y>>c;
if(d[x]+c<d[y]) ok=0;
if(d[y]+c<d[x]) ok=0;
}
if(ok==1) g<<"DA\n";
else g<<"NU\n";
}
}