tom/aoc
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

add day 18

Browse Source
This commit is contained in:
tomoron
2024-12-18 14:20:17 +01:00
parent f83c49b42c
commit 293939b6f3
5 changed files with 601 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

69
2024/18/Makefile Normal file
View File

@ -0,0 +1,69 @@
# **************************************************************************** #
# #
# ::: :::::::: #
# Makefile :+: :+: :+: #
# +:+ +:+ +:+ #
# By: tomoron <tomoron@student.42.fr> +#+ +:+ +#+ #
# +#+#+#+#+#+ +#+ #
# Created: 2024/07/17 15:48:36 by tomoron #+# #+# #
# Updated: 2024/10/29 20:43:12 by tomoron ### ########.fr #
# #
# **************************************************************************** #
SRCS = main.c\
part1.c\
part2.c
OBJS = $(SRCS:.c=.o)
FLAGS = -Wextra -Werror -Wall -g
LIB = libft/libft.a
all: $(LIB) a.out test
cp test cur_input
./a.out
f: $(LIB) a.out input
cp input cur_input
./a.out
test:
touch test
input:
touch input
cp:
cp part1.c part2.c
sed -i 's/resolve_part1/resolve_part2/g' part2.c
$(LIB): libft
make -C libft
libft:
cp -r ~/Desktop/aoc/libft .
main.c:
cp ~/Desktop/aoc/main.c .
part1.c:
cp ~/Desktop/aoc/part1.c .
part2.c:
cp ~/Desktop/aoc/part2.c .
a.out: main.c $(OBJS) $(LIB)
clang $(FLAGS) $(OBJS) $(LIB)
clean:
rm -rf $(OBJS)
rm -rf libft
fclean: clean
rm -rf a.out
.c.o:
clang $(FLAGS) -c $< -o $@
.PHONY: t all clean fclean cp

67
2024/18/main.c Normal file
View File

@ -0,0 +1,67 @@
#include <fcntl.h>
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include "libft/libft.h"
long int resolve_part1(char *input, char **split);
long int resolve_part2(char *input, char **split);
char *get_input(char *file)
{
int fd;
int rd_len;
char buffer[1000];
int len;
char *res;
fd = open(file, O_RDONLY);
len = 0;
if(fd < 0)
return(0);
rd_len = -1;
while(rd_len)
{
rd_len = read(fd, buffer, 1000);
len+= rd_len;
}
close(fd);
res = malloc(len + 1);
if(!res)
return(0);
fd = open(file, O_RDONLY);
if(fd < 0)
return(0);
rd_len = read(fd,res, len);
res[len] = 0;
close(fd);
return(res);
}
int main(void)
{
char *input;
char *input_cpy;
char **split;
input = get_input("cur_input");
input_cpy = ft_strdup(input);
if(!input || !input_cpy)
{
fprintf(stderr, "file read error\n");
return(1);
}
split = ft_split(input, '\n');
if(!split)
return(1);
printf("result part 1: %ld\n", resolve_part1(input, split));
ft_free_str_arr(split);
split = ft_split(input_cpy, '\n');
if(!split)
return(1);
printf("result part 2: %ld\n", resolve_part2(input, split));
ft_free_str_arr(split);
free(input);
free(input_cpy);
return(0);
}

219
2024/18/part1.c Normal file
View File

