CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:Poison
Submission time:2024-11-10 19:17:58 +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.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#10ACCEPTED0.01 s1, 2details
#11ACCEPTED0.01 s1, 2details
#12ACCEPTED0.01 s2details
#13ACCEPTED0.01 s2details
#14ACCEPTED0.07 s2details
#15ACCEPTED0.14 s2details
#16ACCEPTED0.14 s2details
#17ACCEPTED0.01 s2details
#18ACCEPTED0.40 s2details
#19--2details
#20ACCEPTED0.04 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.09 s2details
#23--2details
#24--2details

Code

#include <iostream>
#include <unordered_set>
#include <cmath>
#include <vector>

int main() {
    int n;
    std::string rooms;
    std::cin >> n >> rooms;
    //Lisää laadukkaita määritelmiä
    int start_position = -1;
    std::unordered_set<int> coin_positions;
    //Jos ei toimi, siirry eteenpäin
    for (int i = 0; i < n; ++i) {
        if (rooms[i] == 'R') {
            start_position = i;
        } else if (rooms[i] == '*') {
            coin_positions.insert(i);
        }
    }
    
    int steps = 0;
    int coins_collected = 0;
    int current_position = start_position;
    //Mukavat while ja sen alku
    while (!coin_positions.empty()) {
        int min_distance = n;
        int closest_coin_position = -1;
        bool found_duplicate = false;
        
        for (int pos : coin_positions) {
            int distance = std::abs(current_position - pos);
            if (distance < min_distance) {
                min_distance = distance;
                closest_coin_position = pos;
                found_duplicate = false;
            } else if (distance == min_distance) {
                found_duplicate = true;
            }
        }
        
        if (found_duplicate) {
            break;
        }

        steps += min_distance;
        coins_collected += 1;
        current_position = closest_coin_position;
        
        coin_positions.erase(closest_coin_position);
        //Whilen loppu
    }
    
    std::cout << steps << " " << coins_collected << 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)