Pagini recente » Cod sursa (job #297347) | Cod sursa (job #3134260) | Cod sursa (job #2513790) | Cod sursa (job #1956307) | Cod sursa (job #654336)
Cod sursa(job #654336)
#include <fstream>
#include <vector>
using namespace std;
vector < pair <int, int> > A[50100];
int t, n, m, s, cost[50100], X, Y;
int main()
{
ifstream f("distante.in");
ofstream g("distante.out");
for (f >> t; t > 0; --t)
{
f >> n >> m >> s;
for (int i = 1; i <= n; ++i)
f >> cost[i];
int ok = 1, nr = 0;
for (int i = 1; i <= m; ++i)
{
int c;
f >> X >> Y >> c;
if (cost[X] + c == cost[Y])
nr = 1;
else
if (cost[X] + c < cost[Y])
ok = 0;
}
if (ok && nr) g << "DA\n";
else g << "NU\n";
}
g.close();
return 0;
}