CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:MituFin
Submission time:2024-11-09 19:12:31 +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
#40.00 s1, 2details
#50.00 s1, 2details
#60.00 s1, 2details
#70.00 s1, 2details
#80.00 s1, 2details
#90.00 s1, 2details
#100.00 s1, 2details
#110.00 s1, 2details
#120.00 s2details
#130.00 s2details
#140.00 s2details
#150.00 s2details
#160.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:14:9: warning: 'coins' may be used uninitialized [-Wmaybe-uninitialized]
   14 |     int coins;
      |         ^~~~~
input/code.cpp:66:19: warning: 'steps' may be used uninitialized in this function [-Wmaybe-uninitialized]
   66 |             steps += coinsOnLeft[indexLeft] + robotDisplacement;
      |             ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:44:19: warning: 'robotDisplacement' may be used uninitialized in this function [-Wmaybe-uninitialized]
   44 |             steps -= robotDisplacement;
      |             ~~~~~~^~~~~~~~~~~~~~~~~~~~

Code

#include <iostream>
using namespace std;
// input looks like this:
// 6
// *..R**
int main() {
    int rooms;
    string roomlayout;
    cin >> rooms;
    cin >> roomlayout;
    int robotSpot = roomlayout.find("R");
    int robotDisplacement;

    int coins;
    int steps;
    int coinsOnLeft[robotSpot + 1] = {0};
    int indexLeft = 0;
    int coinsOnRight[rooms - robotSpot - 1] = {0};
    int indexRight = 0;
    int totalCoinsOnMap = 0;

    for (int i = 1; i <= robotSpot; i++) {
        if (roomlayout[robotSpot - i] == '*') {
            coinsOnLeft[indexLeft] = i;
            //cout << coinsOnLeft[indexLeft] << " list left\n";
            indexLeft += 1;
            totalCoinsOnMap += 1;
        }
    } 
    for (int i = 1; i <= rooms - robotSpot - 1; i++) {
        if (roomlayout[robotSpot + i] == '*') {
            coinsOnRight[indexRight] = i;
            indexRight += 1;
            totalCoinsOnMap += 1;
        }
    }

    indexLeft = 0, indexRight = 0;
    //cout << coinsOnLeft[indexLeft] << " " << coinsOnRight[indexRight] << "what\n";
    while (true) {
        //cout << "test" << coinsOnLeft[indexLeft] << " " << coinsOnRight[indexRight] << " H\n";
        if (coinsOnLeft[indexLeft] == 0 && coinsOnRight[indexRight] != 0) {
            //cout << coins << " " << steps << " no coins on left\n";
            steps -= robotDisplacement;
            while (true) {
                coins += 1;
                indexRight += 1;
                if (coinsOnRight[indexRight] == 0) break;
            }
            steps += coinsOnRight[indexRight - 1];
            break;

        } else if (coinsOnLeft[indexLeft] != 0 && coinsOnRight[indexRight] == 0) {
            //cout << coins << " " << steps << " " << robotDisplacement << " no coins on right\n";
            steps += robotDisplacement;
            while (true) {
                coins += 1;
                indexLeft += 1;
                if (coinsOnLeft[indexLeft] == 0) break;
            }
            steps += coinsOnLeft[indexLeft - 1];
            break;

        } else if (coinsOnLeft[indexLeft] + robotDisplacement < coinsOnRight[indexRight] - robotDisplacement) {
            //cout << coins << " " << steps << " coin grabbed from left\n";
            steps += coinsOnLeft[indexLeft] + robotDisplacement;
            coins += 1;
            robotDisplacement = -coinsOnLeft[indexLeft];
            indexLeft += 1;

        } else if (coinsOnLeft[indexLeft] + robotDisplacement > coinsOnRight[indexRight] - robotDisplacement) {
            //cout << coins << " " << steps << " coin grabbed from right\n";
            steps += coinsOnRight[indexRight] - robotDisplacement;
            coins += 1;
            robotDisplacement = coinsOnRight[indexRight];
            indexRight += 1;
            
        } else break;
        if (coins == totalCoinsOnMap) {
            //cout << "break";
            break;
        }
    }

    cout << steps << " " << coins;
   
    return 0;
}

Test details

Test 1

Group: 1, 2

Verdict:

input
1
R

correct output
0 0

user output
1431654848 0

Test 2

Group: 1, 2

Verdict:

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

correct output
0 0

user output
1431654848 0

Test 3

Group: 1, 2

Verdict:

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

correct output
12 5

user output
1431654860 5

Test 4

Group: 1, 2

Verdict:

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

correct output
0 0

user output
1431654848 0

Test 5

Group: 1, 2

Verdict:

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

correct output
947 9

user output
1431655795 9

Test 6

Group: 1, 2

Verdict:

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

correct output
886 9

user output
1431654848 0

Test 7

Group: 1, 2

Verdict:

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

correct output
1287 400

user output
1431656135 400

Test 8

Group: 1, 2

Verdict:

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

correct output
0 0

user output
1431654848 0

Test 9

Group: 1, 2

Verdict:

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

correct output
0 0

user output
1431654848 0

Test 10

Group: 1, 2

Verdict:

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

correct output
999 999

user output
1431676693 1000

Test 11

Group: 1, 2

Verdict:

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

correct output
999 999

user output
1431654848 0

Test 12

Group: 2

Verdict:

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

correct output
10971 999

user output
1431665819 999

Test 13

Group: 2

Verdict:

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

correct output
9999 999

user output
1431654848 0

Test 14

Group: 2

Verdict:

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

correct output
18766 5000

user output
1431673614 5000

Test 15

Group: 2

Verdict:

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

correct output
9999 9999

user output
1431676693 10000

Test 16

Group: 2

Verdict:

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

correct output
9999 9999

user output
1431654848 0

Test 17

Group: 2

Verdict:

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

correct output
0 0

user output
1431654848 0

Test 18

Group: 2

Verdict:

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

correct output
299934 10000

user output
1431954782 10000

Test 19

Group: 2

Verdict:

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

correct output
299998 100000

user output
1431954846 100000

Test 20

Group: 2

Verdict:

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

correct output
0 0

user output
1431654848 0

Test 21

Group: 2

Verdict:

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

correct output
133765 3

user output
1431788613 3

Test 22

Group: 2

Verdict:

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

correct output
199982 5000

user output
1431854830 5000

Test 23

Group: 2

Verdict:

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

correct output
199999 199999

user output
1431676693 200000

Test 24

Group: 2

Verdict:

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

correct output
199999 199999

user output
1431654848 0