CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:Verlet
Submission time:2024-11-01 21:57:57 +0200
Language:C++ (C++17)
Status:READY
Result:30
Feedback
groupverdictscore
#1ACCEPTED30
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#2ACCEPTED0.00 s1, 2details
#3ACCEPTED0.00 s1, 2details
#4ACCEPTED0.00 s1, 2details
#5ACCEPTED0.00 s1, 2details
#6ACCEPTED0.00 s1, 2details
#7ACCEPTED0.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#10ACCEPTED0.00 s1, 2details
#11ACCEPTED0.00 s1, 2details
#12ACCEPTED0.00 s2details
#13ACCEPTED0.00 s2details
#14ACCEPTED0.01 s2details
#15ACCEPTED0.01 s2details
#16ACCEPTED0.00 s2details
#17ACCEPTED0.01 s2details
#18ACCEPTED0.01 s2details
#19ACCEPTED0.12 s2details
#20ACCEPTED0.01 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.01 s2details
#23--2details
#24ACCEPTED0.01 s2details

Compiler report

input/code.cpp: In function 'int findNearestCoin(std::vector<int>&, int, int)':
input/code.cpp:12:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |   if (robotIndex + 1 < coins.size()) coin2 = coins[robotIndex + 1];
      |       ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:58:5: warning: 'robotPosition' may be used uninitialized in this function [-Wmaybe-uninitialized]
   58 |     if (target < robotPosition)
      |     ^~

Code

#include <iostream>
#include <string>
#include <vector>

using namespace std;

int findNearestCoin(vector<int> & coins, int robotPosition, int robotIndex)
{
  int coin1 = -1, coin2 = -1;

  if (robotIndex >= 0) coin1 = coins[robotIndex];
  if (robotIndex + 1 < coins.size()) coin2 = coins[robotIndex + 1];

  if (coin1 == -1 && coin2 == -1) return -1;

  if (coin1 == -1) return coin2;
  if (coin2 == -1) return coin1;

  int distanceCoin1 = robotPosition - coin1;
  int distanceCoin2 = coin2 - robotPosition;

  if (distanceCoin1 == distanceCoin2) return -1;

  if (distanceCoin1 < distanceCoin2) return coin1;
  
  return coin2;
}

int main()
{
  int numberOfRooms, robotPosition, robotIndex;

  string buildingDescription;

  cin >> numberOfRooms >> buildingDescription;

  vector<int> coins;

  for (int i = 0; i < numberOfRooms; i++)
  {
    if (buildingDescription[i] == '*') coins.push_back(i);
    else if (buildingDescription[i] == 'R')
    {
      robotPosition = i;
      robotIndex = coins.size() - 1;
    }
  }

  int numberOfSteps = 0;
  int numberOfCoins = 0;

  while (true)
  {
    int target = findNearestCoin(coins, robotPosition, robotIndex);

    if (target == -1) break;

    if (target < robotPosition)
    {
      coins.erase(coins.begin() + robotIndex);
      robotIndex--;
    }
    else
    {
      coins.erase(coins.begin() + robotIndex + 1);
    }

    numberOfSteps += abs(target - robotPosition);
    numberOfCoins++;

    robotPosition = target;
  }

  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: ACCEPTED

input
200000
**.***....**..**.....***.*..*....

correct output
299998 100000

user output
299998 100000

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:

input
200000
R*****************************...

correct output
199999 199999

user output
(empty)

Test 24

Group: 2

Verdict: ACCEPTED

input
200000
******************************...

correct output
199999 199999

user output
199999 199999