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

+142

2024/day_08.f90

···

       1
       1
       +
       module day_08_utils

     

       2
       2
       +
          implicit none

     

       3
       3
       +
          type node

     

       4
       4
       +
             character :: c

     

       5
       5
       +
             integer, allocatable :: x(:), y(:)

     

       6
       6
       +
          end type node

     

       7
       7
       +
       contains

     

       8
       8
       +
          subroutine append_to_integer_array(arr, val)

     

       9
       9
       +
             implicit none

     

       10
       10
       +
             integer, allocatable, intent(inout) :: arr(:)

     

       11
       11
       +
             integer, intent(in) :: val

     

       12
       12
       +
             integer, allocatable :: temp(:)

     

       13
       13
       +
             if(.not. allocated(arr)) then

     

       14
       14
       +
                ERROR STOP 'Array not allocated'

     

       15
       15
       +
             end if

     

       16
       16
       +
             allocate(temp(size(arr) + 1))

     

       17
       17
       +
             temp(1:size(arr)) = arr

     

       18
       18
       +
             temp(size(arr) + 1) = val

     

       19
       19
       +
             call move_alloc(temp, arr)

     

       20
       20
       +
          end subroutine append_to_integer_array

     

       21
       21
       +
       

     

       22
       22
       +
          subroutine add_node(nodes, c, x, y)

     

       23
       23
       +
             type(node), allocatable, intent(inout) :: nodes(:)

     

       24
       24
       +
             type(node), allocatable :: temp(:)

     

       25
       25
       +
             character, intent(in) :: c

     

       26
       26
       +
             integer, intent(in) :: x, y

     

       27
       27
       +
             integer :: i

     

       28
       28
       +
             do i = 1, size(nodes)

     

       29
       29
       +
                if (nodes(i)%c == c) then

     

       30
       30
       +
                   if(.not. allocated(nodes(i)%x)) then

     

       31
       31
       +
                      allocate(nodes(i)%x(1))

     

       32
       32
       +
                      nodes(i)%x(1) = x

     

       33
       33
       +
                   else

     

       34
       34
       +
                      call append_to_integer_array(nodes(i)%x, x)

     

       35
       35
       +
                   end if

     

       36
       36
       +
                   if(.not. allocated(nodes(i)%y)) then

     

       37
       37
       +
                      allocate(nodes(i)%y(1))

     

       38
       38
       +
                      nodes(i)%y(1) = y

     

       39
       39
       +
                   else

     

       40
       40
       +
                      call append_to_integer_array(nodes(i)%y, y)

     

       41
       41
       +
                   end if

     

       42
       42
       +
                   return

     

       43
       43
       +
                end if

     

       44
       44
       +
             end do

     

       45
       45
       +
             allocate(temp(size(nodes) + 1))

     

       46
       46
       +
             temp(1:size(nodes)) = nodes

     

       47
       47
       +
             allocate(temp(size(nodes) + 1)%x(1))

     

       48
       48
       +
             allocate(temp(size(nodes) + 1)%y(1))

     

       49
       49
       +
             temp(size(nodes) + 1)%c = c

     

       50
       50
       +
             temp(size(nodes) + 1)%x(1) = x

     

       51
       51
       +
             temp(size(nodes) + 1)%y(1) = y

     

       52
       52
       +
             call move_alloc(temp, nodes)

     

       53
       53
       +
          end subroutine add_node

     

       54
       54
       +
       end module day_08_utils

     

       55
       55
       +
       

     

       56
       56
       +
       program day_08

     

       57
       57
       +
          use day_08_utils

     

       58
       58
       +
          implicit none

     

       59
       59
       +
          character(len=50) :: lines(50)

     

       60
       60
       +
          integer :: io, i, j, k, l, score, xdist, ydist

     

       61
       61
       +
          integer, allocatable :: anti_x(:), anti_y(:)

     

       62
       62
       +
          type(node), allocatable :: nodes(:)

     

       63
       63
       +
          logical :: found

     

       64
       64
       +
       

     

       65
       65
       +
          open(newunit=io, file='day_08_input.txt', status='old', action='read')

     

       66
       66
       +
          read(io, '(A)') lines

     

       67
       67
       +
          score = 0

     

       68
       68
       +
          do i = 1, 50

     

       69
       69
       +
             do j = 1, 50

     

       70
       70
       +
                if(lines(i)(j:j) /= '.') then

     

       71
       71
       +
                   if(.not. allocated(nodes)) then

     

       72
       72
       +
                      allocate(nodes(1))

     

       73
       73
       +
                      nodes(1)%c = lines(i)(j:j)

     

       74
       74
       +
                      allocate(nodes(1)%x(1))

     

       75
       75
       +
                      allocate(nodes(1)%y(1))

     

       76
       76
       +
                      nodes(1)%x(1) = j

     

       77
       77
       +
                      nodes(1)%y(1) = i

     

       78
       78
       +
                   else

     

       79
       79
       +
                      call add_node(nodes, lines(i)(j:j), j, i)

     

       80
       80
       +
                   end if

     

       81
       81
       +
                end if

     

       82
       82
       +
             end do

     

       83
       83
       +
          end do

     

       84
       84
       +
          do i = 1, size(nodes)

     

       85
       85
       +
             do j = 1, size(nodes(i)%x)

     

       86
       86
       +
                do l = 1, size(nodes(i)%x)

     

       87
       87
       +
                   if(nodes(i)%x(j) == nodes(i)%x(l) .and. nodes(i)%y(j) == nodes(i)%y(l)) cycle ! don't compare same values

     

       88
       88
       +
                   xdist = nodes(i)%x(j) - nodes(i)%x(l)

     

       89
       89
       +
                   ydist = nodes(i)%y(j) - nodes(i)%y(l)

     

       90
       90
       +
                   if(nodes(i)%x(j) + xdist > 0 .and. nodes(i)%x(j) + xdist <= 50 .and. &

     

       91
       91
       +
                      nodes(i)%y(j) + ydist > 0 .and. nodes(i)%y(j) + ydist <= 50) then

     

       92
       92
       +
                      if(.not. allocated(anti_x)) then

     

       93
       93
       +
                         allocate(anti_x(1))

     

       94
       94
       +
                         anti_x(1) = nodes(i)%x(j) + xdist

     

       95
       95
       +
                         allocate(anti_y(1))

     

       96
       96
       +
                         anti_y(1) = nodes(i)%y(j) + ydist

     

       97
       97
       +
                         score = score + 1

     

       98
       98
       +
                      else

     

       99
       99
       +
                         found = .false.

     

       100
       100
       +
                         do k = 1, size(anti_x)

     

       101
       101
       +
                            if(anti_x(k) == nodes(i)%x(j) + xdist .and. anti_y(k) == nodes(i)%y(j) + ydist) then

     

       102
       102
       +
                               found = .true.

     

       103
       103
       +
                               exit

     

       104
       104
       +
                            end if

     

       105
       105
       +
                         end do

     

       106
       106
       +
                         if(.not. found) then

     

       107
       107
       +
                            call append_to_integer_array(anti_x, nodes(i)%x(j) + xdist)

     

       108
       108
       +
                            call append_to_integer_array(anti_y, nodes(i)%y(j) + ydist)

     

       109
       109
       +
       

     

       110
       110
       +
                            score = score + 1

     

       111
       111
       +
                         end if

     

       112
       112
       +
                      end if

     

       113
       113
       +
                   end if

     

       114
       114
       +
                   if(nodes(i)%x(l) - xdist > 0 .and. nodes(i)%x(l) - xdist <= 50 .and. &

     

       115
       115
       +
                      nodes(i)%y(l) - ydist > 0 .and. nodes(i)%y(l) - ydist <= 50) then

     

       116
       116
       +
                      if(.not. allocated(anti_x)) then

     

       117
       117
       +
                         allocate(anti_x(1))

     

       118
       118
       +
                         anti_x(1) = nodes(i)%x(l) - xdist

     

       119
       119
       +
                         allocate(anti_y(1))

     

       120
       120
       +
                         anti_y(1) = nodes(i)%y(l) - ydist

     

       121
       121
       +
                         score = score + 1

     

       122
       122
       +
                      else

     

       123
       123
       +
                         found = .false.

     

       124
       124
       +
                         do k = 1, size(anti_x)

     

       125
       125
       +
                            if(anti_x(k) == nodes(i)%x(l) - xdist .and. anti_y(k) == nodes(i)%y(l) - ydist) then

     

       126
       126
       +
                               found = .true.

     

       127
       127
       +
                               exit

     

       128
       128
       +
                            end if

     

       129
       129
       +
                         end do

     

       130
       130
       +
                         if(.not. found) then

     

       131
       131
       +
                            call append_to_integer_array(anti_x, nodes(i)%x(l) - xdist)

     

       132
       132
       +
                            call append_to_integer_array(anti_y, nodes(i)%y(l) - ydist)

     

       133
       133
       +
       

     

       134
       134
       +
                            score = score + 1

     

       135
       135
       +
                         end if

     

       136
       136
       +
                      end if

     

       137
       137
       +
                   end if

     

       138
       138
       +
                end do

     

       139
       139
       +
             end do

     

       140
       140
       +
          end do

     

       141
       141
       +
          print*, "Total : ", score

     

       142
       142
       +
       end program day_08

