CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:Interaalimato
Submission time:2024-10-28 11:06:36 +0200
Language:C++ (C++20)
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
#5ACCEPTED0.00 s1, 2details
#60.00 s1, 2details
#70.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#10ACCEPTED0.00 s1, 2details
#110.00 s1, 2details
#120.00 s2details
#130.00 s2details
#140.01 s2details
#15ACCEPTED0.01 s2details
#160.01 s2details
#17ACCEPTED0.01 s2details
#180.01 s2details
#190.25 s2details
#20ACCEPTED0.01 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.01 s2details
#23--2details
#24--2details

Code

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

using namespace std;

int main()
{
    int n;
    string huoneet;
    cin >> n >> huoneet;
    vector<int> locations;
    int pos;
    int askeleet = 0;
    int kolikot = 0;
    for (int i = 1; i < n + 1; i++)
    {
        if (huoneet.at(i - 1) == '*')
        {
            locations.push_back(i);
        }
        else if (huoneet.at(i - 1) == 'R')
        {
            pos = i;
        }
    }
    while (locations.size() > 0)
    {
        int start = 0;
        int m = locations.size() - 1;
        int end = m;
        int dist = m + 1;
        int nearestIdx = 0;
        while (start <= end)
        {
            int mid = (start + end) / 2;
            if ((locations[mid] < pos) && (mid == m + 1 || locations[mid + 1] > pos))
            {
                dist = pos - locations[mid];
                nearestIdx = mid;
                break;
            }
            else if ((locations[mid] > pos) && (mid == 0 || locations[mid - 1] < pos))
            {
                dist = locations[mid] - pos;
                nearestIdx = mid;
                break;
            }

            if (locations[mid] > pos)
            {
                end = mid - 1;
            }
            else if (locations[mid] < pos)
            {
                start = mid + 1;
            }
        }
        if ((nearestIdx < m && dist == locations[nearestIdx + 1] - pos) || (nearestIdx > 0 && dist == pos - locations[nearestIdx - 1]))
        {
            break;
        }
        kolikot++;
        askeleet += dist;
        pos = locations[nearestIdx];
        locations.erase(locations.begin() + nearestIdx);
    }

    cout << askeleet << " " << kolikot << "\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:

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

correct output
12 5

user output
34 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:

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

correct output
886 9

user output
863 9

Test 7

Group: 1, 2

Verdict:

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

correct output
1287 400

user output
121420 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:

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

correct output
999 999

user output
1997 999

Test 12

Group: 2

Verdict:

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

correct output
10971 999

user output
899681 999

Test 13

Group: 2

Verdict:

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

correct output
9999 999

user output
10981 999

Test 14

Group: 2

Verdict:

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

correct output
18766 5000

user output
6451232 5000

Test 15

Group: 2

Verdict: ACCEPTED

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

correct output
9999 9999

user output
9999 9999

Test 16

Group: 2

Verdict:

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

correct output
9999 9999

user output
19997 9999

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
1001612068 10000

Test 19

Group: 2

Verdict:

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

correct output
299998 100000

user output
1408586021 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:

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

correct output
199999 199999

user output
(empty)