Cod sursa(job #2703619)
| Utilizator | Data | 8 februarie 2021 20:30:35 | |
|---|---|---|---|
| Problema | Distante | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include <bits/stdc++.h>
#define NMAX 50001
using namespace std;
ifstream in("distante.in");
ofstream out("distante.out");
int v[NMAX];
int main()
{
int q;
in>>q;
for(int t=1;t<=q;t++)
{
int n,m,s;
bool ok=true;
in>>n>>m>>s;
for(int i=1;i<=n;i++)
in>>v[i];
for(int i=1;i<=m && ok;i++)
{
int a,b,c;
in>>a>>b>>c;
if(max(v[a]-v[b],v[b]-v[a])>c)
ok=false;
}
if(!ok || v[s]!=0)
out<<"NU\n";
else
out<<"DA\n";
}
return 0;
}
