Pagini recente » Cod sursa (job #1299681) | Cod sursa (job #1873078) | Cod sursa (job #345178) | Cod sursa (job #2225243) | Cod sursa (job #886130)
Cod sursa(job #886130)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
#define NMAX 50005
int n,m,drum[NMAX],sol[NMAX],start;
vector <int> v[NMAX],cost[NMAX];
bool ever[NMAX],viz[NMAX];
void read()
{
fin>>n>>m>>start;
for(int i=1;i<=n;i++)
fin>>sol[i];
int a,b,c;
for(int i=1;i<=m;i++)
{
fin>>a>>b>>c;
v[a].push_back(b);
cost[a].push_back(c);
}
}
void clear2()
{
for(int i=1;i<=n;i++)
{
v[i].clear();
cost[i].clear();
// fout << "v[" << i << "]: " << v[i].size() << "\n";
drum[i]=viz[i]=ever[i]=0;
}
}
void tipar2()
{
for(int i=1;i<=n;i++)
{
for(int j=0;j<v[i].size();j++)
{
fout<<i<<" "<<v[i][j]<<" "<<cost[i][j]<<endl;
}
}
}
bool bfs()
{
queue <int> qnod;
int nod;
qnod.push(start);
while(!qnod.empty())
{
nod=qnod.front();
qnod.pop();
ever[nod]=true;
viz[nod]=false;
for(int i=0;i<v[nod].size();i++)
{
if(drum[v[nod][i]] > drum[nod]+cost[nod][i] || ever[v[nod][i]]== false)
{
ever[v[nod][i]]=true;
drum[v[nod][i]] = drum[nod]+cost[nod][i];
if(viz[v[nod][i]] == false)
qnod.push(v[nod][i]);
viz[v[nod][i]]=true;
if(drum[v[nod][i]] < sol[v[nod][i]])
{
// fout<<"*"<<v[nod][i]<<endl;
return 0;
}
}
}
}
return 1;
}
void tipar()
{
for(int i=1;i<=n;i++)
fout<<drum[i]<<" "<<sol[i]<<endl;
}
bool check()
{
for(int i=1;i<=n;i++)
if(drum[i]!=sol[i]) return 0;
return 1;
}
int main()
{
int teste;
fin>>teste;
for(int i=1;i<=teste;i++)
{
read();
if(bfs() == 0)
{
fout<<"NU\n";
// tipar();
clear2();
continue;
}
// tipar();
if(check()==0)
{
fout<<"NU\n";
//tipar();
clear2();
continue;
}
fout<<"DA\n";
// tipar();
clear2();
}
}