CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:Sukarth
Submission time:2024-11-02 14:27:34 +0200
Language:C++ (C++17)
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.01 s1, 2details
#8ACCEPTED0.01 s1, 2details
#9ACCEPTED0.00 s1, 2details
#10ACCEPTED0.01 s1, 2details
#11ACCEPTED0.01 s1, 2details
#12ACCEPTED0.01 s2details
#13ACCEPTED0.01 s2details
#14ACCEPTED0.17 s2details
#15ACCEPTED0.72 s2details
#16ACCEPTED0.73 s2details
#17ACCEPTED0.01 s2details
#18ACCEPTED0.74 s2details
#19--2details
#20ACCEPTED0.07 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.18 s2details
#23--2details
#24--2details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:15:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for (int i = 0; i < layout.length(); ++i) {
      |                     ~~^~~~~~~~~~~~~~~~~

Code

#include <iostream>
#include <string>
#include <set>
#include <algorithm>
#include <cmath>

int main() {
    int Num_rooms;
    std::string layout;
    std::cin >> Num_rooms;
    std::cin >> layout;

    int robot_pos = layout.find('R');
    std::set<int> star_positions;
    for (int i = 0; i < layout.length(); ++i) {
        if (layout[i] == '*') {
            star_positions.insert(i);
        }
    }

    int total_steps = 0;
    int total_coins = 0;

    while (!star_positions.empty()) {
        auto closest_star = std::min_element(star_positions.begin(), star_positions.end(),
            [robot_pos](int a, int b) {
                return std::abs(a - robot_pos) < std::abs(b - robot_pos);
            });
        
        int distance = std::abs(*closest_star - robot_pos);

        bool multiple_stars_at_same_distance = false;
        for (int star : star_positions) {
            if (star != *closest_star && std::abs(star - robot_pos) == distance) {
                multiple_stars_at_same_distance = true;
                break;
            }
        }

        if (multiple_stars_at_same_distance) {
            break;
        }

        total_steps += distance;
        total_coins++;
        robot_pos = *closest_star;
        star_positions.erase(closest_star);
    }

    std::cout << total_steps << " " << total_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: 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:

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

correct output
299998 100000

user output
(empty)

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:

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

correct output
199999 199999

user output
(empty)