Cod sursa(job #2033489)
| Utilizator | Data | 6 octombrie 2017 21:20:50 | |
|---|---|---|---|
| Problema | Distante | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.65 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("distante.in");
ofstream fout("distante.out");
int dist[50005];
int main()
{
int i, N, M, S, T, x, y, c, ans;
fin >> T;
for(int test = 1; test <= T; test++){
ans = 1;
fin >> N >> M >> S;
for(i = 1; i <= N; i++)
fin >> dist[i];
if (dist[S] != 0) ans = 0;
for(i = 1; i <= M; i++)
{
fin >> x >> y >> c;
if(dist[x] + c < dist[y] || dist[y] + c < dist[x])
ans = 0;
}
fout << (ans == 1? "DA\n" : "NU\n");
}
fout.close();
return 0;
}
