Day 6: Custom Customs

def parse(x):
    return x.rstrip()

def split(lines):
    res = []
    lin = []
    for line in lines:
        if line == "":
            res.append(lin)
            lin = []
        else:
            lin.append(set([x for x in line]))
    res.append(lin)
    return res

def one(lines):
    return sum(map(lambda g: len(set.union(*g)), lines))

def two(lines):
    return sum(map(lambda g: len(set.intersection(*g)), lines))


f = open("input", "r")

lines = [parse(x) for x in f]
lines = split(lines)

print("One: " + str(one(lines)))
print("Two: " + str(two(lines)))

#!/usr/bin/env ruby

require "set"

input = File.read(ARGV[0] || "test.txt")

groups = input.split("\n\n")

yes_answers = groups.map { |g| g.lines.reduce(Set.new) { |set, line| set | line.strip.chars } }

sum = yes_answers.reduce(0) { |sum, group| sum + group.size }

puts "Part 1"
puts sum

puts "Part 2"
yes_answers = groups.map { |g| g.lines.reduce(Set.new(g.lines.first.strip.chars)) { |set, line| set & line.strip.chars } }
sum = yes_answers.reduce(0) { |sum, group| sum + group.size }
puts sum

from functools import reduce

groups = [set()]
for line in sys.stdin.readlines():
    line = line[:-1]
    if line == '':
        groups.append(set())
    else:
        groups[-1] = groups[-1].union(set(list(line)))


print(reduce(lambda acc, s: len(s) + acc, groups, 0))

import sys
from functools import reduce

groups = []
newgroup = True
for line in sys.stdin.readlines():
    line = line[:-1]
    if line == '':
        newgroup = True
    elif newgroup:
        newgroup = False
        groups.append(set(list(line)))
    else:
        groups[-1] = groups[-1].intersection(set(list(line)))


print(reduce(lambda acc, s: len(s) + acc, groups, 0))

import sys
from functools import reduce

def parseGroup(g):
    answers = [set(list(a)) for a in g.split("\n") if a != '']
    return set.intersection(*answers)

groups = [parseGroup(g) for g in sys.stdin.read().split("\n\n")]
print(reduce(lambda acc, s: len(s) + acc, groups, 0))

defmodule Day6 do
  def one do
    File.read!("inputs/six.txt")
    |> String.split("\n\n")
    |> Enum.map(&String.replace(&1, "\n", "", global: true))
    |> Enum.map(&String.split(&1, "", trim: true))
    |> Enum.map(&MapSet.new(&1))
    |> Enum.map(&MapSet.size(&1))
    |> Enum.reduce(&(&1 + &2))
  end

  def two do
    File.read!("inputs/six.txt")
    |> String.split("\n\n")
    |> Enum.map(&String.split(&1, "\n", trim: true))
    |> Enum.map(&parse/1)
    |> Enum.map(&MapSet.size/1)
    |> Enum.reduce(&(&1 + &2))
  end

  def parse(input) do
    input
    |> Enum.map(&String.graphemes(&1))
    |> Enum.map(&MapSet.new(&1))
    |> Enum.reduce(&MapSet.intersection/2)
  end
end

