Cod sursa(job #2779187)
Utilizator | Data | 2 octombrie 2021 20:42:36 | |
---|---|---|---|
Problema | Distante | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include<fstream>
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int d[50003],i,j,k,n,m,s,t,o;
int main()
{
f>>t;
for(;t;--t) {
f>>n>>m>>s;
for(i=1;i<=n;++i)
f>>d[i];
o=1;
if(d[s])
o=0;
for(;m;--m) {
f>>i>>j>>k;
if(d[i]+k<d[j]||d[j]+k<d[i])
o=0;
}
if(o)
g<<"DA\n";
else
g<<"NU\n";
}
return 0;
}