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 😎 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
Client's review of cooperation with Anton Trotsenko
Java/Python/C++ Graphs, brute forceWe have already worked together, everything works great, quickly and efficiently.
The previous review is also up to date.
Freelancer's review of cooperation with Ihor Petrenko
Java/Python/C++ Graphs, brute forceWe are working for the second time. Everything is great! I recommend cooperation!
-
Winning proposal1 day7 USD
568 28 2 Winning proposal1 day7 USD
I have already worked with you. I will work on C++ during the day.
I will be happy to cooperate!
-
1 day6 USD
108 1 day6 USD
Good day ! I do everything on C++. To discuss the details, write to ls.
-
1 day6 USD
160 5 1 1 day6 USD
Good day
I will perform the task according to the input conditions.
Writing in Private
-
2 days45 USD
68 1 0 2 days45 USD
Hello to you!
Interesting task, ready to fulfill in accordance with all requirements.
-
Есть ли какие-то ограничения на M и N? Какие ограничения по времени?
-
3 ≤ M, N ≤ 1000 в тест файлах максимум 1000.
Кол-во токенов каждого цвета, не больше 100.
Ограничения по времени не указаны, программа должна быть оптимизирована.
-
Current freelance projects in the category C & C++
Reverse engineering of console utilities for querying SSD controllers (Flash ID)1. Purpose of the work Extraction of the application programming interface (API) for interaction with SSD/NVMe controllers from the provided set of console utilities (Phison, Silicon Motion, Realtek, Maxiotek, Marvell, JMicron, etc.). The result should be working code in C/C++… C & C++, Desktop Apps ∙ 8 days 4 hours back ∙ 6 proposals |
Development of a Minecraft Java Seed Map / Seed Viewer for the websiteDevelopment of Minecraft Java Seed Map / Seed Viewer for the websiteProject Description A browser-based tool Minecraft Java Seed Map / Seed Viewer needs to be developed, which will work on our website and allow the user to enter a seed from Minecraft Java Edition and view an… C & C++, HTML & CSS ∙ 8 days 11 hours back ∙ 16 proposals |
Comparative analysis of the effectiveness of custom software (v2.2-field) and reference software (Meshtastic v2.x)
22 USD
Comparative analysis of the effectiveness of custom software (v2.2-field) and reference software (Meshtastic v2.x) on the identical hardware platform (ESP32 + SX1268, 2W) based on the criteria of range, throughput, link stability, and power consumption. Conduct tests with… C & C++, C# ∙ 12 days 18 hours back ∙ 3 proposals |
Pokrov