For this I just made a group as I parsed through the entry, then I cast each group over to a set (which doesn't allow duplicates) and back to a list (which does). I typically use that method when I'm looking to find the unique entries within a list.

After that it was just a matter of adding everything together

database = input_data.split('\n')

group_list = []

current_group = []

def split(word): 
    return [char for char in word]  

for line in database:
    if line == '':
        group_list.append(list(set(current_group)))
        current_group = []
    else:
        for entry in split(line):
            current_group.append(entry)
group_list.append(list(set(current_group)))

count_sum = 0
for group in group_list:
    count_sum = count_sum + len(group)
print(count_sum)

Part B was a little bit more tricky, I had to rework my data structure a bit to track what each person individually said. Then I iterated through each letter and found ones that every person said yes to. It would probably be easier if I knew how to do an 'intersection' between the different lists.

import string

database = input_data.split('\n')

group_list = []

current_group = []

def split(word): 
    return [char for char in word]

def analyse_group(group):
    #print(group)
    all_contain = []
    for letter in list(string.ascii_lowercase):
        in_all = True
        for person in group:
            if letter in person:
                pass
            else:
                in_all = False
        if in_all == True:
            all_contain.append(letter)
    return all_contain

for line in database:
    if line == '':
        group_list.append(analyse_group(current_group))
        current_group = []
    else:
        person = []
        for entry in split(line):
            person.append(entry)
        current_group.append(person)
group_list.append(analyse_group(current_group))

count_sum = 0
for group in group_list:
    count_sum = count_sum + len(group)
print(count_sum)

• There are some similarities between this and day 4, at least in terms of how you read in the data. It can be helpful to reuse old code, or improve upon it if you've learned more since then

• Your groups will have duplicate entries. You'll need to deal with them in some way. There are multiple options. Some of them mathematical, some of them using programming tricks, and others may take a brute force approach of checking every letter

• For part A you only need to look at the group as a whole, but for part B it's necessary to look at each person individually and see how they compare to the rest of the group

• Reading up on the difference between data structures can be useful. I use python and so I was able to use the difference between a set and a list to do some of the heavy lifting for part A. They language you're using may let you do something similar

• If you want to do things more 'purely mathematically' you'll want to look up the term 'set theory' for the mathematical explanation or 'set operations [YOUR LANGUAGE]' for practical application

I just slap the characters to an (associative) array then add its length to the sum.

#!/usr/bin/awk -f
BEGIN { RS = "" }

{
	gsub(/[^a-z]/, "")
	split("", ans)

	split($0, c, "")
	for (i in c)
		ans[c[i]] = 1
	for (i in ans)
		sum += 1
}

END { print sum }

The same, but I add to the array's value and check if it's equal to the number of lines in the group.

#!/usr/bin/awk -f
BEGIN { RS = "" }

{
	num = gsub("\n", "") + 1
	split("", ans)

	split($0, c, "")
	for (i in c)
		ans[c[i]] += 1
	for (i in ans)
		if (ans[i] == num)
			sum += 1
}

END { print sum }

import Data.Function (on)
import Data.List (groupBy)
import qualified Data.Set as S
import           Data.Set (Set)

splitOnEmptyLines :: String -> [[String]]
splitOnEmptyLines = filter (not . any null) . groupBy ((==) `on` null) . lines

main = do
    answerSets <- ((fmap . fmap) S.fromList . splitOnEmptyLines) <$> getContents
    let countSetsFolded f = sum $ map (S.size . foldr1 f) answerSets
    print $ countSetsFolded S.union
    print $ countSetsFolded S.intersection

=ARRAYFORMULA(
  QUERY(
   UNIQUE(
    IFERROR(
     SPLIT(
      FLATTEN(
       IF(ISBLANK(A1:A),,
        VLOOKUP(
         ROW(A1:A),
         FILTER(
          ROW(INDIRECT("A1:A"&MAX(FILTER(ROW(A1:A),A1:A<>"")))),
          INDIRECT("A1:A"&MAX(FILTER(ROW(A1:A),A1:A<>"")))=""),
         1,TRUE)&
        "|"&
        SPLIT(
         IFERROR(
          REGEXREPLACE(
           ""&A1:A,
           "(.)",
           "$1,")),
         ","))),
      "|"))),
   "select Count(Col1) 
    where Col2 is not null 
    label Count(Col1) 'Part 1'",0))

const fs = require('fs');
const readline = require('readline');

let formArray = []

async function openFileForReading(file) {
	const fileStream = fs.createReadStream(file);

	const rl = readline.createInterface({
		input: fileStream,
		crlfDelay: Infinity
	});

	for await (const line of rl) {
		formArray.push(line);
	}
}

function parseInput(input) {
	let groupArray = [];
	let currentGroup = "";
	for (const line of input) {
		if (line.trim().length == 0) {
			groupArray.push(parseGroup(currentGroup.trim()));
			currentGroup = "";
		} else {
			currentGroup += " " + line;
		}
	}
	// flush the buffer, in case the file isn't newline-terminated
	if (currentGroup != "") {
		groupArray.push(parseGroup(currentGroup.trim()));
	}
	return groupArray;
}

function parseGroup(group) {
	let distinctAnswers = [];
	let answerBlocks = group.split(' ');
	for (const answers of answerBlocks) {
		for (const answer of answers) {
			if (distinctAnswers.indexOf(answer) == -1) {
				distinctAnswers.push(answer);
			}
		}
	}
	return distinctAnswers;
}

(async function mainExecution() {
	await openFileForReading('input.txt');
	console.log(parseInput(formArray).map(form => { return form.length }).reduce((a,b) => { return a + b }));
})();

const fs = require('fs');
const readline = require('readline');

let formArray = []

async function openFileForReading(file) {
	const fileStream = fs.createReadStream(file);

	const rl = readline.createInterface({
		input: fileStream,
		crlfDelay: Infinity
	});

	for await (const line of rl) {
		formArray.push(line);
	}
}

function parseInput(input) {
	let groupArray = [];
	let currentGroup = "";
	for (const line of input) {
		if (line.trim().length == 0) {
			groupArray.push(parseGroup(currentGroup.trim()));
			currentGroup = "";
		} else {
			currentGroup += " " + line;
		}
	}
	// flush the buffer, in case the file isn't newline-terminated
	if (currentGroup != "") {
		groupArray.push(parseGroup(currentGroup.trim()));
	}
	return groupArray;
}

function parseGroup(group) {
	let everyoneAnswers = [];
	let firstBlock = true;
	let answerBlocks = group.split(' ');
	for (const answers of answerBlocks) {
		if (firstBlock) {
			for (const answer of answers) {
				everyoneAnswers.push(answer);
			}
			firstBlock = false;
		} else {
			for (const sharedAnswer of everyoneAnswers) {
				if (everyoneAnswers.length == 0) {
					break;
				}
				if (answers.indexOf(sharedAnswer) == -1) {
					let popIndex = everyoneAnswers.indexOf(sharedAnswer);
					everyoneAnswers = everyoneAnswers.slice(0, popIndex).concat(everyoneAnswers.slice(popIndex+1));
				}
			}
		}
	}
	return everyoneAnswers;
}

(async function mainExecution() {
	await openFileForReading('input.txt');
	console.log(parseInput(formArray).map(form => { return form.length }).reduce((a,b) => { return a + b }));
})();

#!/usr/local/bin/csi -s
(import
 (chicken format)
 (chicken io)
 (srfi 1)
 (srfi 14))

(define (read-group #!optional (port (current-input-port)))
  (let loop ((answers '())
             (line (read-line port)))
    (if (or (eof-object? line) (string=? line ""))
        answers
        (loop (cons (string->char-set line) answers) (read-line port)))))

(define (read-groups #!optional (port (current-input-port)))
  (let loop ((groups '()))
    (let ((new-group (read-group port)))
      (if (null? new-group)
          groups
          (loop (cons new-group groups))))))

(define (solve reduce-op groups)
  (fold (lambda (group total)
          (+ total (char-set-size (reduce reduce-op (char-set) group))))
        0 groups))

(define (solve1 groups) (solve char-set-union groups))
(define (solve2 groups) (solve char-set-intersection groups))

(define input (read-groups))
(printf "Part 1: ~A~%" (solve1 input))
(printf "Part 2: ~A~%" (solve2 input))

function main()

    # Read input the lazy way
    input = nothing
    open("Day06/input.txt") do fp
        input = split(readchomp(fp), "\n\n")
    end

    # Clean up input and map deploy our function
    answers = map(x -> split(x, '\n'), input)
    result_1 = sum(count_yes.(answers))
    println("Part 1 result is ", result_1)


end

# Add every answer to a set, unique yes answers are the length
function count_yes(answer)
    questions = Set()
    for response in answer
        for question in response
            push!(questions, question)
        end
    end
    return length(questions)
end

main()

@@ -11,7 +11,8 @@ function main()
     result_1 = sum(count_yes.(answers))
     println("Part 1 result is ", result_1)
 
-
+    result_2 = sum(count_unanimous.(answers))
+    println("Part 2 result is ", result_2)
 
 end
 
@@ -26,4 +27,17 @@ function count_yes(answer)
     return length(questions)
 end
 
+# Add answers from each person to a set and intersect to get unanimity
+function count_unanimous(answer)
+    clean_responses = []
+    for response in answer
+        clean_response = Set()
+        for question in response
+            push!(clean_response, question)
+        end
+        push!(clean_responses, clean_response)
+    end
+    return length(intersect(clean_responses...))
+end
+
 main()

# Ryzen 5
BenchmarkTools.Trial: 
  memory estimate:  13.08 MiB
  allocs estimate:  242404
  --------------
  minimum time:     154.777 ms (0.00% GC)
  median time:      164.188 ms (0.00% GC)
  mean time:        165.455 ms (1.37% GC)
  maximum time:     182.480 ms (4.63% GC)
  --------------
  samples:          31
  evals/sample:     1

# Ras Pi
BenchmarkTools.Trial:
  memory estimate:  13.08 MiB
  allocs estimate:  242385
  --------------
  minimum time:     1.090 s (0.00% GC)
  median time:      1.102 s (0.00% GC)
  mean time:        1.109 s (0.83% GC)
  maximum time:     1.144 s (4.02% GC)
  --------------
  samples:          5
  evals/sample:     1

Overall an impressive showing for the Pi, given that it's max power is 12 times less than idle consumption on my desktop!

# Ryzen 5
BenchmarkTools.Trial: 
  memory estimate:  2.74 MiB
  allocs estimate:  36358
  --------------
  minimum time:     3.591 ms (0.00% GC)
  median time:      4.389 ms (0.00% GC)
  mean time:        4.484 ms (2.45% GC)
  maximum time:     10.671 ms (0.00% GC)
  --------------
  samples:          1116
  evals/sample:     1

# Ras Pi
BenchmarkTools.Trial: 
  memory estimate:  2.74 MiB
  allocs estimate:  36358
  --------------
  minimum time:     36.082 ms (0.00% GC)
  median time:      36.734 ms (0.00% GC)
  mean time:        38.169 ms (2.43% GC)
  maximum time:     57.162 ms (26.49% GC)
  --------------
  samples:          131
  evals/sample:     1

use std::env;
use std::io;
use std::collections::HashMap;

extern crate itertools;
use itertools::Itertools;

fn day06(input: &str) -> io::Result<()> {
    
    // Part 1
    let part1: usize = std::fs::read_to_string(input)
        .unwrap()
        .split("\n\n")
        .map(|group| group.replace("\n","").chars().unique().count())
        .sum();

    println!("Part 1: {}", part1); // 6532

    // Part 2
    let mut ans: Vec<HashMap<char,usize>> = Vec::new();
    let input_str = std::fs::read_to_string(input).unwrap();
    let answers: Vec<_> = input_str.split("\n\n").collect();

    let mut part2 = 0;
    for (i,group) in answers.iter().enumerate() {
        ans.push(HashMap::new());
        let group_size = &group.split("\n").collect::<Vec<_>>().len();
        for person in group.split("\n") {
            for a in person.chars() {
                *ans[i].entry(a).or_insert(0) += 1;
            }
        }
        part2 += ans[i].iter().filter(|(_,v)| v == &group_size).count();
    }

    println!("Part 2: {}", part2); // 3427

    Ok(())
}

fn main() {
    let args: Vec<String> = env::args().collect();
    let filename = &args[1];
    day06(&filename).unwrap();
}

rawinput = open("day6input", 'r')

groups = []
form = {}

group_count = 1
new_group = True

for line in rawinput:
    if new_group == True:
        form['members'] = 0
        groups.append(form)

    if  len(line) == 1:
        group_count += 1
        new_group = True
        form = {}
    else:
        form['members'] = form['members'] + 1
        new_group = False
        for answer in line:
            if answer == '\n':
                break
            if answer in form:
                form[answer] = form[answer] + 1
            else:
                form[answer] = 1

group_sum = 0
for form in groups:
    group_sum += len(form) - 1
print(group_sum)

unanimous_group_sum = 0
for form in groups:
    unanimous_answers = -1
    for answer in form:
        if form[answer] == form['members']:
            unanimous_answers += 1
    unanimous_group_sum += unanimous_answers
print(unanimous_group_sum)

defmodule AdventOfCode.Day06 do
  def part1(args) do
    count_yeses(args, &group_to_union_set/1)
  end

  def part2(args) do
    count_yeses(args, &group_to_intersection_set/1)
  end

  defp count_yeses(input, set_builder) do
    input
    |> parse_groups()
    |> Enum.map(set_builder)
    |> Enum.map(&MapSet.size/1)
    |> Enum.sum()
  end

  defp parse_groups(input) do
    input
    |> String.trim()
    |> String.split("\n\n")
  end

  defp group_to_union_set(group) do
    group
    |> String.replace(~r|[^a-z]|, "")
    |> String.to_charlist()
    |> MapSet.new()
  end

  defp group_to_intersection_set(group) do
    group
    |> String.split()
    |> Enum.map(&String.to_charlist/1)
    |> Enum.map(&MapSet.new/1)
    |> Enum.reduce(&MapSet.intersection/2)
  end
end

Each part is solved by simply calling a count_yeses function that counts the total number of "yes" responses, given the following arguments: 1) the input string, and 2) a function¹ that builds the appropriate set for each customs declaration.

count_yeses takes the input, and pipes it through the following operations (think of this like an assembly line where each operation takes the result of the previous one):

1. Split into separate strings for each group of people: string -> list(string)
2. Apply the given set_builder function to each group: list(string) -> list(set)
3. Get the number of elements in each set: list(set) -> list(integer)
4. Sum everything up: list(integer) -> integer

group_to_union_set collects all the characters in a single group and creates one set out of them. This is the same as creating a set for each line and then union-ing them all together.

group_to_intersection_set puts the characters on each line of a group into a set, then intersects them together to get the overall intersection.

¹ In order to pass a named function rather than calling it in elixir, you need to use the & function capture operator. Functions are also distinguished by their arity (number of arguments taken), so you also need to include that to uniquely identify it: &function_name/arity.

groupAnswersList = open('day6_input.txt').read().split('\n\n')
print(sum([len(set(groupAnswers.replace('\n', ''))) for groupAnswers in groupAnswersList]))

print(sum([len(set.intersection(*[ set(answers) for answers in groupAnswers.split('\n')])) for groupAnswers in groupAnswersList ]))

use std::io;
use std::io::prelude::*;

use std::collections::{HashSet, HashMap};

fn group_lines(lines: &Vec<String>) -> Vec<Vec<String>> {
    let mut groups = Vec::new();

    let mut current_group = Vec::new();

    for l in lines.iter() {
        if l.len() == 0 {
            groups.push(current_group);
            current_group = Vec::new();
        } else {
            current_group.push(l.clone());
        }
    }

    if current_group.len() > 0 {
        groups.push(current_group);
    }

    groups
}

fn unique_answers_in_group(group: &Vec<String>) -> usize {
    let mut hashset = HashSet::new();

    for line in group.iter() {
        for c in line.chars() {
            hashset.insert(c);
        }
    }

    hashset.len()
}

fn unanimous_answers_in_group(group: &Vec<String>) -> usize {
    let mut map = HashMap::new();

    for line in group.iter() {
        for c in line.chars() {
            if let Some(x) = map.get_mut(&c) {
                *x = *x + 1;
            } else {
                map.insert(c, 1);
            }
        }
    }

    map
        .iter()
        .filter(|(_, v)| **v == group.len())
        .map(|(k, _)| k)
        .count()
}


fn main() {
    let stdin = io::stdin();
    let lines: Vec<String> = stdin
        .lock()
        .lines()
        .collect::<Result<_, _>>()
        .unwrap();

    let grouped_lines = group_lines(&lines);

    let part1_ans: usize = grouped_lines
        .iter()
        .map(unique_answers_in_group)
        .sum();
    let part2_ans: usize = grouped_lines
        .iter()
        .map(unanimous_answers_in_group)
        .sum();

    println!("Part 1: {}", part1_ans);
    println!("Part 2: {}", part2_ans);
}