Cod sursa(job #2033955)
| Utilizator | Data | 7 octombrie 2017 12:10:14 | |
|---|---|---|---|
| Problema | Distante | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int d[50005],t;
void Rez()
{
int n,m,s,ok,x,y,c;
fin>>t;
for(int i=1;i<=t;i++)
{
ok=1;
fin>>n>>m>>s;
for(int i=1;i<=n;i++)
fin>>d[i];
if(d[s]!=0)
ok=0;
for(int j=1;j<=m;j++)
{
fin>>x>>y>>c;
if(((d[x]+c)<d[y]) || ((d[y]+c)<d[x]))
ok=0;
}
if(ok==0)
fout<<"NU\n";
else fout<<"DA\n";
}
}
int main()
{
Rez();
return 0;
}
