CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:Collectseal120
Submission time:2024-10-29 22:06:34 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#10.00 s1, 2details
#20.00 s1, 2details
#30.00 s1, 2details
#4ACCEPTED0.00 s1, 2details
#50.00 s1, 2details
#60.00 s1, 2details
#7ACCEPTED0.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#100.00 s1, 2details
#110.00 s1, 2details
#120.00 s2details
#130.00 s2details
#14ACCEPTED0.01 s2details
#150.00 s2details
#160.00 s2details
#170.01 s2details
#180.01 s2details
#19ACCEPTED0.25 s2details
#20ACCEPTED0.01 s2details
#210.01 s2details
#220.01 s2details
#230.01 s2details
#240.01 s2details

Code

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

using namespace std;

int main() {
    int room;
    cin >> room;

    string path;
    cin >> path;

    int robot_position = path.find('R');
    int start_pos = robot_position;
    int stepsTaken = 0;
    int coinsCollected = 0;


    vector<int> rightCoins;
    for(int i = robot_position + 1; i < room; i++){
        if(path[i] == '*'){
            rightCoins.push_back(i-robot_position);
        }
    }

    vector<int> leftCoins;
    for(int i = robot_position - 1; i >= 0; i--){
        if(path[i] == '*'){
            leftCoins.push_back(robot_position-i);
        }
    }

    while (true){
        if(leftCoins[0] + (robot_position - start_pos) == rightCoins[0] - (robot_position - start_pos)){
            break;
        }
        else if(leftCoins.empty() && rightCoins.empty()){
            break;
        }
        else if(rightCoins.empty() || leftCoins[0] + (robot_position - start_pos) < rightCoins[0] - (robot_position - start_pos)){
            int old_robot_position = robot_position;
            robot_position -= leftCoins[0] + (robot_position - start_pos);
            stepsTaken += abs(old_robot_position - robot_position);
            leftCoins.erase(leftCoins.begin()+0);
            coinsCollected++;
        }
        else if (leftCoins.empty()|| rightCoins[0] - (robot_position - start_pos) < leftCoins[0] + (robot_position - start_pos)){
            int old_robot_position = robot_position;
            robot_position += rightCoins[0] - (robot_position - start_pos);
            stepsTaken += abs(old_robot_position - robot_position);
            rightCoins.erase(rightCoins.begin()+0);
            coinsCollected++;
        }
    }
    cout << stepsTaken << " " << coinsCollected << endl;
    return 0;
}

Test details

Test 1

Group: 1, 2

Verdict:

input
1
R

correct output
0 0

user output
(empty)

Test 2

Group: 1, 2

Verdict:

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

correct output
0 0

user output
(empty)

Test 3

Group: 1, 2

Verdict:

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

correct output
12 5

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 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
(empty)

Test 6

Group: 1, 2

Verdict:

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

correct output
886 9

user output
(empty)

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:

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

correct output
999 999

user output
(empty)

Test 11

Group: 1, 2

Verdict:

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

correct output
999 999

user output
(empty)

Test 12

Group: 2

Verdict:

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

correct output
10971 999

user output
(empty)

Test 13

Group: 2

Verdict:

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

correct output
9999 999

user output
(empty)

Test 14

Group: 2

Verdict: ACCEPTED

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

correct output
18766 5000

user output
18766 5000

Test 15

Group: 2

Verdict:

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

correct output
9999 9999

user output
(empty)

Test 16

Group: 2

Verdict:

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

correct output
9999 9999

user output
(empty)

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

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)