CSES - Datatähti 2025 alku - Results
Submission details
Task:Robotti
Sender:lemail
Submission time:2024-11-07 02:02:52 +0200
Language:C++ (C++20)
Status:READY
Result:30
Feedback
groupverdictscore
#1ACCEPTED30
#20
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.01 s2details
#130.02 s2details
#140.03 s2details
#15ACCEPTED0.04 s2details
#16ACCEPTED0.07 s2details
#17ACCEPTED0.01 s2details
#18ACCEPTED0.78 s2details
#19--2details
#20ACCEPTED0.01 s2details
#21ACCEPTED0.01 s2details
#22ACCEPTED0.31 s2details
#23--2details
#24--2details

Compiler report

input/code.cpp: In function 'long int optimalcoin()':
input/code.cpp:18:14: warning: unused variable 'LeftOn' [-Wunused-variable]
   18 |         bool LeftOn = true;
      |              ^~~~~~
input/code.cpp:19:14: warning: unused variable 'RightOn' [-Wunused-variable]
   19 |         bool RightOn = true;
      |              ^~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:85:15: warning: self-comparison always evaluates to false [-Wtautological-compare]
   85 |         if (n != n) {
      |             ~ ^~ ~
input/code.cpp: In function 'long int optimalcoin()':
input/code.cpp:75:9: warning: control reaches end of non-void function [-Wreturn-type]
   75 |         }
      |         ^

Code

#include <iostream>
#include <string>
#include <vector>
#include <cmath>
std::string HuoneetString = "";
long int CurrentPos = 0;
long int TotalCoins = 0;
long int n = 0;
static long int optimalcoin() {
long int Left = 0;
long int Right = 0;
long int i = CurrentPos;
bool LeftOn = true;
bool RightOn = true;
if (HuoneetString[CurrentPos] != '*') {
bool LoopOn = true;
while (LoopOn) {
LoopOn = true;
if (HuoneetString[i] == '*') {
Right = i;
LoopOn = false;
}
else if (n <= i){
LoopOn = false;
Right = 10000000;
}
else {
}
i++;
}
LoopOn = true;
i = CurrentPos;
while (LoopOn) {
LoopOn = true;
if (HuoneetString[i] == '*') {
Left = i;
LoopOn = false;
i = CurrentPos;
}
else if (i <= 0) {
LoopOn = false;
Left = -10000000;
}
else {
}
i--;
}
LoopOn = true;
}
if (abs(CurrentPos-Left) > abs(CurrentPos-Right)) {
return Right;
}
else if (abs(CurrentPos - Left) < abs(CurrentPos - Right)) {
return Left;
}
else if (abs(CurrentPos - Left) == abs(CurrentPos - Right)) {
//std::cout << Left << " " << Right << std::endl;
return -1;
}
}
int main() {
long int Coins = 0;
long int Steps = 0;
bool LoopOn = true;
std::cin >> n;
HuoneetString.reserve(n);
std::cin >> HuoneetString;
if (n != n) {
}
else {
for (long int i = 0; i != n; i++) {
if (HuoneetString[i] == 'R') {
CurrentPos = i;
}
}
for (long int i = 0; i != n; i++) {
if (HuoneetString[i] == '*') {
TotalCoins++;
}
}
while (LoopOn) {
if (optimalcoin() == -1) {
std::cout << Steps << " " << Coins << std::endl;
//std::cout << "Can't find" << std::endl;
//std::cout << CurrentPos << std::endl;
LoopOn = false;
}
else if (Coins >= TotalCoins) {
std::cout << Steps << " " << Coins << std::endl;
//std::cout << "Max Coins" << std::endl;
//std::cout << CurrentPos << std::endl;
LoopOn = false;
}
else {
if (optimalcoin() == 0) {
Steps++;
}
else {
Steps = Steps + abs(CurrentPos - optimalcoin());
}
CurrentPos = optimalcoin();
HuoneetString[CurrentPos] = '.';
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: 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:

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

correct output
9999 999

user output
9997 999

Test 14

Group: 2

Verdict:

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

correct output
18766 5000

user output
18765 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:

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

correct output
299998 100000

user output
(empty)

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
(empty)