@ -0,0 +1,219 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* part1.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: tomoron <tomoron@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/07/17 23:03:36 by tomoron #+# #+# */
/* Updated: 2024/12/18 13:59:37 by tomoron ### ########.fr */
/* */
/* ************************************************************************** */
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include "libft/libft.h"
typedef struct s_pos
{
int x;
int y;
} t_pos;
typedef struct s_lst
{
t_pos pos;
uint32_t score;
int dir[2];
struct s_lst *next;
} t_lst;
static void *create_map(char **map, uint8_t fill, int bloc_size)
{
int width;
int height;
int i;
void **res;
height = 0;
while(map[height])
height++;
width = 0;
while(map[0][width])
width++;
res = malloc((height + 1) * sizeof(void *));
i = 0;
while(i < height)
{
res[i] = malloc((width + 1) * bloc_size);
ft_memset(res[i], fill, width * bloc_size);
((char **)res)[i][width * bloc_size] = 0;
i++;
}
return(res);
}
static int get_new_pos(t_lst **lst, char **vis, t_pos *pos, uint32_t *score, int *dir)
{
t_lst *cur;
t_lst *sel;
t_lst *p_sel;
t_lst *prev;
uint32_t min;
if(!*lst)
return(0);
cur = *lst;
sel = 0;
p_sel = 0;
prev = 0;
min = -1;
while(cur)
{
if(cur->score < min)
{
sel = cur;
p_sel = prev;
min = cur->score;
}
prev = cur;
cur = cur->next;
}
if(*lst && sel == *lst)
*lst = (*lst)->next;
if(p_sel)
p_sel->next = sel->next;
sel->next = 0;
*score = sel->score;
pos->x = sel->pos.x;
pos->y = sel->pos.y;
dir[0] = sel->dir[0];
dir[1] = sel->dir[1];
free(sel);
if(vis[pos->y][pos->x])
return(get_new_pos(lst, vis, pos, score, dir));
return(1);
}
static void add_lst(t_lst **lst, uint32_t score, t_pos pos, int dir[2])
{
t_lst *new;
new = malloc(sizeof(t_lst));
new->dir[0] = dir[0];
new->dir[1] = dir[1];
new->pos.x = pos.x;
new->pos.y = pos.y;
new->score = score;
new->next = *lst;
*lst = new;
}
static int *rotate_dir(int dir[2], int inv, int *res)
{
res[0] = 0;
res[1] = 0;
if(dir[0])
res[1] = dir[0];
if(dir[1])
res[0] = dir[1];
if(inv)
{
res[0] = -res[0];
res[1] = -res[1];
}
return(res);
}
static int is_valid_move(char **map, int y, int x)
{
return(x >= 0 && y >= 0 && map[y] && map[y][x] == '.');
}
static uint32_t dijkstra(char **map, t_pos *pos)
{
int dir[2];
int tmp[2];
char **visited;
t_lst *lst;
uint32_t score;
visited = create_map(map, 0, 1);
lst = 0;
add_lst(&lst, 0, *pos, (int [2]){0, 1});
while(get_new_pos(&lst, visited, pos, &score, dir))
{
visited[pos->y][pos->x] = 1;
if(map[pos->y][pos->x] == '#')
continue;
if(pos->y == 70 && pos->x == 70)
return(score);
if(is_valid_move(map, pos->y + dir[0], pos->x + dir[1]))
add_lst(&lst, score + 1, (t_pos){pos->x + dir[1], pos->y + dir[0]}, dir);
rotate_dir(dir, 0, tmp);
if(is_valid_move(map, pos->y + tmp[0], pos->x + tmp[1]))
add_lst(&lst, score + 1, (t_pos){pos->x + tmp[1], pos->y + tmp[0]}, tmp);
rotate_dir(dir, 1, tmp);
if(is_valid_move(map, pos->y + tmp[0], pos->x + tmp[1]))
add_lst(&lst, score + 1, (t_pos){pos->x + tmp[1], pos->y + tmp[0]}, tmp);
}
return(0);
}
static char **create_map_size(int size, char fill)
{
int i;
char **res;
res = malloc((size + 1) * sizeof(char *));
res[size] = 0;
i = 0;
while(i < size)
{
res[i] = malloc(size + 1);
res[i][size] = 0;
ft_memset(res[i], fill, size);
i++;
}
return(res);
}
static void get_nbrs(char *line, int *x, int *y)
{
while(*line && !ft_isdigit(*line))
line++;
*x = ft_atoi(line);
while(ft_isdigit(*line))
line++;
while(*line && !ft_isdigit(*line))
line++;
*y = ft_atoi(line);
}
static void fill_map(char **map, char **split, int limit)
{
int x;
int y;
int i;
(void)map;
i = 0;
while(*split && i < limit)
{
get_nbrs(*split, &x, &y);
map[y][x] = '#';
split++;
i++;
}
}
long int resolve_part1(char *input, char **split)
{
char **map;
(void)input;
map = create_map_size(71, '.');
fill_map(map, split, 1024);
return(dijkstra(map,&((t_pos){0, 0})));
}

221
2024/18/part2.c Normal file
View File

