This repository was archived by the owner on Dec 2, 2025. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy paths.py
More file actions
96 lines (87 loc) · 2.08 KB
/
s.py
File metadata and controls
96 lines (87 loc) · 2.08 KB
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
# Youtube: https://youtu.be/f_0m98v2tQ8
import argparse, math, sys, re, functools, operator, itertools, heapq
from collections import defaultdict, Counter, deque
#sys.setrecursionlimit(100000000)
#A = list(map(int, input().split()))
#T = int(input())
def read_lines(f):
while True:
line = f.readline()
if not line:
break
assert line[-1] == '\n'
yield line[:-1]
def main():
parser = argparse.ArgumentParser()
parser.add_argument('-1', '--one', action='store_true', help='Only part 1')
parser.add_argument('-2', '--two', action='store_true', help='Only part 2')
parser.add_argument('input_file', nargs='?')
args = parser.parse_args()
if args.input_file is not None:
f = open(args.input_file)
else:
f = sys.stdin
lines = list(read_lines(f))
if not args.two:
print(part_1(lines))
if not args.one:
print(part_2(lines))
def part_1(lines):
s = 0
conn = set()
for i in lines:
conn.add(tuple(i.split('-')))
for i, j in conn:
assert (j, i) not in conn
nodes = set()
for i, j in conn:
nodes.add(i)
nodes.add(j)
for i, j in conn:
for k in nodes:
if i <= k or j <= k:
continue
if not ((i, k) in conn or (k, i) in conn):
continue
if not ((j, k) in conn or (k, j) in conn):
continue
if i.startswith('t') or j.startswith('t') or k.startswith('t'):
s += 1
return s
def part_2(lines):
s = 0
conn = set()
for i in lines:
conn.add(tuple(i.split('-')))
for i, j in conn:
assert (j, i) not in conn
nodes = set()
for i, j in conn:
nodes.add(i)
nodes.add(j)
#print(len(conn), len(nodes))
adj_list = defaultdict(set)
for i, j in conn:
adj_list[i].add(j)
adj_list[j].add(i)
parties = []
# Initialize with size-2 parties
for i in conn:
parties.append(tuple(sorted(i)))
# Increase gradually
while True:
new_parties = []
for i in parties:
n = functools.reduce(set.intersection, map(adj_list.__getitem__, i))
for j in n:
if j > i[-1]:
new_parties.append(i + (j,))
if new_parties:
parties = new_parties
else:
assert len(parties) == 1
s = ','.join(parties[0])
break
return s
if __name__ == '__main__':
main()