Pagini recente » Cod sursa (job #1490851) | Cod sursa (job #2084055) | Cod sursa (job #2161483) | Cod sursa (job #2822063) | Cod sursa (job #2627117)
#include <bits/stdc++.h>
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
const int N=50010;
int t,n,m,s,x,y,c,d[N];
vector <pair<int,int>> v[N];
int main()
{
f>>t;
for(;t;t--)
{ bool da=true;
f>>n>>m>>s;
for(int i=1;i<=n;i++)
f>>d[i];
for(;m;m--)
{
f>>x>>y>>c;
v[x].push_back(make_pair(y,c));
v[y].push_back(make_pair(x,c));
if(d[x]>d[y]+c||d[y]>d[x]+c)
da=false;
}
if(da==false)
g<<"NU"<<'\n';
else
g<<"DA"<<'\n';
} return 0;
}