CSES - Datatähti 2025 alku

Submission details
Task:	Robotti
Sender:	lemail
Submission time:	2024-11-07 00:20:11 +0200
Language:	C++ (C++17)
Status:	READY
Result:	30

Feedback
group	verdict	score
#1	ACCEPTED	30
#2	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.00 s	1, 2	details
#2	ACCEPTED	0.00 s	1, 2	details
#3	ACCEPTED	0.00 s	1, 2	details
#4	ACCEPTED	0.00 s	1, 2	details
#5	ACCEPTED	0.00 s	1, 2	details
#6	ACCEPTED	0.00 s	1, 2	details
#7	ACCEPTED	0.00 s	1, 2	details
#8	ACCEPTED	0.00 s	1, 2	details
#9	ACCEPTED	0.00 s	1, 2	details
#10	ACCEPTED	0.00 s	1, 2	details
#11	ACCEPTED	0.00 s	1, 2	details
#12	ACCEPTED	0.01 s	2	details
#13	WRONG ANSWER	0.01 s	2	details
#14	WRONG ANSWER	0.02 s	2	details
#15	ACCEPTED	0.04 s	2	details
#16	ACCEPTED	0.07 s	2	details
#17	ACCEPTED	0.01 s	2	details
#18	ACCEPTED	0.80 s	2	details
#19	TIME LIMIT EXCEEDED	--	2	details
#20	ACCEPTED	0.01 s	2	details
#21	ACCEPTED	0.01 s	2	details
#22	ACCEPTED	0.32 s	2	details
#23	TIME LIMIT EXCEEDED	--	2	details
#24	TIME LIMIT EXCEEDED	--	2	details

Compiler report

input/code.cpp: In function 'int optimalcoin()':
input/code.cpp:27:57: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   27 |                         else if (HuoneetString.length() <= i){
      |                                  ~~~~~~~~~~~~~~~~~~~~~~~^~~~
input/code.cpp: In function 'int main()':
input/code.cpp:81:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   81 |         if (n != HuoneetString.length()) {
      |             ~~^~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:85:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |                 for (int i = 0; i != HuoneetString.length(); i++) {
      |...

Code

#include <iostream>
#include <string>
#include <vector>
#include <cmath>



std::string HuoneetString = "";
int CurrentPos = 0;
int TotalCoins = 0;

static int optimalcoin() {

	int Left = 0;
	int Right = 0;
	int i = CurrentPos;

	if (HuoneetString[CurrentPos] != '*') {
		bool LoopOn = true;
		while (LoopOn) {
			LoopOn = true;
			if (HuoneetString[i] == '*') {
				Right = i;
				LoopOn = false;

			}
			else if (HuoneetString.length() <= 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() {
	int n = 0; //huoneet num, joka on sin��ns� v�h�n turha tieto, koska se on sama kuin stringin pituus
	int Coins = 0;
	int Steps = 0;
	bool LoopOn = true;
	std::cin >> n;
	std::cin >> HuoneetString;
	if (n != HuoneetString.length()) {

	}
	else {
		for (int i = 0; i != HuoneetString.length(); i++) {
			if (HuoneetString[i] == 'R') {
				CurrentPos = i;
			}
		}
		for (int i = 0; i != HuoneetString.length(); 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` view save

correct output
`0 0` view save

user output
`0 0` view save

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
`10 ...R......` view save

correct output
`0 0` view save

user output
`0 0` view save

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
`10 .R...*` view save

correct output
`12 5` view save

user output
`12 5` view save

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
`10 *R****` view save

correct output
`0 0` view save

user output
`0 0` view save

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
`1000 R................................` view save

correct output
`947 9` view save

user output
`947 9` view save

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
`1000 .................................` view save

correct output
`886 9` view save

user output
`886 9` view save

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
`1000 .........................` view save

correct output
`1287 400` view save

user output
`1287 400` view save

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
`1000 **********.***************...` view save

correct output
`0 0` view save

user output
`0 0` view save

Test 9

Group: 1, 2

Verdict: ACCEPTED

input
`1000 ******************************...` view save

correct output
`0 0` view save

user output
`0 0` view save

Test 10

Group: 1, 2

Verdict: ACCEPTED

input
`1000 R*****************************...` view save

correct output
`999 999` view save

user output
`999 999` view save

Test 11

Group: 1, 2

Verdict: ACCEPTED

input
`1000 ******************************...` view save

correct output
`999 999` view save

user output
`999 999` view save

Test 12

Group: 2

Verdict: ACCEPTED

input
`10000 .......*...................*...` view save

correct output
`10971 999` view save

user output
`10971 999` view save

Test 13

Group: 2

Verdict: WRONG ANSWER

input
`10000 ...........................` view save

correct output
`9999 999` view save

user output
`9997 999` view save

Test 14

Group: 2

Verdict: WRONG ANSWER

input
`10000 ...............*.....` view save

correct output
`18766 5000` view save

user output
`18765 5000` view save

Test 15

Group: 2

Verdict: ACCEPTED

input
`10000 R*****************************...` view save

correct output
`9999 9999` view save

user output
`9999 9999` view save

Test 16

Group: 2

Verdict: ACCEPTED

input
`10000 ******************************...` view save

correct output
`9999 9999` view save

user output
`9999 9999` view save

Test 17

Group: 2

Verdict: ACCEPTED

input
`200000 .................................` view save

correct output
`0 0` view save

user output
`0 0` view save

Test 18

Group: 2

Verdict: ACCEPTED

input
`200000 .................................` view save

correct output
`299934 10000` view save

user output
`299934 10000` view save

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 ............*...*....` view save

correct output
`299998 100000` view save

user output
(empty)

Test 20

Group: 2

Verdict: ACCEPTED

input
`200000 ******************************...` view save

correct output
`0 0` view save

user output
`0 0` view save

Test 21

Group: 2

Verdict: ACCEPTED

input
`200000 R................................` view save

correct output
`133765 3` view save

user output
`133765 3` view save

Test 22

Group: 2

Verdict: ACCEPTED

input
`200000 R................................` view save

correct output
`199982 5000` view save

user output
`199982 5000` view save

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 R*****************************...` view save

correct output
`199999 199999` view save

user output
(empty)

Test 24

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`200000 ******************************...` view save

correct output
`199999 199999` view save

user output
(empty)

Datatähti 2025 alku

Robotti

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Tasks

Submissions (lemail)