ninewise/adventofcode-2021
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

day 24

Browse Source
This commit is contained in:
Felix Van der Jeugt 2021-12-28 09:49:39 +01:00
parent 0b6b3ede21
commit 9d5e6d8390
No known key found for this signature in database
GPG Key ID: 58B209295023754D
2 changed files with 82 additions and 102 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

132
day24/part1.lua
View File

@ -1,120 +1,50 @@
#!/usr/bin/env luajit #!/usr/bin/env luajit
require("utils") require("utils")
local function trunc(a) local blocks = {}
if a < 0 then local current = nil
return math.ceil(a) local f = io.open(arg[3])
else local line = f:read("*l")
return math.floor(a) while line do
end
end
local map = { w=1, x=2, y=3, z=4 }
local instructions = {}
for line in io.lines(arg[3]) do
local inst, a1, a2 = unpack(split(line, " ")) local inst, a1, a2 = unpack(split(line, " "))
if inst == "inp" then if inst == "inp" then
table.insert(instructions, function(memory, input) if current ~= nil then
local i, o = 9, memory[a1] current = string.format("return function(w, x, y, z, input)\n%s\nreturn w, x, y, z\nend", current)
return function() table.insert(blocks, assert(loadstring(current))())
if i > 1 then
i = i - 1
memory[a1] = i
return input * 10 + i
else
memory[a1] = o
end end
end current = a1.." = input"
end)
elseif inst == "add" then elseif inst == "add" then
table.insert(instructions, function(memory, input) current = string.format("%s\n%s = %s + %s", current, a1, a1, a2)
local done, o = false, memory[a1]
return function()
if not done then
memory[a1] = memory[a1] + (memory[a2] or tonumber(a2))
done = true
return input
else
memory[a1] = o
end
end
end)
elseif inst == "mul" then elseif inst == "mul" then
table.insert(instructions, function(memory, input) current = string.format("%s\n%s = %s * %s", current, a1, a1, a2)
local done, o = false, memory[a1]
return function()
if not done then
memory[a1] = memory[a1] * (memory[a2] or tonumber(a2))
done = true
return input
else
memory[a1] = o
end
end
end)
elseif inst == "div" then elseif inst == "div" then
table.insert(instructions, function(memory, input) current = string.format("%s\nif %s == 0 then return end\n%s = math.modf(%s / %s)", current, a2, a1, a1, a2)
local done, o = false, memory[a1]
return function()
if not done and (memory[a2] or tonumber(a2)) ~= 0 then
memory[a1] = trunc(memory[a1] / (memory[a2] or tonumber(a2)))
done = true
return input
else
memory[a1] = o
end
end
end)
elseif inst == "mod" then elseif inst == "mod" then
table.insert(instructions, function(memory, input) current = string.format("%s\nif %s < 0 or %s <= 0 then return end\n%s = %s %% %s", current, a1, a2, a1, a1, a2)
local done, o = false, memory[a1]
return function()
local v = memory[a2] or tonumber(a2)
if not done and memory[a1] >= 0 and v > 0 then
memory[a1] = memory[a1] % v
done = true
return input
else
memory[a1] = o
end
end
end)
elseif inst == "eql" then elseif inst == "eql" then
table.insert(instructions, function(memory, input) current = string.format("%s\nif %s == %s then %s = 1 else %s = 0 end", current, a1, a2, a1, a1)
local done, o = false, memory[a1]
return function()
if not done then
if memory[a1] == (memory[a2] or tonumber(a2)) then
memory[a1] = 1
else
memory[a1] = 0
end
done = true
return input
else
memory[a1] = o
end
end
end)
end end
line = f:read("*l")
end
if current ~= nil then
current = string.format("return function(w, x, y, z, input)\n%s\nreturn w, x, y, z\nend", current)
table.insert(blocks, assert(loadstring(current))())
end end
local maximum = 0 local function backtrack(i, w, x, y, z, output)
local function backtrack(i, memory, input) if i > #blocks then
if i == #instructions then if z == 0 then
if memory.z == 0 and input > maximum then print(string.format("%d", output))
print(input) os.exit()
print(os.date())
maximum = input
end end
else else
-- io.write("i "..tostring(i).." ") if i < 7 then print(output) end
-- printtable(memory) for n = 9, 1, -1 do
for newinput in instructions[i](memory, input) do local w0, x0, y0, z0 = blocks[i](w, x, y, z, n)
backtrack(i + 1, memory, newinput) if w0 then
backtrack(i + 1, w0, x0, y0, z0, output * 10 + n)
end
end end
end end
end end
backtrack(1, 0, 0, 0, 0, 0)
backtrack(1, { w=0, x=0, y=0, z=0 }, 0)
print(maximum)

50
day24/part2.lua Executable file
View File

@ -0,0 +1,50 @@
#!/usr/bin/env luajit
require("utils")
local blocks = {}
local current = nil
local f = io.open(arg[3])
local line = f:read("*l")
while line do
local inst, a1, a2 = unpack(split(line, " "))
if inst == "inp" then
if current ~= nil then
current = string.format("return function(w, x, y, z, input)\n%s\nreturn w, x, y, z\nend", current)
table.insert(blocks, assert(loadstring(current))())
end
current = a1.." = input"
elseif inst == "add" then
current = string.format("%s\n%s = %s + %s", current, a1, a1, a2)
elseif inst == "mul" then
current = string.format("%s\n%s = %s * %s", current, a1, a1, a2)
elseif inst == "div" then
current = string.format("%s\nif %s == 0 then return end\n%s = math.modf(%s / %s)", current, a2, a1, a1, a2)
elseif inst == "mod" then
current = string.format("%s\nif %s < 0 or %s <= 0 then return end\n%s = %s %% %s", current, a1, a2, a1, a1, a2)
elseif inst == "eql" then
current = string.format("%s\nif %s == %s then %s = 1 else %s = 0 end", current, a1, a2, a1, a1)
end
line = f:read("*l")
end
if current ~= nil then
current = string.format("return function(w, x, y, z, input)\n%s\nreturn w, x, y, z\nend", current)
table.insert(blocks, assert(loadstring(current))())
end
local function backtrack(i, w, x, y, z, output)
if i > #blocks then
if z == 0 then
print(string.format("%d", output))
os.exit()
end
else
if i < 7 then print(output) end
for n = 1, 9 do
local w0, x0, y0, z0 = blocks[i](w, x, y, z, n)
if w0 then
backtrack(i + 1, w0, x0, y0, z0, output * 10 + n)
end
end
end
end
backtrack(1, 0, 0, 0, 0, 0)