90 lines
2.6 KiB
Python
Executable File
90 lines
2.6 KiB
Python
Executable File
#!/usr/bin/python3
|
|
"""
|
|
Jour 13 du défi Advent Of Code pour l'année 2023
|
|
"""
|
|
import os
|
|
|
|
def read_sample():
|
|
"""récupère les entrées depuis le fichier texte correspondant"""
|
|
filename = os.path.join(os.path.dirname(__file__ ), "inputs", "day13.txt")
|
|
with open(filename, 'r') as f:
|
|
sample = f.read().split('\n\n')
|
|
sample = [ [[k for k in j] for j in i.split('\n') if j != ''] for i in sample if i != '' ]
|
|
return sample
|
|
|
|
def eq(sample, i, j, transp=False):
|
|
if not transp:
|
|
if sample[i] == sample[j]:
|
|
return 0
|
|
return sum([1 for k in range(len(sample[0])) if sample[i][k] != sample[j][k]])
|
|
sm = 0
|
|
for k in range(len(sample)):
|
|
if sample[k][i] != sample[k][j]:
|
|
sm += 1
|
|
return sm
|
|
|
|
def find_reflections(pattern, smudge=0):
|
|
reflections = []
|
|
|
|
for i in range(0, len(pattern)): # is line i first of refl ?
|
|
sm = 0
|
|
for j in range(i+1):
|
|
if i-j >= 0 and i+j-1 < len(pattern):
|
|
sm += eq(pattern, i-j, i+j-1)
|
|
if sm == smudge:
|
|
reflections.append((0, i))
|
|
break
|
|
|
|
for i in range(0, len(pattern[0])): # is col i first of refl ?
|
|
sm = 0
|
|
for j in range(i+1):
|
|
if i-j >= 0 and i+j-1 < len(pattern[0]):
|
|
sm += eq(pattern, i-j, i+j-1, transp=True)
|
|
if sm == smudge:
|
|
reflections.append((1, i))
|
|
break
|
|
|
|
return reflections
|
|
|
|
def score(refls):
|
|
sum = 0
|
|
for j in refls:
|
|
if j[0] == 1:
|
|
sum += j[1]
|
|
else:
|
|
sum += j[1]*100
|
|
return sum
|
|
|
|
|
|
def part1(sample):
|
|
"""Partie 1 du défi"""
|
|
refls = [score(find_reflections(i)) for i in sample]
|
|
return sum(refls)
|
|
|
|
def part2(sample):
|
|
"""Partie 2 du défi"""
|
|
def diff(line1, line2):
|
|
return sum([1 for i in range(len(line1)) if line1[i] != line2[i]])
|
|
|
|
def transpose(pattern):
|
|
return [[pattern[j][i] for j in range(len(pattern))] for i in range(len(pattern[0]))]
|
|
|
|
def h_reflects(pattern, smudge=1):
|
|
nb = 0
|
|
for i in range(len(pattern)):
|
|
total_diff = sum((diff(pattern[i-j], pattern[i+j-1]) for j in range(len(pattern[0])) if i-j >= 0 and i+j-1 < len(pattern) and i+j-1 > 0 and i-j < i+j-1))
|
|
if total_diff == smudge:
|
|
nb += i
|
|
return nb
|
|
|
|
return sum((h_reflects(pattern) for pattern in sample))*100 + sum((h_reflects(transpose(pattern)) for pattern in sample))
|
|
|
|
|
|
def main():
|
|
"""Fonction principale"""
|
|
sample = read_sample()
|
|
print(f"part1: {part1(sample)}")
|
|
print(f"part2: {part2(sample)}")
|
|
|
|
if __name__ == "__main__":
|
|
main() |