Cod sursa(job #949189)
| Utilizator | Data | 12 mai 2013 19:12:33 | |
|---|---|---|---|
| Problema | Distante | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include<fstream>
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int ok,t,n,m,s,i,j,b[50010],x,y,c;
int main()
{
f>>t;
while(t--)
{
ok=1;
f>>n>>m>>s;
for(i=1;i<=n;i++)
f>>b[i];
if(b[s]!=0)
ok=0;
while(m--)
{
f>>x>>y>>c;
if(b[x]>b[y]+c||b[y]>b[x]+c)
ok=0;
}
if(ok)
g<<"DA";
else
g<<"NU";
g<<"\n";
}
return 0;
}
