CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:MituFin
Submission time:2024-11-09 19:21:11 +0200
Language:C++ (C++17)
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
#7ACCEPTED0.00 s1, 2details
#8ACCEPTED0.00 s1, 2details
#9ACCEPTED0.00 s1, 2details
#100.00 s1, 2details
#110.00 s1, 2details
#12ACCEPTED0.00 s2details
#130.00 s2details
#14ACCEPTED0.00 s2details
#150.00 s2details
#160.00 s2details
#17ACCEPTED0.01 s2details
#18ACCEPTED0.01 s2details
#19ACCEPTED0.01 s2details
#20ACCEPTED0.01 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.01 s2details
#230.01 s2details
#240.01 s2details

Code

#include <iostream>
using namespace std;
// input looks like this:
// 6
// *..R**
int main() {
int rooms;
string roomlayout;
cin >> rooms;
cin >> roomlayout;
int robotSpot = roomlayout.find("R");
int robotDisplacement = 0;
int coins = 0;
int steps = 0;
int coinsOnLeft[robotSpot + 1] = {0};
int indexLeft = 0;
int coinsOnRight[rooms - robotSpot - 1] = {0};
int indexRight = 0;
int totalCoinsOnMap = 0;
for (int i = 1; i <= robotSpot; i++) {
if (roomlayout[robotSpot - i] == '*') {
coinsOnLeft[indexLeft] = i;
//cout << coinsOnLeft[indexLeft] << " list left\n";
indexLeft += 1;
totalCoinsOnMap += 1;
}
}
for (int i = 1; i <= rooms - robotSpot - 1; i++) {
if (roomlayout[robotSpot + i] == '*') {
coinsOnRight[indexRight] = i;
indexRight += 1;
totalCoinsOnMap += 1;
}
}
indexLeft = 0, indexRight = 0;
//cout << coinsOnLeft[indexLeft] << " " << coinsOnRight[indexRight] << "what\n";
while (true) {
//cout << "test" << coinsOnLeft[indexLeft] << " " << coinsOnRight[indexRight] << " H\n";
if (coinsOnLeft[indexLeft] == 0 && coinsOnRight[indexRight] != 0) {
//cout << coins << " " << steps << " no coins on left\n";
steps -= robotDisplacement;
while (true) {
coins += 1;
indexRight += 1;
if (coinsOnRight[indexRight] == 0) break;
}
steps += coinsOnRight[indexRight - 1];
break;
} else if (coinsOnLeft[indexLeft] != 0 && coinsOnRight[indexRight] == 0) {
//cout << coins << " " << steps << " " << robotDisplacement << " no coins on right\n";
steps += robotDisplacement;
while (true) {
coins += 1;
indexLeft += 1;
if (coinsOnLeft[indexLeft] == 0) break;
}
steps += coinsOnLeft[indexLeft - 1];
break;
} else if (coinsOnLeft[indexLeft] + robotDisplacement < coinsOnRight[indexRight] - robotDisplacement) {
//cout << coins << " " << steps << " coin grabbed from left\n";
steps += coinsOnLeft[indexLeft] + robotDisplacement;
coins += 1;
robotDisplacement = -coinsOnLeft[indexLeft];
indexLeft += 1;
} else if (coinsOnLeft[indexLeft] + robotDisplacement > coinsOnRight[indexRight] - robotDisplacement) {
//cout << coins << " " << steps << " coin grabbed from right\n";
steps += coinsOnRight[indexRight] - robotDisplacement;
coins += 1;
robotDisplacement = coinsOnRight[indexRight];
indexRight += 1;
} else break;
if (coins == totalCoinsOnMap) {
//cout << "break";
break;
}
}
cout << steps << " " << coins;
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:

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

correct output
886 9

user output
0 0

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:

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

correct output
999 999

user output
21845 1000

Test 11

Group: 1, 2

Verdict:

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

correct output
999 999

user output
0 0

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
0 0

Test 14

Group: 2

Verdict: ACCEPTED

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

correct output
18766 5000

user output
18766 5000

Test 15

Group: 2

Verdict:

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

correct output
9999 9999

user output
21845 10000

Test 16

Group: 2

Verdict:

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

correct output
9999 9999

user output
0 0

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:

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

correct output
199999 199999

user output
21845 200000

Test 24

Group: 2

Verdict:

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

correct output
199999 199999

user output
0 0