Build a graph where grid[i][j] is connected to all the four side-adjacent cells with weighted edge. the weight is 0 if the sign is pointing to the adjacent cell or 1 otherwise.

Do BFS from (0, 0) visit all edges with weight = 0 first. the answer is the distance to (m -1, n - 1).