Pagini recente » Cod sursa (job #3251371) | Cod sursa (job #1938597) | Cod sursa (job #2473242) | Cod sursa (job #3124954) | Cod sursa (job #2969717)
#include <fstream>
#include <vector>
#include <set>
#define DIM 50001
#define INF 1000000001
using namespace std;
ifstream cin("distante.in");
ofstream cout("distante.out");
int n,p,x,y,c,d[DIM],t,f,m,ok,i,v[DIM];
vector<pair<int,int> > l[DIM];
set<pair<int,int> > s;
int main()
{
cin>>t;
for(f=1; f<=t; f++)
{
cin>>n>>m>>p;
ok=0;
for(i=1; i<=n; i++)
{
cin>>v[i];
l[i].clear();
}
for(i=1; i<=m; i++)
{
cin>>x>>y>>c;
l[x].push_back(make_pair(y,c));
l[y].push_back(make_pair(x,c));
}
for (int i=1; i<=n; i++)
{
d[i]=INF;
}
d[p]=0;
s.insert(make_pair(0,p));
while (!s.empty())
{
int nod=s.begin()->second;
s.erase(s.begin());
for (int i=0; i<l[nod].size(); i++)
{
int vec=l[nod][i].first;
int cost=l[nod][i].second;
if (d[nod]+cost<d[vec])
{
s.erase(make_pair(d[vec],vec));
d[vec]=d[nod]+cost;
s.insert(make_pair(d[vec],vec));
}
}
}
for (int i=1; i<=n; i++)
{
if(d[i]!=v[i])
{
ok=1;
break;
}
}
if(ok==1) cout<<"NU"<<'\n';
else cout<<"DA"<<'\n';
}
return 0;
}