CSES - Datatähti 2025 alku

Submission details
Task:	Robotti
Sender:	Interaalimato
Submission time:	2024-10-28 11:35:37 +0200
Language:	C++ (C++20)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2	details
#2	ACCEPTED	0.00 s	1, 2	details
#3	WRONG ANSWER	0.00 s	1, 2	details
#4	ACCEPTED	0.00 s	1, 2	details
#5	WRONG ANSWER	0.00 s	1, 2	details
#6	WRONG ANSWER	0.00 s	1, 2	details
#7	WRONG ANSWER	0.01 s	1, 2	details
#8	ACCEPTED	0.00 s	1, 2	details
#9	ACCEPTED	0.00 s	1, 2	details
#10	WRONG ANSWER	0.07 s	1, 2	details
#11	WRONG ANSWER	0.06 s	1, 2	details
#12	WRONG ANSWER	0.06 s	2	details
#13	WRONG ANSWER	0.06 s	2	details
#14	OUTPUT LIMIT EXCEEDED	0.00 s	2	details
#15	OUTPUT LIMIT EXCEEDED	0.00 s	2	details
#16	OUTPUT LIMIT EXCEEDED	0.00 s	2	details
#17	ACCEPTED	0.01 s	2	details
#18	OUTPUT LIMIT EXCEEDED	0.00 s	2	details
#19	OUTPUT LIMIT EXCEEDED	0.00 s	2	details
#20	ACCEPTED	0.01 s	2	details
#21	WRONG ANSWER	0.01 s	2	details
#22	OUTPUT LIMIT EXCEEDED	0.00 s	2	details
#23	OUTPUT LIMIT EXCEEDED	0.00 s	2	details
#24	OUTPUT LIMIT EXCEEDED	0.00 s	2	details

Code

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

using namespace std;

