-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
1 changed file
with
12 additions
and
77 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,81 +1,16 @@ | ||
| import string | ||
| import math as m, re | ||
|
|
||
| specchars = set(string.printable) - set(string.ascii_letters) - set("1234567890.") | ||
| board = list(open('Day03/input.txt')) | ||
| chars = {(r, c): [] for r in range(140) for c in range(140) | ||
| if board[r][c] not in '01234566789.'} | ||
|
|
||
| def part(candidate): | ||
| '''returns True is number is surrounded by a symbol. Expectes a candidate with | ||
| an x,y tuple for the start and end of the number''' | ||
| # print(candidate, candidate[2][0]) | ||
| if candidate[0][0] != 0: # left ends | ||
| leftend = grid[int(candidate[0][1])][int(candidate[0][0]) - 1] | ||
| if set(leftend).intersection(specchars): #we have a symbol | ||
| # print('leftend', candidate[1]) | ||
| return True | ||
| if candidate[2][0] != linelen-1: # right ends | ||
| rightend = grid[int(candidate[2][1])][int(candidate[2][0])] | ||
| if set(rightend).intersection(specchars): #we have a symbol | ||
| # print('rightend', candidate[1]) | ||
| return True | ||
| checkcells = [] | ||
| if candidate[0][1] != 0: # aboves | ||
| if candidate[0][0] != 0: # look above and left | ||
| if candidate[2][0] != linelen-1: # middle (+2) | ||
| for idx in range(candidate[2][0]-candidate[0][0]+2): | ||
| checkcells.append(grid[candidate[0][1]-1][candidate[0][0]+idx-1]) | ||
| else: # right hand end (+1 r) | ||
| for idx in range(candidate[2][0] - candidate[0][0]+1): | ||
| checkcells.append(grid[candidate[0][1]-1][candidate[0][0]+idx-1]) | ||
| else: #left hand end | ||
| for idx in range(candidate[2][0] - candidate[0][0]+1): | ||
| checkcells.append(grid[candidate[0][1]-1][candidate[0][0]+idx]) | ||
| for cell in checkcells: #now we check for symbols | ||
| if set(cell).intersection(specchars): # we have a symbol | ||
| # print('above', candidate[1]) | ||
| return True | ||
| checkcells = [] | ||
| if candidate[2][1] != gridheight-1: # belows | ||
| if candidate[0][0] != 0: # look above and left | ||
| if candidate[2][0] != linelen-1: # middle (+2) | ||
| for idx in range(candidate[2][0]-candidate[0][0]+2): | ||
| checkcells.append(grid[candidate[0][1]+1][candidate[0][0]+idx-1]) | ||
| else: # right hand end (+1 r) | ||
| for idx in range(candidate[2][0] - candidate[0][0]+1): | ||
| checkcells.append(grid[candidate[0][1]+1][candidate[0][0]+idx-1]) | ||
| else: #left hand end | ||
| for idx in range(candidate[2][0] - candidate[0][0]+1): | ||
| checkcells.append(grid[candidate[0][1]+1][candidate[0][0]+idx]) | ||
| for cell in checkcells: #now we check for symbols | ||
| if set(cell).intersection(specchars): # we have a symbol | ||
| # print('below', candidate[1]) | ||
| return True | ||
|
|
||
| with open('Day03/input.txt') as f: | ||
| grid = [list(line) for line in f] | ||
| linelen = len(grid[0]) | ||
| gridheight = len(grid) | ||
| # print(linelen, gridheight) | ||
| for r, row in enumerate(board): | ||
| for n in re.finditer(r'\d+', row): | ||
| edge = {(r, c) for r in (r-1, r, r+1) | ||
| for c in range(n.start()-1, n.end()+1)} | ||
|
|
||
| for o in edge & chars.keys(): | ||
| chars[o].append(int(n.group())) | ||
|
|
||
| # First we scan for sequences of numbers | ||
| partnos = [] | ||
|
|
||
| for idy, line in enumerate(grid): | ||
| candidate = [] | ||
| partial = '' | ||
| for idx, cell in enumerate(line): | ||
| if cell.isnumeric(): | ||
| if partial == '': # found the start of a candidate part number | ||
| candidate.append((idx, idy)) | ||
| partial+= cell | ||
| else: | ||
| if partial != '': # found the end of a candidate part number | ||
| candidate.append(partial) | ||
| candidate.append((idx, idy)) | ||
| partial = '' | ||
| # is it a part number? | ||
| if part(candidate): | ||
| partnos.append(int(candidate[1])) | ||
| candidate = [] | ||
|
|
||
|
|
||
| print('Part One:',sum(partnos)) | ||
| print('Part One:',sum(sum(p) for p in chars.values()), | ||
| 'Part Two:', sum(m.prod(p) for p in chars.values() if len(p)==2)) |