+164

2024/day_08_part_2.f90

···

       1
       1
       +
       module day_08_utils

     

       2
       2
       +
          implicit none

     

       3
       3
       +
          type node

     

       4
       4
       +
             character :: c

     

       5
       5
       +
             integer, allocatable :: x(:), y(:)

     

       6
       6
       +
          end type node

     

       7
       7
       +
       contains

     

       8
       8
       +
          subroutine append_to_integer_array(arr, val)

     

       9
       9
       +
             implicit none

     

       10
       10
       +
             integer, allocatable, intent(inout) :: arr(:)

     

       11
       11
       +
             integer, intent(in) :: val

     

       12
       12
       +
             integer, allocatable :: temp(:)

     

       13
       13
       +
             if(.not. allocated(arr)) then

     

       14
       14
       +
                ERROR STOP 'Array not allocated'

     

       15
       15
       +
             end if

     

       16
       16
       +
             allocate(temp(size(arr) + 1))

     

       17
       17
       +
             temp(1:size(arr)) = arr

     

       18
       18
       +
             temp(size(arr) + 1) = val

     

       19
       19
       +
             call move_alloc(temp, arr)

     

       20
       20
       +
          end subroutine append_to_integer_array

     

       21
       21
       +
       

     

       22
       22
       +
          subroutine add_node(nodes, c, x, y)

     

       23
       23
       +
             type(node), allocatable, intent(inout) :: nodes(:)

     

       24
       24
       +
             type(node), allocatable :: temp(:)

     

       25
       25
       +
             character, intent(in) :: c

     

       26
       26
       +
             integer, intent(in) :: x, y

     

       27
       27
       +
             integer :: i

     

       28
       28
       +
             do i = 1, size(nodes)

     

       29
       29
       +
                if (nodes(i)%c == c) then

     

       30
       30
       +
                   if(.not. allocated(nodes(i)%x)) then

     

       31
       31
       +
                      allocate(nodes(i)%x(1))

     

       32
       32
       +
                      nodes(i)%x(1) = x

     

       33
       33
       +
                   else

     

       34
       34
       +
                      call append_to_integer_array(nodes(i)%x, x)

     

       35
       35
       +
                   end if

     

       36
       36
       +
                   if(.not. allocated(nodes(i)%y)) then

     

       37
       37
       +
                      allocate(nodes(i)%y(1))

     

       38
       38
       +
                      nodes(i)%y(1) = y

     

       39
       39
       +
                   else

     

       40
       40
       +
                      call append_to_integer_array(nodes(i)%y, y)

     

       41
       41
       +
                   end if

     

       42
       42
       +
                   return

     

       43
       43
       +
                end if

     

       44
       44
       +
             end do

     

       45
       45
       +
             allocate(temp(size(nodes) + 1))

     

       46
       46
       +
             temp(1:size(nodes)) = nodes

     

       47
       47
       +
             allocate(temp(size(nodes) + 1)%x(1))

     

       48
       48
       +
             allocate(temp(size(nodes) + 1)%y(1))

     

       49
       49
       +
             temp(size(nodes) + 1)%c = c

     

       50
       50
       +
             temp(size(nodes) + 1)%x(1) = x

     

       51
       51
       +
             temp(size(nodes) + 1)%y(1) = y

     

       52
       52
       +
             call move_alloc(temp, nodes)

     

       53
       53
       +
          end subroutine add_node

     

       54
       54
       +
       end module day_08_utils

     

       55
       55
       +
       

     

       56
       56
       +
       program day_08

     

       57
       57
       +
          use day_08_utils

     

       58
       58
       +
          implicit none

     

       59
       59
       +
          character(len=50) :: lines(50)

     

       60
       60
       +
          integer :: io, i, j, k, l, score, xdist, ydist, next_x, next_y

     

       61
       61
       +
          integer, allocatable :: anti_x(:), anti_y(:)

     

       62
       62
       +
          type(node), allocatable :: nodes(:)

     

       63
       63
       +
          logical :: found

     

       64
       64
       +
       

     

       65
       65
       +
          open(newunit=io, file='day_08_input.txt', status='old', action='read')

     

       66
       66
       +
          read(io, '(A)') lines

     

       67
       67
       +
          score = 0

     

       68
       68
       +
          do i = 1, 50

     

       69
       69
       +
             do j = 1, 50

     

       70
       70
       +
                if(lines(i)(j:j) /= '.') then

     

       71
       71
       +
                   if(.not. allocated(nodes)) then

     

       72
       72
       +
                      allocate(nodes(1))

     

       73
       73
       +
                      nodes(1)%c = lines(i)(j:j)

     

       74
       74
       +
                      allocate(nodes(1)%x(1))

     

       75
       75
       +
                      allocate(nodes(1)%y(1))

     

       76
       76
       +
                      nodes(1)%x(1) = j

     

       77
       77
       +
                      nodes(1)%y(1) = i

     

       78
       78
       +
                   else

     

       79
       79
       +
                      call add_node(nodes, lines(i)(j:j), j, i)

     

       80
       80
       +
                   end if

     

       81
       81
       +
                end if

     

       82
       82
       +
             end do

     

       83
       83
       +
          end do

     

       84
       84
       +
          do i = 1, size(nodes)

     

       85
       85
       +
             do j = 1, size(nodes(i)%x)

     

       86
       86
       +
                if(.not. allocated(anti_x)) then

     

       87
       87
       +
                   allocate(anti_x(1))

     

       88
       88
       +
                   anti_x(1) = nodes(i)%x(j)

     

       89
       89
       +
                   allocate(anti_y(1))

     

       90
       90
       +
                   anti_y(1) = nodes(i)%y(j)

     

       91
       91
       +
                   score = score + 1

     

       92
       92
       +
                else

     

       93
       93
       +
                   found = .false.

     

       94
       94
       +
                   do k = 1, size(anti_x)

     

       95
       95
       +
                      if(anti_x(k) == nodes(i)%x(j) .and. anti_y(k) == nodes(i)%y(j)) then

     

       96
       96
       +
                         found = .true.

     

       97
       97
       +
                         exit

     

       98
       98
       +
                      end if

     

       99
       99
       +
                   end do

     

       100
       100
       +
                   if(.not. found) then

     

       101
       101
       +
                      call append_to_integer_array(anti_x, nodes(i)%x(j))

     

       102
       102
       +
                      call append_to_integer_array(anti_y, nodes(i)%y(j))

     

       103
       103
       +
       

     

       104
       104
       +
                      score = score + 1

     

       105
       105
       +
                   end if

     

       106
       106
       +
                end if

     

       107
       107
       +
                do l = 1, size(nodes(i)%x)

     

       108
       108
       +
                   if(nodes(i)%x(j) == nodes(i)%x(l) .and. nodes(i)%y(j) == nodes(i)%y(l)) cycle ! don't compare same values

     

       109
       109
       +
                   xdist = nodes(i)%x(j) - nodes(i)%x(l)

     

       110
       110
       +
                   ydist = nodes(i)%y(j) - nodes(i)%y(l)

     

       111
       111
       +
                   next_x = nodes(i)%x(j) + xdist

     

       112
       112
       +
                   next_y = nodes(i)%y(j) + ydist

     

       113
       113
       +
                   do

     

       114
       114
       +
                      if(next_x> 0 .and. next_x <= 50 .and. &

     

       115
       115
       +
                         next_y > 0 .and. next_y  <= 50) then

     

       116
       116
       +
                         found = .false.

     

       117
       117
       +
                         do k = 1, size(anti_x)

     

       118
       118
       +
                            if(anti_x(k) == next_x .and. anti_y(k) == next_y) then

     

       119
       119
       +
                               found = .true.

     

       120
       120
       +
                               exit

     

       121
       121
       +
                            end if

     

       122
       122
       +
                         end do

     

       123
       123
       +
                         if(.not. found) then

     

       124
       124
       +
                            call append_to_integer_array(anti_x, next_x)

     

       125
       125
       +
                            call append_to_integer_array(anti_y, next_y)

     

       126
       126
       +
       

     

       127
       127
       +
                            score = score + 1

     

       128
       128
       +
                         end if

     

       129
       129
       +
                         next_x = next_x + xdist

     

       130
       130
       +
                         next_y = next_y + ydist

     

       131
       131
       +
                      else

     

       132
       132
       +
                         exit

     

       133
       133
       +
                      end if

     

       134
       134
       +
                   end do

     

       135
       135
       +
                   next_x = nodes(i)%x(l) - xdist

     

       136
       136
       +
                   next_y = nodes(i)%y(l) - ydist

     

       137
       137
       +
                   do

     

       138
       138
       +
                      if(next_x > 0 .and. next_x  <= 50 .and. &

     

       139
       139
       +
                         next_y > 0 .and. next_y <= 50) then

     

       140
       140
       +
                         found = .false.

     

       141
       141
       +
                         do k = 1, size(anti_x)

     

       142
       142
       +
                            if(anti_x(k) == next_x .and. anti_y(k) == next_y) then

     

       143
       143
       +
                               found = .true.

     

       144
       144
       +
                               exit

     

       145
       145
       +
                            end if

     

       146
       146
       +
                         end do

     

       147
       147
       +
                         if(.not. found) then

     

       148
       148
       +
                            call append_to_integer_array(anti_x, next_x)

     

       149
       149
       +
                            call append_to_integer_array(anti_y, next_y)

     

       150
       150
       +
       

     

       151
       151
       +
                            score = score + 1

     

       152
       152
       +
                         end if

     

       153
       153
       +
                         next_x = next_x - xdist

     

       154
       154
       +
                         next_y = next_y - ydist

     

       155
       155
       +
       

     

       156
       156
       +
                      else

     

       157
       157
       +
                         exit

     

       158
       158
       +
                      end if

     

       159
       159
       +
                   end do

     

       160
       160
       +
                end do

     

       161
       161
       +
             end do

     

       162
       162
       +
          end do

     

       163
       163
       +
          print*, "Total : ", score

     

       164
       164
       +
       end program day_08