Answer to Question #44995 in C for Palak

Question

There are N nodes in a graph. The graph is unidirectional with M edges. Of these N nodes in the graph, there are K nodes which are important nodes. Given initial position I, within this graph, the task is to find out, if all K nodes are reachable without travelling a distance greater than V from I.

Input Format:

Input consists of:
First line starts with N, M, I, K and V
Next M lines follow; each contains (Source, Destination, and Distance).
Next line contains K spaced important nodes

Output Format:

Print "Yes" if all K nodes are reachable without travelling a distance greater than V else print "No"

Constraints:
1<=N<=350

1<=M<=N*(N-1)

1<=K<=N

1<=I<=N

0<=V<=500

1<=Source<=N

1<=Destination<=N

1<=Distance<=200


Sample Input and Output

SNo. Input Output
1
3 3 1 2 10
1 2 5
2 3 5
1 3 12
2 3


Yes



Explanation:

Locations 2 is directly reachable through an edge of weight (distance) 5 units.

Node 3 is reachable through edges 1-> 2 and 2-> 3 of weights 5 units each.

Hence node 3 is reachable fr