CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:Dasuki
Submission time:2024-10-28 10:40:27 +0200
Language:C++ (C++20)
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.00 s2details
#16ACCEPTED0.00 s2details
#17ACCEPTED0.01 s2details
#18ACCEPTED0.01 s2details
#19ACCEPTED0.01 s2details
#20ACCEPTED0.01 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.01 s2details
#23ACCEPTED0.01 s2details
#24ACCEPTED0.01 s2details

Code

#include <bits/stdc++.h>
using namespace std;
 
int main() {
	int n;
	cin >> n;
	string robo; 
	cin >> robo;
	int roboPos = robo.find('R');
	vector<int> left, right;
	for (int i = 0; i<(int)robo.size(); i++) {
		if (robo[i] != '*') {
			continue;
		}
		if (i<roboPos) {
			left.push_back(i);
		} else {
			right.push_back(i);
		}
	}
	reverse(right.begin(), right.end());
	int distToLeft = !left.empty() ? roboPos-left.back() : INT_MAX;
	int distToRight = !right.empty() ? right.back()-roboPos : INT_MAX;
	// cout << "IS LEFT EMPTY? " << (left.empty() ? 1 : 0) << endl;
	int coins = 0;
	int steps = 0;
	while (true) {
		// cout << "Positions: " << roboPos << " " << (left.size() == 0 ? "None" : left.back()) << " " << (right.size() == 0 ? "None" : right.back()) << endl;
		// cout << "Distances: " << distToLeft << " " << distToRight << endl;
		if (distToRight == distToLeft) {
			break;
		}
		if (distToRight<distToLeft) {
			steps += distToRight;
			roboPos = right.back();
			distToLeft = left.empty() ? distToLeft : distToLeft + distToRight;
			right.pop_back();
			if (right.empty()) {
				distToRight = INT_MAX;
			} else {
				distToRight = right.back()-roboPos;
			}
		} else if (distToLeft<distToRight) {
			steps += distToLeft;
			roboPos = left.back();
			distToRight = right.empty() ? distToRight : distToRight + distToLeft;
			left.pop_back();
			if (left.empty()) {
				distToLeft = INT_MAX;
			} else {
				distToLeft = roboPos-left.back();
			}
		}
		coins += 1;
	}
	cout << steps << " " << coins << endl;
	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