CSES - Datatähti 2025 alku

Submission details
Task:	Robotti
Sender:	hasorez
Submission time:	2024-10-30 09:11:53 +0200
Language:	C
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	RUNTIME ERROR	0
#2	RUNTIME ERROR	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	RUNTIME ERROR	0.00 s	1, 2	details
#8	ACCEPTED	0.00 s	1, 2	details
#9	ACCEPTED	0.00 s	1, 2	details
#10	RUNTIME ERROR	0.00 s	1, 2	details
#11	RUNTIME ERROR	0.00 s	1, 2	details
#12	RUNTIME ERROR	0.00 s	2	details
#13	RUNTIME ERROR	0.00 s	2	details
#14	RUNTIME ERROR	0.01 s	2	details
#15	WRONG ANSWER	0.00 s	2	details
#16	RUNTIME ERROR	0.00 s	2	details
#17	ACCEPTED	0.00 s	2	details
#18	RUNTIME ERROR	0.00 s	2	details
#19	RUNTIME ERROR	0.00 s	2	details
#20	ACCEPTED	0.00 s	2	details
#21	ACCEPTED	0.00 s	2	details
#22	WRONG ANSWER	0.01 s	2	details
#23	WRONG ANSWER	0.00 s	2	details
#24	RUNTIME ERROR	0.00 s	2	details

Compiler report

input/code.c: In function 'main':
input/code.c:72:15: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   72 |         (void)scanf("%d", &huoneiden_määrä);
      |               ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.c:74:15: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |         (void)scanf("%s", mappi);
      |               ^~~~~~~~~~~~~~~~~~

Code

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

int lähin_kolikkohuone(char *mappi, int robottihuone_idx, int huoneiden_määrä) {

	//printf("robottihuone_idx: %d", robottihuone_idx);
	char *mappi_vasen = (char*)malloc(robottihuone_idx * sizeof(*mappi_vasen));
	strncpy(mappi_vasen, mappi, robottihuone_idx+1);
	//printf("mappi vasen%s\n", mappi_vasen);
	char *vasen_lähin = strrchr(mappi_vasen, '*');
	int vasen_lähin_idx;
	if (vasen_lähin) {
		vasen_lähin_idx = vasen_lähin - mappi_vasen;
	} else {
		vasen_lähin_idx = -1;
	}
	
	char *mappi_oikea = (char*)malloc((huoneiden_määrä-robottihuone_idx)*sizeof(*mappi));
	strncpy(mappi_oikea, mappi+robottihuone_idx+1, huoneiden_määrä-robottihuone_idx);
	//printf("mappi oikea%s\n", mappi_oikea);
	char *oikea_lähin = strchr(mappi_oikea, '*');
	int oikea_lähin_idx;
	if (oikea_lähin) {
		oikea_lähin_idx = (oikea_lähin - mappi_oikea)+robottihuone_idx+1;
	} else {
		oikea_lähin_idx = -1;
	}
	
	free(mappi_vasen);
	free(mappi_oikea);

	//printf("vasen lähin: %d\n", vasen_lähin_idx);
	int vasen_lähin_dist, oikea_lähin_dist;
	if (vasen_lähin_idx > -1) {
		vasen_lähin_dist = abs(vasen_lähin_idx-robottihuone_idx);
	} else {
		vasen_lähin_dist = -1;
	}
	if (oikea_lähin_idx > -1) {
		oikea_lähin_dist = abs(oikea_lähin_idx-robottihuone_idx);
	} else {
		oikea_lähin_dist = -1;
	}

	if ((oikea_lähin_dist != -1) && (vasen_lähin_dist != -1)) {
		if (oikea_lähin_dist == vasen_lähin_dist) {
			return -1;
		}
		if (oikea_lähin_dist < vasen_lähin_dist) {
			return oikea_lähin_idx;
		} 
		else {
			return vasen_lähin_idx;
		}
	}
	
	if ((oikea_lähin_dist != -1) && (vasen_lähin_dist == -1)) {
		return oikea_lähin_idx;
	}

	if ((vasen_lähin_dist != -1) && (oikea_lähin_dist == -1)) {
		return vasen_lähin_idx;
	}

	return -1;
}

int main () {
	unsigned int askeleet, kolikot;
	int huoneiden_määrä;
	(void)scanf("%d", &huoneiden_määrä);
	char *mappi = (char*)malloc((huoneiden_määrä) * sizeof(*mappi));
	(void)scanf("%s", mappi);

	char *robottihuone;
	int robottihuone_idx, kolikkohuone_idx;
	kolikot = 0;
	askeleet = 0;

	while (1) {
	//for (int i=0; i<3; i++) {
		robottihuone = strchr(mappi, 'R');
		robottihuone_idx = (int)(robottihuone-mappi);
		kolikkohuone_idx = lähin_kolikkohuone(mappi, robottihuone_idx, huoneiden_määrä);
		if (kolikkohuone_idx == -1) {
			break;
		}
		//printf("Kolikkohuone: %d\n",kolikkohuone_idx);
		//printf("Robottihuone: %d\n",robottihuone_idx);
		askeleet = askeleet + abs(kolikkohuone_idx-robottihuone_idx);
		kolikot++;
		mappi[robottihuone_idx] = '.';
		mappi[kolikkohuone_idx] = 'R';
		//printf("Askeleet: %d, kolikot: %d\n", askeleet, kolikot);
		//printf("%s\n", mappi);
	}
	printf("%d %d\n", askeleet, kolikot);
	free(mappi);
	return 0;
}

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: RUNTIME ERROR

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

correct output
`1287 400` view save

user output
(empty)

Error:

munmap_chunk(): invalid pointer

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: RUNTIME ERROR

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

correct output
`999 999` view save

user output
(empty)

Error:

munmap_chunk(): invalid pointer

Test 11

Group: 1, 2

Verdict: RUNTIME ERROR

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

correct output
`999 999` view save

user output
(empty)

Error:

munmap_chunk(): invalid pointer

Test 12

Group: 2

Verdict: RUNTIME ERROR

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

correct output
`10971 999` view save

user output
(empty)

Error:

double free or corruption (!prev)

Test 13

Group: 2

Verdict: RUNTIME ERROR

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

correct output
`9999 999` view save

user output
(empty)

Error:

malloc(): invalid next size (unsorted)

Test 14

Group: 2

Verdict: RUNTIME ERROR

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

correct output
`18766 5000` view save

user output
(empty)

Error:

double free or corruption (!prev)

Test 15

Group: 2

Verdict: WRONG ANSWER

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

correct output
`9999 9999` view save

user output
`38 38` view save

Test 16

Group: 2

Verdict: RUNTIME ERROR

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

correct output
`9999 9999` view save

user output
(empty)

Error:

double free or corruption (!prev)

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: RUNTIME ERROR

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

correct output
`299934 10000` view save

user output
(empty)

Error:

code: malloc.c:2617: sysmalloc: Assertion `(old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)' failed.

Test 19

Group: 2

Verdict: RUNTIME ERROR

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

correct output
`299998 100000` view save

user output
(empty)

Error:

code: malloc.c:2617: sysmalloc: Assertion `(old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)' failed.

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: WRONG ANSWER

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

correct output
`199982 5000` view save

user output
`4873 127` view save

Test 23

Group: 2

Verdict: WRONG ANSWER

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

correct output
`199999 199999` view save

user output
`38 38` view save

Test 24

Group: 2

Verdict: RUNTIME ERROR

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

correct output
`199999 199999` view save

user output
(empty)

Error:

double free or corruption (!prev)

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