CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:onniK
Submission time:2024-11-06 13:14:52 +0200
Language:C++ (C++17)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#2ACCEPTED0.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
#110.00 s1, 2details
#120.00 s2details
#130.00 s2details
#140.00 s2details
#150.00 s2details
#160.00 s2details
#17ACCEPTED0.01 s2details
#180.01 s2details
#190.01 s2details
#20ACCEPTED0.01 s2details
#210.01 s2details
#220.01 s2details
#230.01 s2details
#240.01 s2details

Code

#include <iostream>
#include <string>
#include <vector>
#include <climits>
using namespace std;

int main() {
    int n;
    string rooms;
    cin >> n >> rooms;

    int robot_position = rooms.find('R');
    int steps = 0, coins = 0;

    vector<int> left_dist(n, INT_MAX), right_dist(n, INT_MAX);

    int last_coin = -1;
    for (int i = 0; i < n; i++) {
        if (rooms[i] == '*') {
            last_coin = i;
        }
        if (last_coin != -1) {
            left_dist[i] = i - last_coin;
        }
    }

    last_coin = -1;
    for (int i = n - 1; i >= 0; i--) {
        if (rooms[i] == '*') {
            last_coin = i;
        }
        if (last_coin != -1) {
            right_dist[i] = last_coin - i;
        }
    }

    while (true) {
        int left_distance = (robot_position - 1 >= 0) ? left_dist[robot_position] : INT_MAX;
        int right_distance = (robot_position + 1 < n) ? right_dist[robot_position] : INT_MAX;

        if (left_distance < right_distance) {
            steps += left_distance;
            robot_position -= left_distance;
        } else if (right_distance < left_distance) {
            steps += right_distance;
            robot_position += right_distance;
        } else {
            break;
        }

        coins++;
        rooms[robot_position] = '.';

        left_dist[robot_position] = INT_MAX;
        right_dist[robot_position] = INT_MAX;
    }

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


//6.11.2024 11:22 Onni Kolehmaienen
// Syöte esimerkki:
//20
//**.*......*.R*...*..
//Tuloste:
//4 2

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:

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

correct output
12 5

user output
2 1

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
148 1

Test 6

Group: 1, 2

Verdict:

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

correct output
886 9

user output
159 1

Test 7

Group: 1, 2

Verdict:

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

correct output
1287 400

user output
2 1

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

Test 11

Group: 1, 2

Verdict:

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

correct output
999 999

user output
1 1

Test 12

Group: 2

Verdict:

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

correct output
10971 999

user output
3 1

Test 13

Group: 2

Verdict:

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

correct output
9999 999

user output
5 1

Test 14

Group: 2

Verdict:

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

correct output
18766 5000

user output
1 1

Test 15

Group: 2

Verdict:

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

correct output
9999 9999

user output
1 1

Test 16

Group: 2

Verdict:

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

correct output
9999 9999

user output
1 1

Test 17

Group: 2

Verdict: ACCEPTED

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

correct output
0 0

user output
0 0

Test 18

Group: 2

Verdict:

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

correct output
299934 10000

user output
8 1

Test 19

Group: 2

Verdict:

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

correct output
299998 100000

user output
1 1

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
70142 1

Test 22

Group: 2

Verdict:

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

correct output
199982 5000

user output
66 1

Test 23

Group: 2

Verdict:

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

correct output
199999 199999

user output
1 1

Test 24

Group: 2

Verdict:

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

correct output
199999 199999

user output
1 1