CSES - Datatähti 2025 alku

Submission details
Task:	Robotti
Sender:	patchouli
Submission time:	2024-10-28 10:46:48 +0200
Language:	C
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#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	WRONG ANSWER	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.01 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	WRONG ANSWER	0.01 s	1, 2	details
#12	ACCEPTED	0.01 s	2	details
#13	WRONG ANSWER	0.08 s	2	details
#14	WRONG ANSWER	0.09 s	2	details
#15	ACCEPTED	0.06 s	2	details
#16	WRONG ANSWER	0.78 s	2	details
#17	ACCEPTED	0.00 s	2	details
#18	TIME LIMIT EXCEEDED	--	2	details
#19	TIME LIMIT EXCEEDED	--	2	details
#20	ACCEPTED	0.00 s	2	details
#21	ACCEPTED	0.00 s	2	details
#22	ACCEPTED	0.53 s	2	details
#23	TIME LIMIT EXCEEDED	--	2	details
#24	TIME LIMIT EXCEEDED	--	2	details

Compiler report

input/code.c: In function 'main':
input/code.c:21:3: warning: implicit declaration of function 'getline' [-Wimplicit-function-declaration]
   21 |   getline(&field, &n, stdin);
      |   ^~~~~~~
input/code.c:19:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |   scanf("%li\n", &n);
      |   ^~~~~~~~~~~~~~~~~~

Code

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

struct coin {
  uint8_t have;
  long int pos;
};

struct robot {
  uint8_t have;
  long int pos;
};

// tein tän unessa

int main() {
  unsigned long int n;
  scanf("%li\n", &n);
  char *field = malloc(n * sizeof(char));
  getline(&field, &n, stdin);
  struct coin coin0 = {0};
  struct coin coin1 = {0};
  struct coin coin2 = {0};
  struct robot robot = {0};
  long int steps = 0;
  long int coins = 0;
  long int i = 0;
  uint8_t run = 1;
  while (run) {
    char room = field[i];
		// printf("%li/%lu: %c\n",i,n,room);
    if (room == '*' && i != n) {
      coin0.pos = i;
      coin0.have = 1;
      if (coin1.have) {
        coin2.pos = i;
        coin2.have = 1;
      }
    } else if (room == 'R' && i != n) {
      robot.pos = i;
      robot.have = 1;
      coin1.pos = coin0.pos;
      coin1.have = coin0.have;
    }
    if (robot.have) {
      if (coin1.have && coin2.have) {
        // coins on either side
				//printf("fuck\n");
        long int d1 = robot.pos - coin1.pos;
        long int d2 = coin2.pos - robot.pos;
        long int d = (d2 > d1) ? d1 : d2;
        if (d1 < d2) {
          field[robot.pos] = '.';
          field[coin1.pos] = 'R';
          robot.pos = coin1.pos;
          coin0.have = 0;
          coin1.have = 0;
          coin2.have = 0;
          steps += d;
          coins++;
          i = 0;
          robot.have = 0;
        } else if (d2 < d1) {
          field[robot.pos] = '.';
          field[coin2.pos] = 'R';
          robot.pos = coin2.pos;
          coin0.have = 0;
          coin1.have = 0;
          coin2.have = 0;
          steps += d;
          coins++;
          i = 0;
          robot.have = 0;
        } else {
          run = 0;
        }
      } else if (coin1.have && !coin2.have && i == n) {
        // coin only on left
				//printf("single to left\n");
        long int d = robot.pos - coin1.pos;
        field[robot.pos] = '.';
        field[coin1.pos] = 'R';
        robot.pos = coin1.pos;
        coin0.have = 0;
        coin1.have = 0;
        coin2.have = 0;
        steps += d;
        coins++;
        i = 0;
        robot.have = 0;
      } else if (coin0.have && !coin1.have) {
        // coin only on right
				//printf("single to right\n");
        long int d = coin0.pos - robot.pos;
        field[robot.pos] = '.';
        field[coin0.pos] = 'R';
        robot.pos = coin0.pos;
        coin0.have = 0;
        coin1.have = 0;
        coin2.have = 0;
        steps += d;
        coins++;
        i = 0;
        robot.have = 0;
      }
    }
    if (i > n) {
      // no coin
      run = 0;
    } else {
      i++;
    }
  }
  printf("%lu %lu\n", steps, coins);
  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: WRONG ANSWER

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

correct output
`12 5` view save

user output
`10 4` 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: WRONG ANSWER

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

correct output
`999 999` view save

user output
`998 998` 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
`9996 998` view save

Test 14

Group: 2

Verdict: WRONG ANSWER

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

correct output
`18766 5000` view save

user output
`18764 4999` 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: WRONG ANSWER

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

correct output
`9999 9999` view save

user output
`9998 9998` 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: TIME LIMIT EXCEEDED

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

correct output
`299934 10000` view save

user output
(empty)

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