Oct 212017
 

What are the most interesting live tournaments going on this weekend? We have compiled them conveniently in one place. Do you fancy to watch Ivanchuk take on Wei Yi in Hoogeveen? Or the new season of the German Bundesliga? Maybe the European Women’s Rapid and Blitz Championships in Monaco? The start of a new Corsican Circuit, and the SPICE Cup in Saint Louis are also on tap. | Photo: Pascal Simon
What to watch this weekend
Source: Chess News

Oct 212017
 

PROBLEMhttp://www.spoj.com/problems/ROBOTGRI/

This was a tough nut!

Its a graph problem. Its actually a combination of 2 problems in one! I have voted it as hard and given it my recommendation.

I went through the following resources (none has the actual solution but all serve as hints) to finally come up with a solution for it:

https://www.cs.bu.edu/teaching/alg/maze/
https://www.hackerearth.com/practice/notes/dynamic-programming-problems-involving-grids/
http://www.geeksforgeeks.org/count-possible-paths-top-left-bottom-right-nxm-matrix/
http://www.geeksforgeeks.org/count-number-ways-reach-destination-maze/
https://www.youtube.com/watch?v=PwxGTHraMNg&feature=youtu.be
http://www.geeksforgeeks.org/applications-of-breadth-first-traversal/

SOLUTIONhttps://github.com/glassrose/CPP_Problem_Solving/commit/f1fc87fff5a967ab00d1afdd787239c24e75f7de
Tested and Accepted: http://www.spoj.com/status/ROBOTGRI,chandniverma/

Time complexity in the worst case: O(n^2 + E)
where n = number of rows (or columns) in the grid
and E = number of edges in the connected graph containing the starting cell ‘S’.

Space complexity: O(n^2)
Chandni Verma: [Problem3 SPOJ:ROBOTGRI] A problem for lovers of mazes!
Source: Planet Gnome