Pagini recente » Cod sursa (job #2785454) | Cod sursa (job #1701525) | Cod sursa (job #1392990) | Cod sursa (job #2397643) | Cod sursa (job #857488)
Cod sursa(job #857488)
#include<fstream>
#include<vector>
#define NMAX 50010
#define INF 100000010
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
struct muchie
{
int nod, cost;
};
int T, n, m, S, d[NMAX], sol[NMAX];
vector<muchie> a[NMAX];
void Citeste()
{
int i, x, y;
muchie z;
char c[40];
f>>n>>m>>S;
for (i=1; i<=n; ++i)
{
f>>sol[i];
a[i].clear();
d[i]=INF;
}
for (i=1; i<=m; ++i)
{
f>>x>>y>>z.cost;
z.nod=y; a[x].push_back(z);
z.nod=x; a[y].push_back(z);
}
}
void Solve()
{
int i, x, lg, nr=0, p, u, c[NMAX];
muchie z;
d[S]=0;
p=u=1;
c[1]=S;
if (!sol[S]) ++nr;
while (p<=u)
{
x=c[p]; ++p;
for (i=0; i<a[x].size(); ++i)
{
z=a[x][i];
lg=z.cost+d[x];
if (lg==sol[z.nod] && d[z.nod]!=sol[z.nod])
{
d[z.nod]=lg; ++nr;
c[++u]=z.nod;
}
}
}
if (nr==n) g<<"DA\n";
else g<<"NU\n";
}
int main()
{
f>>T;
while (T--)
{
// Initializeaza();
Citeste();
Solve();
// Scrie();
}
f.close();
g.close();
return 0;
}