137 lines
2.8 KiB
C
137 lines
2.8 KiB
C
/* ************************************************************************** */
|
|
/* */
|
|
/* ::: :::::::: */
|
|
/* part2.c :+: :+: :+: */
|
|
/* +:+ +:+ +:+ */
|
|
/* By: tomoron <tomoron@student.42.fr> +#+ +:+ +#+ */
|
|
/* +#+#+#+#+#+ +#+ */
|
|
/* Created: 2024/07/17 23:03:36 by tomoron #+# #+# */
|
|
/* Updated: 2024/12/09 15:15:38 by tomoron ### ########.fr */
|
|
/* */
|
|
/* ************************************************************************** */
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include "libft/libft.h"
|
|
|
|
static void add_nbr(int **res, int nb, int index)
|
|
{
|
|
int free_space;
|
|
|
|
free_space = index % 2;
|
|
if(index)
|
|
index /= 2;
|
|
while(nb > 0)
|
|
{
|
|
if(free_space)
|
|
**res = -1;
|
|
else
|
|
**res = index;
|
|
(*res)++;
|
|
nb--;
|
|
}
|
|
}
|
|
|
|
static int *get_nbrs(char *input, size_t *len)
|
|
{
|
|
int i;
|
|
int *nbrs;
|
|
int *res;
|
|
|
|
*len = 0;
|
|
i = 0;
|
|
while(input[i] && ft_isdigit(input[i]))
|
|
{
|
|
*len += input[i] - '0';
|
|
i++;
|
|
}
|
|
res = malloc(*len * sizeof(int));
|
|
nbrs = res;
|
|
i = 0;
|
|
while(input[i])
|
|
{
|
|
add_nbr(&nbrs, input[i] - '0', i);
|
|
i++;
|
|
}
|
|
return(res);
|
|
}
|
|
|
|
static int *find_place(int *disk, int bloc_len, int *end)
|
|
{
|
|
int free_len;
|
|
|
|
while(disk < end)
|
|
{
|
|
free_len = 0;
|
|
while(*disk != -1 && disk < end)
|
|
disk++;
|
|
while(disk[free_len] == -1 && disk < end)
|
|
free_len++;
|
|
if(free_len >= bloc_len)
|
|
return(disk);
|
|
disk += free_len;
|
|
}
|
|
return(0);
|
|
}
|
|
|
|
static void frag_disk(int *disk, int len)
|
|
{
|
|
int *fs_ptr;
|
|
int *end_ptr;
|
|
int bloc_len;
|
|
int cur_id;
|
|
int prev_id;
|
|
int max_size;
|
|
|
|
fs_ptr = disk;
|
|
end_ptr = disk + (len - 1);
|
|
prev_id = -1;
|
|
max_size = -1;
|
|
while(end_ptr > disk)
|
|
{
|
|
bloc_len = 0;
|
|
fs_ptr = 0;
|
|
while(*end_ptr == -1 && end_ptr > disk)
|
|
end_ptr--;
|
|
cur_id = *end_ptr;
|
|
while(end_ptr[-bloc_len] == cur_id && (end_ptr - bloc_len) > disk)
|
|
bloc_len++;
|
|
if((prev_id > cur_id || prev_id == -1) && (max_size > bloc_len || max_size == -1))
|
|
fs_ptr = find_place(disk, bloc_len, end_ptr);
|
|
while(fs_ptr && bloc_len > 0)
|
|
{
|
|
*fs_ptr = *end_ptr;
|
|
*end_ptr = -1;
|
|
fs_ptr++;
|
|
end_ptr--;
|
|
bloc_len--;
|
|
}
|
|
if(!fs_ptr)
|
|
end_ptr -= bloc_len;
|
|
if(!fs_ptr)
|
|
max_size = bloc_len;
|
|
prev_id = cur_id;
|
|
}
|
|
}
|
|
|
|
long int resolve_part2(char *input, char **split)
|
|
{
|
|
(void)split;
|
|
int *disk;
|
|
size_t len;
|
|
size_t i;
|
|
long int res;
|
|
disk = get_nbrs(input, &len);
|
|
frag_disk(disk, len);
|
|
i = 0;
|
|
res = 0;
|
|
while(i < len)
|
|
{
|
|
if(disk[i] != -1)
|
|
res += disk[i] * i;
|
|
i++;
|
|
}
|
|
free(disk);
|
|
return(res);
|
|
}
|