int main()
{

    string huoneet;
    int n;
    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 nearestIdx = 0;
        while (start <= end)
        {
            int mid = (start + end) / 2;
            if (((locations[mid] < pos) && (mid == m || locations[mid + 1] > pos)) || ((locations[mid] > pos) && (mid == 0 || locations[mid - 1] < pos)))
            {
                nearestIdx = mid;
                break;
            }
            if (locations[mid] > pos)
            {
                end = mid - 1;
            }
            else if (locations[mid] < pos)
            {
                start = mid + 1;
            }
        }
        int dist = -1;
        if (locations[nearestIdx] < pos)
        {
            if (nearestIdx == m || locations[nearestIdx + 1] - pos > pos - locations[nearestIdx])
            {
                dist = pos - locations[nearestIdx];
            }
            else if (locations[nearestIdx + 1] - pos == pos - locations[nearestIdx])
            {
                break;
            }
            else
            {
                dist = locations[nearestIdx + 1] - pos;
                nearestIdx++;
            }
        }
        else
        {
            if (nearestIdx == 0 || pos - locations[nearestIdx - 1] > locations[nearestIdx] - pos)
            {
                dist = locations[nearestIdx] - pos;
            }
            else if (locations[nearestIdx] - pos == pos - locations[nearestIdx - 1])
            {
                break;
            }
            else
            {
                dist = pos - locations[nearestIdx - 1];
                nearestIdx--;
            }
        }
        cout << "Curr: " << pos << ", D: " << dist << ", pos" << locations[nearestIdx] << "\n";
        for (const auto el : locations)
        {
            cout << el << ", ";
        }
        cout << "\n";
        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` view save

correct output
`0 0` view save

user output
`0 0` view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
`10 ...R......` view save

correct output
`0 0` view save

user output
`0 0` view save

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

input
`10 .R...*` view save

correct output
`12 5` view save

user output
`Curr: 4, D: 2, pos2 1, 2, 8, 9, 10, Curr: 2, D: 1, pos1 1, 8, 9, 10, Curr: 1, D: 7, pos8 ...` view save

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
`10 *R****` view save

correct output
`0 0` view save

user output
`0 0` view save

Test 5

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 R................................` view save

correct output
`947 9` view save

user output
`Curr: 1, D: 148, pos149 149, 227, 258, 429, 495, 574, ...` view save

Test 6

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 .................................` view save

correct output
`886 9` view save

user output
`Curr: 1000, D: 159, pos841 114, 232, 530, 612, 709, 713, ...` view save

Test 7

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 .........................` view save

correct output
`1287 400` view save

user output
`Curr: 701, D: 2, pos699 6, 9, 14, 15, 18, 19, 22, 29, ...` view save

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
`1000 **********.***************...` view save

correct output
`0 0` view save

user output
`0 0` view save

Test 9

Group: 1, 2

Verdict: ACCEPTED

input
`1000 ******************************...` view save

correct output
`0 0` view save

user output
`0 0` view save

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 R*****************************...` view save

correct output
`999 999` view save

user output
`Curr: 1, D: 1, pos2 2, 3, 4, 5, 6, 7, 8, 9, 10, 11...` view save

Test 11

Group: 1, 2

Verdict: WRONG ANSWER

input
`1000 ******************************...` view save

correct output
`999 999` view save

user output
`Curr: 1000, D: 1, pos999 1, 2, 3, 4, 5, 6, 7, 8, 9, 10,...` view save

Test 12

Group: 2

Verdict: WRONG ANSWER

input
`10000 .......*...................*...` view save

correct output
`10971 999` view save

user output
`Curr: 1000, D: 3, pos1003 8, 9, 18, 30, 42, 57, 62, 71, ...` view save

Test 13

Group: 2

Verdict: WRONG ANSWER

input
`10000 ...........................` view save

correct output
`9999 999` view save

user output
`Curr: 10000, D: 5, pos9995 1, 4, 9, 16, 22, 25, 36, 44, 5...` view save

Test 14

Group: 2

Verdict: OUTPUT LIMIT EXCEEDED

input
`10000 ...............*.....` view save

correct output
`18766 5000` view save

user output
(empty)

Test 15

Group: 2

Verdict: OUTPUT LIMIT EXCEEDED

input
`10000 R*****************************...` view save

correct output
`9999 9999` view save

user output
(empty)

Test 16

Group: 2

Verdict: OUTPUT LIMIT EXCEEDED

input
`10000 ******************************...` view save

correct output
`9999 9999` view save

user output
(empty)

Test 17

Group: 2

Verdict: ACCEPTED

input
`200000 .................................` view save

correct output
`0 0` view save

user output
`0 0` view save

Test 18

Group: 2

Verdict: OUTPUT LIMIT EXCEEDED

input
`200000 .................................` view save

correct output
`299934 10000` view save

user output
(empty)

Test 19

Group: 2

Verdict: OUTPUT LIMIT EXCEEDED

input
`200000 ............*...*....` view save

correct output
`299998 100000` view save

user output
(empty)

Test 20

Group: 2

Verdict: ACCEPTED

input
`200000 ******************************...` view save

correct output
`0 0` view save

user output
`0 0` view save

Test 21

Group: 2

Verdict: WRONG ANSWER

input
`200000 R................................` view save

correct output
`133765 3` view save

user output
`Curr: 1, D: 70142, pos70143 70143, 84565, 133766, Curr: 70143, D: 14422, pos8456...` view save

Test 22

Group: 2

Verdict: OUTPUT LIMIT EXCEEDED

input
`200000 R................................` view save

correct output
`199982 5000` view save

user output
(empty)

Test 23

Group: 2

Verdict: OUTPUT LIMIT EXCEEDED

input
`200000 R*****************************...` view save

correct output
`199999 199999` view save

user output
(empty)

Test 24

Group: 2

Verdict: OUTPUT LIMIT EXCEEDED

input
`200000 ******************************...` view save

correct output
`199999 199999` view save

user output
(empty)

Datatähti 2025 alku

Robotti

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Tasks

Submissions (Interaalimato)