CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:MikaelE
Submission time:2024-10-28 22:10:28 +0200
Language:C++ (C++11)
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.13 s2details
#20ACCEPTED0.01 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.01 s2details
#23--2details
#24ACCEPTED0.02 s2details

Code

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

using namespace std;

int main(){
    int roomSize = 0;
    cin >> roomSize;

    string rooms;
    cin >> rooms;

    int robotIndex = 0;
    int robotCoinIndex = 1;
    bool robotFound = false;
    vector<int> coinIndex = {};
    for(int i = 0; i < roomSize; i++){
        if(rooms[i] == '*'){
            coinIndex.push_back(i);
            if(!robotFound) robotCoinIndex++;
            continue;
        }

        if(rooms[i] == 'R'){
            robotIndex = i;
            robotFound = true;
            robotCoinIndex--;
        }
    }

    long long steps = 0;
    int coinsTaken = 0;

    while(!coinIndex.empty()){
        if (robotCoinIndex == 0){
            int higherCoinIndex = 0;
            if(coinIndex.size() > (unsigned int)robotCoinIndex) higherCoinIndex = coinIndex.at(robotCoinIndex);

            coinIndex.erase(coinIndex.begin() + robotCoinIndex);
            steps += higherCoinIndex - robotIndex;
            robotIndex = higherCoinIndex;
            coinsTaken++;

            continue;
        }

        int lowerCoinIndex = coinIndex.at(robotCoinIndex - 1);
        int higherCoinIndex = 0;
        if(coinIndex.size() > (unsigned int)robotCoinIndex) higherCoinIndex = coinIndex.at(robotCoinIndex);

        int distanceToLower = robotIndex - lowerCoinIndex;
        if(higherCoinIndex){
            int distanceToHigher = higherCoinIndex - robotIndex;

            if(distanceToHigher == distanceToLower) break;

            if(distanceToHigher < distanceToLower){
                robotIndex = higherCoinIndex;
                coinIndex.erase(coinIndex.begin() + robotCoinIndex);
                steps += distanceToHigher;
                coinsTaken++;
                continue;
            }
        }

        robotIndex = lowerCoinIndex;
        coinIndex.erase(coinIndex.begin() + robotCoinIndex - 1);
        robotCoinIndex--;
        steps += distanceToLower;
        coinsTaken++;
    }

    cout << steps << " " << coinsTaken;

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