CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:Karjalanp11rakka
Submission time:2024-10-28 19:57:30 +0200
Language:C++ (C++20)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#10.01 s1, 2details
#20.01 s1, 2details
#30.01 s1, 2details
#40.01 s1, 2details
#50.01 s1, 2details
#60.01 s1, 2details
#70.01 s1, 2details
#80.01 s1, 2details
#90.01 s1, 2details
#100.01 s1, 2details
#110.01 s1, 2details
#120.01 s2details
#130.01 s2details
#140.01 s2details
#150.01 s2details
#160.01 s2details
#170.01 s2details
#180.01 s2details
#190.01 s2details
#200.01 s2details
#210.01 s2details
#220.01 s2details
#230.01 s2details
#240.01 s2details

Code

#include <bits/stdc++.h>

using namespace std;
 
vector<bool> rooms {};
int moves {}, coins {};
int n {};
 
void search(int rPos)
{
    int c {};
    int closestLeft {-1}, closestRight {-1};
    
    for(int i {}; i < n; ++i)
    {
        if(i != rPos && rooms[i])
        {
            ++c;
            if(rPos > i)
            {
                closestLeft = i;
            }
            else 
            {
                closestRight = i;
                break;
            }
        }
    }

    if(!c) return;
    
    int dif {};
    if(closestLeft == -1)
    {
        dif = closestRight - rPos;
        closestLeft = closestRight;
    }
    else if(closestRight == -1)
    {
        dif = rPos - closestLeft;
    }
    else
    {
        dif = rPos - closestLeft;
        int dif2 {closestRight - rPos};
        if(dif == dif2) return;
        if(dif > dif2)
        {
            dif = dif2;
            closestLeft = closestRight;
        }
    }

    rooms[closestLeft] = false;
    ++coins;
    moves += dif;
    search(closestLeft);
}
 
int main()
{
    istringstream is("2267 **.*........*.....*..**.*...**.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..*.....*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..***.*........*.....*..**.R*...*..............*.*");

    is >> n;

    if(n == 1)
    {
        cout << "0 0";
        return 0;
    }
 
    rooms.reserve(n);
    int rPos {};
    for(int i {}; i < n; ++i)
    {
        char c {};
        is >> c;
        if(c == 'R') rPos = i;
        rooms.push_back(c == '*' ? true : false);
    }

    
    search(rPos);
    cout << moves << ' ' << coins;
    return 0;
}

Test details

Test 1

Group: 1, 2

Verdict:

input
1
R

correct output
0 0

user output
2267 618

Test 2

Group: 1, 2

Verdict:

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

correct output
0 0

user output
2267 618

Test 3

Group: 1, 2

Verdict:

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

correct output
12 5

user output
2267 618

Test 4

Group: 1, 2

Verdict:

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

correct output
0 0

user output
2267 618

Test 5

Group: 1, 2

Verdict:

input
1000
R................................

correct output
947 9

user output
2267 618

Test 6

Group: 1, 2

Verdict:

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

correct output
886 9

user output
2267 618

Test 7

Group: 1, 2

Verdict:

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

correct output
1287 400

user output
2267 618

Test 8

Group: 1, 2

Verdict:

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

correct output
0 0

user output
2267 618

Test 9

Group: 1, 2

Verdict:

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

correct output
0 0

user output
2267 618

Test 10

Group: 1, 2

Verdict:

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

correct output
999 999

user output
2267 618

Test 11

Group: 1, 2

Verdict:

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

correct output
999 999

user output
2267 618

Test 12

Group: 2

Verdict:

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

correct output
10971 999

user output
2267 618

Test 13

Group: 2

Verdict:

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

correct output
9999 999

user output
2267 618

Test 14

Group: 2

Verdict:

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

correct output
18766 5000

user output
2267 618

Test 15

Group: 2

Verdict:

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

correct output
9999 9999

user output
2267 618

Test 16

Group: 2

Verdict:

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

correct output
9999 9999

user output
2267 618

Test 17

Group: 2

Verdict:

input
200000
.................................

correct output
0 0

user output
2267 618

Test 18

Group: 2

Verdict:

input
200000
.................................

correct output
299934 10000

user output
2267 618

Test 19

Group: 2

Verdict:

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

correct output
299998 100000

user output
2267 618

Test 20

Group: 2

Verdict:

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

correct output
0 0

user output
2267 618

Test 21

Group: 2

Verdict:

input
200000
R................................

correct output
133765 3

user output
2267 618

Test 22

Group: 2

Verdict:

input
200000
R................................

correct output
199982 5000

user output
2267 618

Test 23

Group: 2

Verdict:

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

correct output
199999 199999

user output
2267 618

Test 24

Group: 2

Verdict:

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

correct output
199999 199999

user output
2267 618