Pagini recente » Cod sursa (job #3038007) | Cod sursa (job #2512576) | Cod sursa (job #1985716) | Cod sursa (job #149471) | Cod sursa (job #416173)
Cod sursa(job #416173)
#include<fstream>
using namespace std;
const int inf=2000000;
int a[100001][4],d[50001],n,k,ok=1,i,j,c,m,s,dist[100001];
ifstream f("datorii.in");
ofstream g("datorii.out");
int main()
{
int t,nr;
f>>t;
for (; t; t--)
{
f>>n>>m>>s;
nr=1;
memset (d,0,sizeof(d[0]));
memset (a,0,sizeof(a[0]));
for (i=1;i<=n;i++) f>>dist[i];
for(i=1;i<=n;i++) d[i]=inf;
d[s]=0;
for(i=1;i<=m;i++)
{ f>>a[i][1]>>a[i][2]>>a[i][3];
if(a[i][1]==s) d[a[i][2]]=a[i][3];
if (a[i][2]==s) d[a[i][1]]=a[i][3];
}
ok=1;
while(ok && nr<n)
{ok=0;
for(k=1;k<=m;k++)
{
i=a[k][1];j=a[k][2];c=a[k][3];
if(d[j]>d[i]+c){d[j]=d[i]+c;ok=1;}
if (d[i]>d[j]+c) {d[i]=d[j]+c; ok=1;}
}
nr++;
}
ok=1;
for(i=1;i<=n;i++)if(d[i]!=dist[i]) ok=0;
if (ok) g<<"DA\n";
else g<<"NU\n";
}
return 0;
}