Pagini recente » Cod sursa (job #3209852) | Cod sursa (job #230375) | Cod sursa (job #987792) | Cod sursa (job #987927) | Cod sursa (job #863829)
Cod sursa(job #863829)
#include <fstream>
#include <vector>
using namespace std;
vector < int > Cost;
int n,m,t,xs,ys,c,s;
bool ok;
ifstream f("distante.in");
ofstream g("distante.out");
int main(){
f >> t;
for(int i=1;i<=t;i++){
ok = 1;
f >> n >> m >> s;
Cost.resize(n+1);
for(int k=1;k<=n;k++)
f >> Cost[k];
if(Cost[s]!=0){
ok = 0;
for(int k = 1;k<=m;k++)
f >> xs >> ys >> c;
}
else{
for(int k=1;k<=m;k++){
f >> xs >> ys >> c;
if(Cost[ys] > Cost[xs] + c)
ok = 0;
} }
if(ok)
g << "DA" << '\n';
else g << "NU" << '\n';
}
f.close();
g.close();
return 0;
}