CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:pio155
Submission time:2024-11-02 16:45:51 +0200
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.00 s1, 2details
#2ACCEPTED0.00 s1, 2details
#3ACCEPTED0.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
#12ACCEPTED0.00 s2details
#130.01 s2details
#140.01 s2details
#15ACCEPTED0.01 s2details
#160.00 s2details
#17ACCEPTED0.01 s2details
#18ACCEPTED0.02 s2details
#190.29 s2details
#20ACCEPTED0.01 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.01 s2details
#23--2details
#240.01 s2details

Code

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

ll n;
string jono;
ll R;
vector<ll> kolikot;
ll coins = 0;
ll steps = 0;
ll previous = 0;
ll toPrevious;
ll toNext;

int main()
{
    cin>>n;
    cin>>jono;
    
    R = jono.find("R");
    char star = '*'; 
    char r = 'R';
    for(int i = 0; i < n; i++){
        if(jono[i] == star){
            kolikot.push_back(i);
        } else if(jono[i] == r){
            previous = kolikot.size() - 1;
        }
    }
    
    while (!kolikot.empty()){
        ll realkolikotsize = (ll) kolikot.size()-1;
        
        if (previous != -1){
           toPrevious = R - kolikot[previous];
        }
    
        if (previous != realkolikotsize){
            toNext = kolikot[previous + 1] - R;
        }
    
    
       if (previous == -1){
            kolikot.erase(kolikot.begin() + previous + 1);
            R = R + toNext;
            steps = steps + toNext;
       } else if (previous == realkolikotsize){
           kolikot.erase(kolikot.begin() + previous);
           previous--;
           R = R + toPrevious;
           steps = steps + toPrevious;
       } else if (toPrevious == toNext){
           cout << steps<< " " << coins;
           break;
       }else if (toPrevious < toNext){
           kolikot.erase(kolikot.begin() + previous);
           previous--;
           R = R - toPrevious;
           steps = steps + toPrevious;
       } else if (toNext < toPrevious){
           kolikot.erase(kolikot.begin() + previous + 1);
           R = R + toNext;
           steps = steps + toNext;
        }
        coins++;
    }
    
    if(kolikot.empty()){
       cout<<steps<<" "<<coins; 
    }
    
}

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:

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

correct output
886 9

user output
102398 9

Test 7

Group: 1, 2

Verdict:

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

correct output
1287 400

user output
7580355840483222015 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
-1001 999

Test 12

Group: 2

Verdict: ACCEPTED

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

correct output
10971 999

user output
10971 999

Test 13

Group: 2

Verdict:

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

correct output
9999 999

user output
778876365506889155 999

Test 14

Group: 2

Verdict:

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

correct output
18766 5000

user output
1838430667795466286 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
-10001 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
3514534900487197922 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
-200001 199999