Project translated automatically. Log in or register, to view the original There is a training network consisting of squares.Some squares contain colored ghettos.There are three types of chips - red, green and blue.Each square contains no more than one ghetto.At the beginning of the test, the robot stands on one cell of the network, free of the jetons.In one step, a robot can move from its current square to any of the neighboring squares in the north, south, west or east directions, provided that these squares really exist.A robot cannot go beyond the network.The task of the robot is to move through the grid, collect the chips and return to the start cell.Any specific ghetto can be collected only when the robot stands on the square where the ghetto is located.The robot must collect at least one ghetto of each color.The task: Find the minimum number of steps that the robot must take to collect at least one ghetto of each color and return to the starting position.The entry data: M N divided by a col-in line gap and column and grid “”The point is a empty square. “X” (Title X) means the starting position of the robot. "R" (head R) represents a square with a red mark, “G” (Title G) represents a square with a green ghetto, “B” (Title B) represents a square with a blue ghetto.The example: and a) Input3 3 by G.B of X.R – Output 8 b) The Input6 5 by GGRG ... X... ... B...R B.RRR Output 14 c) 11 15 X...R... ........................ ........................ ........................ ...G...B ........................ ........................ ........................ ........................ ........................ R.G.B. ... output 28 Successfully developed program is considered: 1) Written on the listed in the name of the JAP project You have to pass 10 tests: 2) at the time of implementation of the program; 2) Correct implementation of the program Tests are ordinary text files.3) Plagiarism should not be * Reading is done with the standard input flow

Proposals 5 Rejected 3 Discussions 2