CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:fatihmerickoc
Submission time:2024-10-28 14:42:13 +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.01 s2details
#13ACCEPTED0.01 s2details
#14ACCEPTED0.02 s2details
#15ACCEPTED0.03 s2details
#16ACCEPTED0.05 s2details
#17ACCEPTED0.00 s2details
#18ACCEPTED0.67 s2details
#19--2details
#20ACCEPTED0.00 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.31 s2details
#23--2details
#24--2details

Code

//
//  main.cpp
//  mainCode
//
//  Created by Fatih Meric Koc on 28.10.2024.
//

#include <iostream>
#include <string>
#include <algorithm>
using namespace std;

pair<int, int> solve(string s) {
    int n = s.length();
    int robot_pozisyon = s.find('R');
    int adimlar = 0;
    int paralar = 0;
    
    s[robot_pozisyon] = '.';
    
    while (true) {
        int left_dist = n;
        for (int i = robot_pozisyon - 1; i >= 0; i--) {
            if (s[i] == '*') {
                left_dist = robot_pozisyon - i;
                break;
            }
        }
        
        int right_dist = n;
        for (int i = robot_pozisyon + 1; i < n; i++) {
            if (s[i] == '*') {
                right_dist = i - robot_pozisyon;
                break;
            }
        }
        
        if (left_dist == n && right_dist == n) {
            break;
        }
        
        if (left_dist == right_dist) {
            break;
        }
        
        if (left_dist < right_dist) {
            adimlar += left_dist;
            robot_pozisyon -= left_dist;
        } else {
            adimlar += right_dist;
            robot_pozisyon += right_dist;
        }
        
        s[robot_pozisyon] = '.';
        paralar++;
    }
    
    return {adimlar, paralar};
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    
    int n;
    string s;
    cin >> n >> s;
    
    pair<int, int> result = solve(s);
    cout << result.first << " " << result.second << "\n";
    
    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)