| Task: | Robotti | 
| Sender: | Verlet | 
| Submission time: | 2024-11-01 21:31:11 +0200 | 
| Language: | C++ (C++17) | 
| Status: | READY | 
| Result: | 30 | 
| group | verdict | score | 
|---|---|---|
| #1 | ACCEPTED | 30 | 
| #2 | TIME LIMIT EXCEEDED | 0 | 
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | 1, 2 | details | 
| #2 | ACCEPTED | 0.00 s | 1, 2 | details | 
| #3 | ACCEPTED | 0.00 s | 1, 2 | details | 
| #4 | ACCEPTED | 0.00 s | 1, 2 | details | 
| #5 | ACCEPTED | 0.00 s | 1, 2 | details | 
| #6 | ACCEPTED | 0.00 s | 1, 2 | details | 
| #7 | ACCEPTED | 0.00 s | 1, 2 | details | 
| #8 | ACCEPTED | 0.00 s | 1, 2 | details | 
| #9 | ACCEPTED | 0.00 s | 1, 2 | details | 
| #10 | ACCEPTED | 0.00 s | 1, 2 | details | 
| #11 | ACCEPTED | 0.00 s | 1, 2 | details | 
| #12 | ACCEPTED | 0.01 s | 2 | details | 
| #13 | ACCEPTED | 0.01 s | 2 | details | 
| #14 | ACCEPTED | 0.02 s | 2 | details | 
| #15 | ACCEPTED | 0.04 s | 2 | details | 
| #16 | ACCEPTED | 0.04 s | 2 | details | 
| #17 | ACCEPTED | 0.01 s | 2 | details | 
| #18 | ACCEPTED | 0.68 s | 2 | details | 
| #19 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #20 | ACCEPTED | 0.01 s | 2 | details | 
| #21 | ACCEPTED | 0.01 s | 2 | details | 
| #22 | ACCEPTED | 0.35 s | 2 | details | 
| #23 | TIME LIMIT EXCEEDED | -- | 2 | details | 
| #24 | TIME LIMIT EXCEEDED | -- | 2 | details | 
Compiler report
input/code.cpp: In function 'int main()':
input/code.cpp:83:33: warning: 'robot' may be used uninitialized in this function [-Wmaybe-uninitialized]
   83 |     numberOfSteps += abs(target - robot);
      |                          ~~~~~~~^~~~~~~Code
