Cod sursa(job #2779185)
Utilizator | Data | 2 octombrie 2021 20:37:49 | |
---|---|---|---|
Problema | Distante | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream F("distante.in");
ofstream G("distante.out");
int t,i,j,c,n,m,s,l,d[50001],k;
int main()
{
F>>t;
while(t--) {
F>>n>>m>>s;
for(i=1;i<=n;++i)
scanf("%d",d+i);
for(l=d[s]?0:1,k=0;k<m;++k) {
F>>i>>j>>c;
if(d[i]+c<d[j]||d[j]+c<d[i])
l=0;
}
G<<(l?"DA":"NU")<<"\n";
}
return 0;
}