commit fe76f7204ae665dd2bea75fe7026d38beda01891 · treybastian.com/advent-of-code

+83 -2
2024/day_05.f90
···

       1
       1
        
       module day_05_utils

     

       2
       2
       +
          implicit none

     

       2
       3
        
       contains

     

       3
       4
        
          subroutine append_to_integer_array(arr, val)

     

       5
       5
       +
             implicit none

     

       4
       6
        
             integer, allocatable, intent(inout) :: arr(:)

     

       5
       7
        
             integer, intent(in) :: val

     

       6
       8
        
             integer, allocatable :: temp(:)

     
···

       12
       14
        
             temp(size(arr) + 1) = val

     

       13
       15
        
             call move_alloc(temp, arr)

     

       14
       16
        
          end subroutine append_to_integer_array

     

       17
       17
       +
          function fix_and_get_middle_value(arr, left, right) result(res)

     

       18
       18
       +
             ! we are going to fix the array swapping until its right

     

       19
       19
       +
             ! there's probably a better way maybe? but I just want to get it done

     

       20
       20
       +
             implicit none

     

       21
       21
       +
             integer, allocatable, intent(in) :: arr(:), left(:), right(:)

     

       22
       22
       +
             integer, allocatable :: work(:), copy(:)

     

       23
       23
       +
             integer :: res, i, j, tmp

     

       24
       24
       +
             logical :: found

     

       25
       25
       +
             allocate(copy(size(arr)))

     

       26
       26
       +
             copy = arr

     

       27
       27
       +
             do

     

       28
       28
       +
                found = .false.

     

       29
       29
       +
                outer: do i = 1, size(copy)

     

       30
       30
       +
                   if(i+1 < size(copy)) then ! if we can check forward

     

       31
       31
       +
                      if(allocated(work)) then

     

       32
       32
       +
                         deallocate(work)

     

       33
       33
       +
                      end if

     

       34
       34
       +
                      do j = 1, size(right) ! find value in right and save left to work

     

       35
       35
       +
                         if (copy(i) == right(j)) then

     

       36
       36
       +
                            if(.not. allocated(work)) then

     

       37
       37
       +
                               allocate(work(1))

     

       38
       38
       +
                               work(1) = left(j)

     

       39
       39
       +
                            else

     

       40
       40
       +
                               call append_to_integer_array(work, left(j))

     

       41
       41
       +
                            end if

     

       42
       42
       +
                         end if

     

       43
       43
       +
                      end do

     

       44
       44
       +
                      do j = i+1, size(copy)

     

       45
       45
       +
                         if(any(work == copy(j))) then

     

       46
       46
       +
                            tmp = copy(i)

     

       47
       47
       +
                            copy(i) = copy(j)

     

       48
       48
       +
                            copy(j) = tmp

     

       49
       49
       +
                            found = .true.

     

       50
       50
       +
                            exit outer

     

       51
       51
       +
                         end if

     

       52
       52
       +
                      end do

     

       53
       53
       +
                   end if

     

       54
       54
       +
       

     

       55
       55
       +
                   if(.not. found) then ! if we are still valid lets keep going

     

       56
       56
       +
                      if(allocated(work)) then

     

       57
       57
       +
                         deallocate(work)

     

       58
       58
       +
                      end if

     

       59
       59
       +
                      if(i-1 > 0) then ! if we can check backwards

     

       60
       60
       +
                         do j = 1, size(left) ! find value in left and save left to work

     

       61
       61
       +
       

     

       62
       62
       +
                            if (copy(i) == left(j)) then

     

       63
       63
       +
                               if(.not. allocated(work)) then

     

       64
       64
       +
                                  allocate(work(1))

     

       65
       65
       +
                                  work(1) = right(j)

     

       66
       66
       +
                               else

     

       67
       67
       +
                                  call append_to_integer_array(work, right(j))

     

       68
       68
       +
                               end if

     

       69
       69
       +
                            end if

     

       70
       70
       +
                         end do

     

       71
       71
       +
                         do j = 1, size(copy)

     

       72
       72
       +
                            if(any(work == copy(j) .and. j < i)) then

     

       73
       73
       +
                               tmp = copy(i)

     

       74
       74
       +
                               copy(i) = copy(j)

     

       75
       75
       +
                               copy(j) = tmp

     

       76
       76
       +
                               found = .true.

     

       77
       77
       +
                               exit outer

     

       78
       78
       +
                            end if

     

       79
       79
       +
                         end do

     

       80
       80
       +
                      end if

     

       81
       81
       +
                   else

     

       82
       82
       +
                      exit outer

     

       83
       83
       +
                   end if

     

       84
       84
       +
                end do outer

     

       85
       85
       +
                if(.not. found) exit

     

       86
       86
       +
             end do

     

       87
       87
       +
             res = copy((size(copy) + 1)/2)

     

       88
       88
       +
             deallocate(copy)

     

       89
       89
       +
             if(allocated(work)) then

     

       90
       90
       +
                deallocate(work)

     

       91
       91
       +
             end if

     

       92
       92
       +
          end function fix_and_get_middle_value

     

       15
       93
        
       end module day_05_utils

     

       16
       94
        
       program day_05

     

       17
       95
        
          use day_05_utils

     

       18
       96
        
          implicit none

     

       19
       19
       -
          integer :: io, ios, idx, a, b, ct, i, j, res

     

       97
       97
       +
          integer :: io, ios, idx, a, b, ct, i, j, res, res_part2

     

       20
       98
        
          integer, allocatable :: left(:), right(:), print_list(:), work(:)

     

       21
       99
        
          character(len=100) ::line

     

       22
       100
        
          logical :: found

     

       23
       101
        
       

     

       24
       102
        
          open(newunit=io, file='./day_05_input.txt', status='old', action='read')

     

       25
       103
        
          res = 0

     

       104
       104
       +
          res_part2 = 0

     

       26
       105
        
          do

     

       27
       106
        
             read(io, '(a)', iostat=ios) line

     

       28
       107
        
             if(ios /= 0) exit !eof

     
···

       100
       179
        
                end do

     

       101
       180
        
                if (.not. found) then

     

       102
       181
        
                   res = res + print_list((size(print_list) + 1)/2)

     

       182
       182
       +
                else

     

       183
       183
       +
                   res_part2 = res_part2 + fix_and_get_middle_value(print_list, left, right)

     

       103
       184
        
                end if

     

       104
       104
       -
       

     

       105
       185
        
                deallocate(print_list)

     

       106
       186
        
             end if

     

       107
       187
        
          end do

     
···

       109
       189
        
          deallocate(left)

     

       110
       190
        
          deallocate(right)

     

       111
       191
        
          print*, "Result ", res

     

       192
       192
       +
          print*, "Part 2 Result ", res_part2

     

       112
       193
        
       end program day_05