#include <iostream>
#include <string>
using namespace std;
int findNearestCoin(int * building, int numberOfRooms, int robot)
{
  int coin1 = -1;
  for (int i = robot - 1; i >= 0; i--)
  {
    if (building[i] == 1)
    {
      coin1 = i;
      break;
    }
  }
  int coin2 = -1;
  for (int i = robot + 1; i < numberOfRooms; i++)
  {
    if (building[i] == 1)
    {
      coin2 = i;
      break;
    }
  }
  //cout << "    " << coin1 << " " << coin2;
  if (coin1 == -1 && coin2 == -1) return -1;
  if (coin1 == -1) return coin2;
  if (coin2 == -1) return coin1;
  int distanceCoin1 = robot - coin1;
  int distanceCoin2 = coin2 - robot;
  if (distanceCoin1 == distanceCoin2) return -1;
  if (distanceCoin1 < distanceCoin2) return coin1;
  
  return coin2;
}
int main()
{
  int numberOfRooms, robot;
  string buildingDescription;
  cin >> numberOfRooms >> buildingDescription;
  int building[numberOfRooms];
  for (int i = 0; i < numberOfRooms; i++)
  {
    char room = buildingDescription[i];
    building[i] = 0;
    if (room == '*') building[i] = 1;
    else if (room == 'R') robot = i;
  }
  int numberOfSteps = 0;
  int numberOfCoins = 0;
  while (true)
  {
    // for (int i = 0; i < numberOfRooms; i++)
    // {
    //   if (i == robot) cout << 'R';
    //   else if (building[i] == 1) cout << '*';
    //   else if (building[i] == 0) cout << '.';
    // }
    int target = findNearestCoin(building, numberOfRooms, robot);
    //cout << "    " << target << endl;
    if (target == -1) break;
    numberOfSteps += abs(target - robot);
    numberOfCoins++;
    robot = target;
    building[target] = 0;
  }
  cout << numberOfSteps << " " << numberOfCoins << endl;
}Test details
Test 1
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 1 R  | 
| correct output | 
|---|
| 0 0 | 
| user output | 
|---|
| 0 0 | 
Test 2
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 10 ...R......  | 
| correct output | 
|---|
| 0 0 | 
| user output | 
|---|
| 0 0 | 
Test 3
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 10 **.R...***  | 
| correct output | 
|---|
| 12 5 | 
| user output | 
|---|
| 12 5 | 
Test 4
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 10 ***R******  | 
| correct output | 
|---|
| 0 0 | 
| user output | 
|---|
| 0 0 | 
Test 5
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 1000 R................................  | 
| correct output | 
|---|
| 947 9 | 
| user output | 
|---|
| 947 9 | 
Test 6
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 1000 .................................  | 
| correct output | 
|---|
| 886 9 | 
| user output | 
|---|
| 886 9 | 
Test 7
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 1000 .....*..*....**..**..*......*....  | 
| correct output | 
|---|
| 1287 400 | 
| user output | 
|---|
| 1287 400 | 
Test 8
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 1000 ************.*****************...  | 
| correct output | 
|---|
| 0 0 | 
| user output | 
|---|
| 0 0 | 
Test 9
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 1000 ******************************...  | 
| correct output | 
|---|
| 0 0 | 
| user output | 
|---|
| 0 0 | 
Test 10
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 1000 R*****************************...  | 
| correct output | 
|---|
| 999 999 | 
| user output | 
|---|
| 999 999 | 
Test 11
Group: 1, 2
Verdict: ACCEPTED
| input | 
|---|
| 1000 ******************************...  | 
| correct output | 
|---|
| 999 999 | 
| user output | 
|---|
| 999 999 | 
Test 12
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 10000 .......**........*...........*...  | 
| correct output | 
|---|
| 10971 999 | 
| user output | 
|---|
| 10971 999 | 
Test 13
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 10000 *..*....*......*.....*..*........  | 
| correct output | 
|---|
| 9999 999 | 
| user output | 
|---|
| 9999 999 | 
Test 14
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 10000 *.*.*...**.*...*....**.**.**.....  | 
| correct output | 
|---|
| 18766 5000 | 
| user output | 
|---|
| 18766 5000 | 
Test 15
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 10000 R*****************************...  | 
| correct output | 
|---|
| 9999 9999 | 
| user output | 
|---|
| 9999 9999 | 
Test 16
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 10000 ******************************...  | 
| correct output | 
|---|
| 9999 9999 | 
| user output | 
|---|
| 9999 9999 | 
Test 17
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 200000 .................................  | 
| correct output | 
|---|
| 0 0 | 
| user output | 
|---|
| 0 0 | 
Test 18
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 200000 .................................  | 
| correct output | 
|---|
| 299934 10000 | 
| user output | 
|---|
| 299934 10000 | 
Test 19
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 200000 **.***....**..**.....***.*..*....  | 
| correct output | 
|---|
| 299998 100000 | 
| user output | 
|---|
| (empty) | 
Test 20
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 200000 ******************************...  | 
| correct output | 
|---|
| 0 0 | 
| user output | 
|---|
| 0 0 | 
Test 21
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 200000 R................................  | 
| correct output | 
|---|
| 133765 3 | 
| user output | 
|---|
| 133765 3 | 
Test 22
Group: 2
Verdict: ACCEPTED
| input | 
|---|
| 200000 R................................  | 
| correct output | 
|---|
| 199982 5000 | 
| user output | 
|---|
| 199982 5000 | 
Test 23
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 200000 R*****************************...  | 
| correct output | 
|---|
| 199999 199999 | 
| user output | 
|---|
| (empty) | 
Test 24
Group: 2
Verdict: TIME LIMIT EXCEEDED
| input | 
|---|
| 200000 ******************************...  | 
| correct output | 
|---|
| 199999 199999 | 
| user output | 
|---|
| (empty) | 
