CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:osmukka
Submission time:2024-11-04 13:08:46 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#20.00 s1, 2details
#30.00 s1, 2details
#4ACCEPTED0.00 s1, 2details
#50.00 s1, 2details
#60.00 s1, 2details
#70.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#100.00 s1, 2details
#11ACCEPTED0.00 s1, 2details
#120.00 s2details
#130.00 s2details
#140.01 s2details
#150.01 s2details
#16ACCEPTED0.00 s2details
#170.01 s2details
#180.01 s2details
#190.01 s2details
#200.01 s2details
#210.01 s2details
#220.01 s2details
#230.01 s2details
#240.01 s2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:35:9: warning: variable 'middle' set but not used [-Wunused-but-set-variable]
   35 |     int middle;
      |         ^~~~~~
input/code.cpp:40:65: warning: 'robot_index' may be used uninitialized in this function [-Wmaybe-uninitialized]
   40 |         d_right = robot_index < coin_rooms[coin_rooms.size()-1] ? coin_rooms[robot_index+1]-coin_rooms[robot_index] : 999999;
      |                   ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Code

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

int main()
{
    int amount;
    char rooms[50000];
    int robot_index;
    int steps = 0;
    int coins = 0;

    std::cin >> amount;
    std::cin >> rooms;

    std::vector<int> coin_rooms;
    for(int i = 0; i < amount; i++)
    {
        switch(rooms[i])
        {
            case '*':
                coin_rooms.push_back(i);
                break;
            case 'R':
                coin_rooms.push_back(i);
                robot_index = coin_rooms.size()-1;
                break;
            default:
                break;
        }
    }
    
    int d_left;
    int d_right;
    int middle;
    for(int i = 0; i < amount; i++)
    {
        middle = coin_rooms[robot_index];
        d_left = robot_index > 0 ? coin_rooms[robot_index]-coin_rooms[robot_index-1] : 999999;
        d_right = robot_index < coin_rooms[coin_rooms.size()-1] ? coin_rooms[robot_index+1]-coin_rooms[robot_index] : 999999;
        
        if(d_left < d_right)
        {
            steps += d_left;
            coin_rooms.erase(coin_rooms.begin()+robot_index);
            robot_index--;
        }
        else if(d_right < d_left)
        {
            steps += d_right;
            coin_rooms.erase(coin_rooms.begin()+robot_index);
        }
        else if(d_left == d_right)
        {
            break;
        }
        coins++;
    }
    
    std::cout << steps << ' ' << coins << std::endl;
    
    return 0;
    
}

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:

input
10
...R......

correct output
0 0

user output
-3 1

Test 3

Group: 1, 2

Verdict:

input
10
**.R...***

correct output
12 5

user output
12 6

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
10
***R******

correct output
0 0

user output
0 0

Test 5

Group: 1, 2

Verdict:

input
1000
R................................

correct output
947 9

user output
947 10

Test 6

Group: 1, 2

Verdict:

input
1000
.................................

correct output
886 9

user output
(empty)

Error:
code: malloc.c:2617: sysmalloc: Assertion `(old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)' failed.

Test 7

Group: 1, 2

Verdict:

input
1000
.....*..*....**..**..*......*....

correct output
1287 400

user output
298 1000

Error:
munmap_chunk(): invalid pointer

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:

input
1000
R*****************************...

correct output
999 999

user output
999 1000

Test 11

Group: 1, 2

Verdict: ACCEPTED

input
1000
******************************...

correct output
999 999

user output
999 999

Test 12

Group: 2

Verdict:

input
10000
.......**........*...........*...

correct output
10971 999

user output
10971 1000

Test 13

Group: 2

Verdict:

input
10000
*..*....*......*.....*..*........

correct output
9999 999

user output
(empty)

Error:
malloc(): invalid size (unsorted)

Test 14

Group: 2

Verdict:

input
10000
*.*.*...**.*...*....**.**.**.....

correct output
18766 5000

user output
(empty)

Error:
malloc(): invalid next size (unsorted)

Test 15

Group: 2

Verdict:

input
10000
R*****************************...

correct output
9999 9999

user output
9999 10000

Test 16

Group: 2

Verdict: ACCEPTED

input
10000
******************************...

correct output
9999 9999

user output
9999 9999

Test 17

Group: 2

Verdict:

input
200000
.................................

correct output
0 0

user output
(empty)

Test 18

Group: 2

Verdict:

input
200000
.................................

correct output
299934 10000

user output
(empty)

Test 19

Group: 2

Verdict:

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

correct output
299998 100000

user output
(empty)

Test 20

Group: 2

Verdict:

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

correct output
0 0

user output
(empty)

Test 21

Group: 2

Verdict:

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

correct output
133765 3

user output
(empty)

Test 22

Group: 2

Verdict:

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

correct output
199982 5000

user output
(empty)

Test 23

Group: 2

Verdict:

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

correct output
199999 199999

user output
(empty)

Test 24

Group: 2

Verdict:

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

correct output
199999 199999

user output
(empty)