@ -0,0 +1,221 @@
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* part2.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: tomoron <tomoron@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/07/17 23:03:36 by tomoron #+# #+# */
/* Updated: 2024/12/18 14:19:27 by tomoron ### ########.fr */
/* */
/* ************************************************************************** */
#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>
#include "libft/libft.h"
typedef struct s_pos
{
int x;
int y;
} t_pos;
typedef struct s_lst
{
t_pos pos;
uint32_t score;
int dir[2];
struct s_lst *next;
} t_lst;
static void *create_map(char **map, uint8_t fill, int bloc_size)
{
int width;
int height;
int i;
void **res;
height = 0;
while(map[height])
height++;
width = 0;
while(map[0][width])
width++;
res = malloc((height + 1) * sizeof(void *));
i = 0;
while(i < height)
{
res[i] = malloc((width + 1) * bloc_size);
ft_memset(res[i], fill, width * bloc_size);
((char **)res)[i][width * bloc_size] = 0;
i++;
}
return(res);
}
static int get_new_pos(t_lst **lst, char **vis, t_pos *pos, uint32_t *score, int *dir)
{
t_lst *cur;
t_lst *sel;
t_lst *p_sel;
t_lst *prev;
uint32_t min;
if(!*lst)
return(0);
cur = *lst;
sel = 0;
p_sel = 0;
prev = 0;
min = -1;
while(cur)
{
if(cur->score < min)
{
sel = cur;
p_sel = prev;
min = cur->score;
}
prev = cur;
cur = cur->next;
}
if(*lst && sel == *lst)
*lst = (*lst)->next;
if(p_sel)
p_sel->next = sel->next;
sel->next = 0;
*score = sel->score;
pos->x = sel->pos.x;
pos->y = sel->pos.y;
dir[0] = sel->dir[0];
dir[1] = sel->dir[1];
free(sel);
if(vis[pos->y][pos->x])
return(get_new_pos(lst, vis, pos, score, dir));
return(1);
}
static void add_lst(t_lst **lst, uint32_t score, t_pos pos, int dir[2])
{
t_lst *new;
new = malloc(sizeof(t_lst));
new->dir[0] = dir[0];
new->dir[1] = dir[1];
new->pos.x = pos.x;
new->pos.y = pos.y;
new->score = score;
new->next = *lst;
*lst = new;
}
static int *rotate_dir(int dir[2], int inv, int *res)
{
res[0] = 0;
res[1] = 0;
if(dir[0])
res[1] = dir[0];
if(dir[1])
res[0] = dir[1];
if(inv)
{
res[0] = -res[0];
res[1] = -res[1];
}
return(res);
}
static int is_valid_move(char **map, int y, int x)
{
return(x >= 0 && y >= 0 && map[y] && map[y][x] == '.');
}
static uint32_t dijkstra(char **map, t_pos *pos, int corner)
{
int dir[2];
int tmp[2];
char **visited;
uint32_t **dists;
t_lst *lst;
uint32_t score;
visited = create_map(map, 0, 1);
dists = create_map(map, 255, sizeof(uint32_t));
lst = 0;
add_lst(&lst, 0, *pos, (int [2]){0, 1});
while(get_new_pos(&lst, visited, pos, &score, dir))
{
if(dists[pos->y][pos->x] > score)
dists[pos->y][pos->x] = score;
visited[pos->y][pos->x] = 1;
if(map[pos->y][pos->x] == '#')
continue;
if(is_valid_move(map, pos->y + dir[0], pos->x + dir[1]))
add_lst(&lst, score + 1, (t_pos){pos->x + dir[1], pos->y + dir[0]}, dir);
rotate_dir(dir, 0, tmp);
if(is_valid_move(map, pos->y + tmp[0], pos->x + tmp[1]))
add_lst(&lst, score + 1, (t_pos){pos->x + tmp[1], pos->y + tmp[0]}, tmp);
rotate_dir(dir, 1, tmp);
if(is_valid_move(map, pos->y + tmp[0], pos->x + tmp[1]))
add_lst(&lst, score + 1, (t_pos){pos->x + tmp[1], pos->y + tmp[0]}, tmp);
}
if(dists[corner][corner] != (uint32_t) -1)
return(dists[corner][corner]);
return(0);
}
static char **create_map_size(int size, char fill)
{
int i;
char **res;
res = malloc((size + 1) * sizeof(char *));
res[size] = 0;
i = 0;
while(i < size)
{
res[i] = malloc(size + 1);
res[i][size] = 0;
ft_memset(res[i], fill, size);
i++;
}
return(res);
}
static void get_nbrs(char *line, int *x, int *y)
{
while(*line && !ft_isdigit(*line))
line++;
*x = ft_atoi(line);
while(ft_isdigit(*line))
line++;
while(*line && !ft_isdigit(*line))
line++;
*y = ft_atoi(line);
}
long int resolve_part2(char *input, char **split)
{
char **map;
(void)input;
int x;
int y;
int i;
map = create_map_size(71, '.');
(void)map;
i = 1024;
while(split[i])
{
get_nbrs(split[i], &x, &y);
map[y][x] = '#';
if(dijkstra(map,&((t_pos){0, 0}), 70) == 0)
{
printf("real res : %d,%d\n", x, y);
return(i);
}
i++;
}
return(-1);
}

25
2024/18/test Normal file
View File

@ -0,0 +1,25 @@
5,4
4,2
4,5
3,0
2,1
6,3
2,4
1,5
0,6
3,3
2,6
5,1
1,2
5,5
2,5
6,5
1,4
0,4
6,4
1,1
6,1
1,0
0,5
1,6
2,0