CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:urkkiz
Submission time:2024-10-29 09:05:17 +0200
Language:C++ (C++17)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED30
#2ACCEPTED70
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.00 s2details
#13ACCEPTED0.00 s2details
#14ACCEPTED0.00 s2details
#15ACCEPTED0.01 s2details
#16ACCEPTED0.00 s2details
#17ACCEPTED0.01 s2details
#18ACCEPTED0.01 s2details
#19ACCEPTED0.02 s2details
#20ACCEPTED0.02 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.01 s2details
#23ACCEPTED0.02 s2details
#24ACCEPTED0.02 s2details

Code

#include <iostream>
#include <list>
using namespace std;
int main() {
int n;
string rooms;
int steps = 0;
int indexOfRobot = 0;
int coinsCollected = 0;
list<int> coinIndexesBeforeRobot = {};
list<int> coinIndexesAfterRobot = {};
cin >> n;
cin >> rooms;
long unsigned int i = 0;
for (; i < rooms.size(); i++){
if(rooms[i] == '*'){
coinIndexesBeforeRobot.push_back(i);
}
if(rooms[i] == 'R'){
indexOfRobot = i;
break;
}
}
for (; i < rooms.size(); i++) {
if(rooms[i] == '*'){
coinIndexesAfterRobot.push_back(i);
}
}
if(!coinIndexesBeforeRobot.empty() && !coinIndexesAfterRobot.empty()){
while(!coinIndexesBeforeRobot.empty() && !coinIndexesAfterRobot.empty()){
int distanceL = indexOfRobot - coinIndexesBeforeRobot.back();
int distanceR = coinIndexesAfterRobot.front() - indexOfRobot;
if(distanceL == distanceR){
break;
}
else if(distanceL < distanceR){
indexOfRobot = coinIndexesBeforeRobot.back();
coinIndexesBeforeRobot.pop_back();
coinsCollected++;
steps += distanceL;
}
else{
indexOfRobot = coinIndexesAfterRobot.front();
coinIndexesAfterRobot.pop_front();
coinsCollected++;
steps += distanceR;
}
}
}
if(coinIndexesBeforeRobot.empty() && !coinIndexesAfterRobot.empty()){
steps += coinIndexesAfterRobot.back() - indexOfRobot;
coinsCollected += coinIndexesAfterRobot.size();
}
else if(!coinIndexesBeforeRobot.empty() && coinIndexesAfterRobot.empty()){
steps += indexOfRobot - coinIndexesBeforeRobot.front();
coinsCollected += coinIndexesBeforeRobot.size();
}
std::cout << steps << " " << coinsCollected;
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: ACCEPTED

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

correct output
299998 100000

user output
299998 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: ACCEPTED

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

correct output
199999 199999

user output
199999 199999

Test 24

Group: 2

Verdict: ACCEPTED

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

correct output
199999 199999

user output
199999 199999