Cod sursa(job #2400648)
Utilizator | Data | 8 aprilie 2019 23:10:05 | |
---|---|---|---|
Problema | Distante | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("distante.in");
ofstream g("distante.out");
int main()
{
int m,n,s,h=1,t,v[100005],x,y,c;
f>>t;
while(t--)
{
f>>n>>m>>s;
for(int i=1;i<=n;++i)
f>>v[i];
if(v[s])
h=0;
for(int i=1;i<=m;++i)
{
f>>x>>y>>c;
if(h&&(v[x]+c<v[y]||v[y]+c<v[x]))
h=0;
}
if(h)
g<<"DA\n";
else
g<<"NU\n";
}
}