Cod sursa(job #2033948)
| Utilizator | Data | 7 octombrie 2017 12:06:19 | |
|---|---|---|---|
| Problema | Distante | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.67 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int T;
int n, m, s;
bool ok;
int a[50005];
int main()
{
fin >> T;
int x, y, c;
for(int q = 1; q <= T; q ++)
{
ok = 1;
fin >> n >> m >> s;
for(int i = 1; i <= n; i++)
fin >> a[i];
if(a[s] != 0)ok = 0;
else
for(int i = 1; i <= m; i++)
{
fin >> x >> y >> c;
if(abs(a[x] - a[y]) > c)
ok = 0;
}
if(ok == 0)fout << "NU\n";
else fout << "DA\n";
}
return 0;
}
