Cod sursa(job #911201)
Utilizator | Denis Crudu crudu_denis | Data | 11 martie 2013 13:51:52 |
---|---|---|---|
Problema | Distante | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.64 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int t , n ,m ,s ;
int main()
{
fin >> t;
while ( t)
{
fin>>n>>m>>s;
vector<int> v(n+1);
for(int i=1;i<=n;i++)
fin>>v[i];
int ok=1;
int a,b,c;
if(v[s])
ok=0;
for(;m;--m)
{
fin>>a>>b>>c;
if(v[a]>v[b]+c || v[b]>v[a]+c)
ok=0;
}
if(ok)
fout<<"DA"<<endl;
else
fout<<"NU"<<endl;
t--;
}
return 0;
}