1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
|
module day_08_utils
implicit none
type node
character :: c
integer, allocatable :: x(:), y(:)
end type node
contains
subroutine append_to_integer_array(arr, val)
implicit none
integer, allocatable, intent(inout) :: arr(:)
integer, intent(in) :: val
integer, allocatable :: temp(:)
if(.not. allocated(arr)) then
ERROR STOP 'Array not allocated'
end if
allocate(temp(size(arr) + 1))
temp(1:size(arr)) = arr
temp(size(arr) + 1) = val
call move_alloc(temp, arr)
end subroutine append_to_integer_array
subroutine add_node(nodes, c, x, y)
type(node), allocatable, intent(inout) :: nodes(:)
type(node), allocatable :: temp(:)
character, intent(in) :: c
integer, intent(in) :: x, y
integer :: i
do i = 1, size(nodes)
if (nodes(i)%c == c) then
if(.not. allocated(nodes(i)%x)) then
allocate(nodes(i)%x(1))
nodes(i)%x(1) = x
else
call append_to_integer_array(nodes(i)%x, x)
end if
if(.not. allocated(nodes(i)%y)) then
allocate(nodes(i)%y(1))
nodes(i)%y(1) = y
else
call append_to_integer_array(nodes(i)%y, y)
end if
return
end if
end do
allocate(temp(size(nodes) + 1))
temp(1:size(nodes)) = nodes
allocate(temp(size(nodes) + 1)%x(1))
allocate(temp(size(nodes) + 1)%y(1))
temp(size(nodes) + 1)%c = c
temp(size(nodes) + 1)%x(1) = x
temp(size(nodes) + 1)%y(1) = y
call move_alloc(temp, nodes)
end subroutine add_node
end module day_08_utils
program day_08
use day_08_utils
implicit none
character(len=50) :: lines(50)
integer :: io, i, j, k, l, score, xdist, ydist
integer, allocatable :: anti_x(:), anti_y(:)
type(node), allocatable :: nodes(:)
logical :: found
open(newunit=io, file='day_08_input.txt', status='old', action='read')
read(io, '(A)') lines
score = 0
do i = 1, 50
do j = 1, 50
if(lines(i)(j:j) /= '.') then
if(.not. allocated(nodes)) then
allocate(nodes(1))
nodes(1)%c = lines(i)(j:j)
allocate(nodes(1)%x(1))
allocate(nodes(1)%y(1))
nodes(1)%x(1) = j
nodes(1)%y(1) = i
else
call add_node(nodes, lines(i)(j:j), j, i)
end if
end if
end do
end do
do i = 1, size(nodes)
do j = 1, size(nodes(i)%x)
do l = 1, size(nodes(i)%x)
if(nodes(i)%x(j) == nodes(i)%x(l) .and. nodes(i)%y(j) == nodes(i)%y(l)) cycle ! don't compare same values
xdist = nodes(i)%x(j) - nodes(i)%x(l)
ydist = nodes(i)%y(j) - nodes(i)%y(l)
if(nodes(i)%x(j) + xdist > 0 .and. nodes(i)%x(j) + xdist <= 50 .and. &
nodes(i)%y(j) + ydist > 0 .and. nodes(i)%y(j) + ydist <= 50) then
if(.not. allocated(anti_x)) then
allocate(anti_x(1))
anti_x(1) = nodes(i)%x(j) + xdist
allocate(anti_y(1))
anti_y(1) = nodes(i)%y(j) + ydist
score = score + 1
else
found = .false.
do k = 1, size(anti_x)
if(anti_x(k) == nodes(i)%x(j) + xdist .and. anti_y(k) == nodes(i)%y(j) + ydist) then
found = .true.
exit
end if
end do
if(.not. found) then
call append_to_integer_array(anti_x, nodes(i)%x(j) + xdist)
call append_to_integer_array(anti_y, nodes(i)%y(j) + ydist)
score = score + 1
end if
end if
end if
if(nodes(i)%x(l) - xdist > 0 .and. nodes(i)%x(l) - xdist <= 50 .and. &
nodes(i)%y(l) - ydist > 0 .and. nodes(i)%y(l) - ydist <= 50) then
if(.not. allocated(anti_x)) then
allocate(anti_x(1))
anti_x(1) = nodes(i)%x(l) - xdist
allocate(anti_y(1))
anti_y(1) = nodes(i)%y(l) - ydist
score = score + 1
else
found = .false.
do k = 1, size(anti_x)
if(anti_x(k) == nodes(i)%x(l) - xdist .and. anti_y(k) == nodes(i)%y(l) - ydist) then
found = .true.
exit
end if
end do
if(.not. found) then
call append_to_integer_array(anti_x, nodes(i)%x(l) - xdist)
call append_to_integer_array(anti_y, nodes(i)%y(l) - ydist)
score = score + 1
end if
end if
end if
end do
end do
end do
print*, "Total : ", score
end program day_08
|
