LASTSHOT - THE LAST SHOT
Tony Stark is on the mission to save the world from Loki's army so he spread N bombs in the enemy region. He spread the bombs in such a way that a bomb can be in range of another bomb i.e say bomb B1 is in range of bomb B2 , when bomb B2 explodes it will trigger bomb B1 and it also get explode but vice-versa might not be true because the bombs are of different of range. As he is running out of energy so he left with one shot To trigger the bomb .Now he ask Jarvis to find most appropriate bomb which he can trigger to make maximum impact.
Impact is basically number of bombs get explode.
Can you help Jarvis to do so?
First line contains two integer N and M denoting number of bombs and number of relation between the bombs.
1 ≤ n ≤ 10000
1 ≤ m ≤ 10000
Next M lines contain two integer A and B denoting bomb B is in range of bomb A.
1 ≤ A ≤ N
1 ≤ B ≤ N
A single line containing MAXIMUM IMPACT.
Input: 4 3 1 2 2 4 1 3 Output: 4
Input: 4 3 1 2 2 1 2 3 Output: 3
if 1 is in the range of 2 but it is not necessary 2 is in the range of 1 means directed .so every element of visited array to false after each dfs traversal .
Anyone used DP for this? Please tell your approach.
od Cajkanovica panadalje!
uuuuvek biiiiiiio hroooomi vuuuuk
AC in 1st go :)
Out of todo list after 3 months, thanks Dương Bảo. Didn't bother with defensive input here before as I was getting TLE and RE on the same code. Ignoring blank lines is not enough, you have to read integer by integer as there seem to be newlines between n and m or a and b.
Have to write a generator to read ints separately in python3 to get rid of NZECs. I think the input data may contain excess spaces or blank lines.
Can anyone help me understand why BFS would fail even though resetting visited array. dfs passes
sill mistake easy one dfs
Use idea of Scc's to solve it in O(N).