Advent of Code 2021: Casi no llegamos edition

kroaton #121 Dic '21 Le Connoisseur

Es un follón poniendo x, y ,z , a ,b ,c.... por eso yo les puse "aim" y "depth" y "horizontal", si no es fácil que te pase lo que te ha pasado.

desu #122 Dic '21

#104 Toma te lo he arreglado un poco.

spoiler

import java.util.List;
import java.util.function.Consumer;

public class Main {

  static class Submarine {
    int depth = 0;
    int horizontalPosition = 0;
    int aim = 0;

Consumer<Submarine> getMove(Action action) {
  return switch (action.dir) {
    case "forward" -> (Submarine s) -> applyForward(s, action.value);
    case "up" -> (Submarine s) ->applyUp(s, action.value);
    case "down" -> (Submarine s) ->applyDown(s, action.value);
    default -> throw new RuntimeException("upsyy te mamaste");
  };
}

private void applyDown(Submarine s, int value) {
  s.aim += value;
}

private void applyUp(Submarine s, int value) {
  s.aim -= value;
}

private void applyForward(Submarine s, int value) {
  s.horizontalPosition += value;
  s.depth += s.aim * value;
}
  }
  record Action(String dir, int value){}

  public static void main(String[] args) {
    var s = new Submarine();
    var input = List.of(
        new Action("forward", 5),
        new Action("down", 5),
        new Action("forward", 8),
        new Action("up", 3),
        new Action("down", 8),
        new Action("forward", 2)
    );

input.stream()
    .map(s::getMove)
    .forEach(m -> m.accept(s));

System.out.println(s.depth * s.horizontalPosition);
  }
}

#95 horrible, porque clonas? porque referencias? xq ese index...3 con el if? ese codigo no generaliza una mierda.

llevas 5 a;os intentando aprender rust y te veo aun con los hello worlds....

1 respuesta

Flashk #123 Dic '21

#122 Gracias XD De hecho estaba haciendo otra refactorización ahora, añadiendo Strategy.

Submarine

public class Submarine {

private final static String COMMAND_PATTERN = "(forward|down|up) ([0-9]*)";
private Pattern pattern = Pattern.compile(COMMAND_PATTERN);

private MovementStrategy movementStrategy;

public Submarine(MovementStrategy movementStrategy) {
	this.movementStrategy = movementStrategy;
}

public Integer solve(List<String> movements) {

	for(String movement : movements) {
		
		Matcher matcher = pattern.matcher(movement);
		matcher.find();

		String action = matcher.group(1);
		Integer value = Integer.valueOf(matcher.group(2));
		
		switch(action) {
			case "forward": movementStrategy.forward(value); break;
			case "down": movementStrategy.down(value); break;
			case "up": movementStrategy.up(value); break;
			default: break;
		}
		
	}

	return movementStrategy.getDepth() * movementStrategy.getHorizontalPosition();
}

public MovementStrategy getMovementStrategy() {
	return movementStrategy;
}

}

Abstract strategy

public abstract class MovementStrategy {

protected Integer depth = 0;
protected Integer horizontalPosition = 0;

public Integer getDepth() {
	return depth;
}

public Integer getHorizontalPosition() {
	return horizontalPosition;
}

abstract void up(Integer value);
abstract void down(Integer value);
abstract void forward(Integer value);

}

Basic movement

public class BasicMovementStrategy extends MovementStrategy {

protected void up(Integer value) {
	this.depth -= value;
}

protected void down(Integer value) {
	this.depth += value;
}

protected void forward(Integer value) {
	this.horizontalPosition += value;
}

}

Aim movement

public class AimMovementStrategy extends MovementStrategy {

private Integer aim = 0;

protected void up(Integer value) {
	this.aim -= value;
}

protected void down(Integer value) {
	 this.aim += value;
}

protected void forward(Integer value) {
	this.horizontalPosition += value;
	this.depth += aim * value;
}

}

3

PaCoX #124 Dic '21 Ant queen

Sobreingeniería y soberbia everywhere xDD

1 2 respuestas

Flashk #125 Dic '21

#124 o aburrimiento

desu #126 Dic '21

#124 cabron, havblo el que lo hace en visual basic.

yo he pilllado uno de java para ense;ar en stream cosas de java 17.

el que mas me ha gustado de momento de soluciones es el de sergio que hace for line in sys.stdin

un peque;o detallito pero me ha dado la idea de paralelizar todos mis codigos en stream y channels

tambien me ha dado la idea de hacer cosas con pipes y soluciones full unix

molaria hacerlos en "sh"

hda #127 Dic '21 Agujeros negros ( ͡° ͜ʖ ͡°)

Pues haciéndolo con números complejos because potato xD

spoiler

import pandas as pd

def instructionInterpreter(row):
    """


Parameters
----------
row : pandas dataframe row
    Row with composed instruction information and value.

Returns
-------
Value in complex form: forward imaginary part, up-down real part.

"""

instruction = row.instruction
value = row.value

if instruction=="forward":
    value = complex(0, value)
elif instruction=="down":
    value = complex(value, 0)
else:
    value = complex(-value, 0)
return value



dc = pd.read_csv("input.txt", delimiter=" ", header=None)
dc.rename(columns={0:"instruction",1:"value"}, inplace=True)

dc["complex"] = dc.apply(instructionInterpreter, axis=1)
answer1= dc["complex"].sum().real*dc["complex"].sum().imag



dc["aim"] = dc.complex.cumsum()
dc["depth"] = dc["aim"].apply(lambda x: x.real)*dc["complex"].apply(lambda x: x.imag)
answer2 = dc["depth"].sum()*dc["complex"].sum().imag

repo.

1 1 respuesta

B

[Borrado] #128 Dic '21

#127 hostia, me has recordado a cuando en los concursos de programación usábamos complejos para emular vectores porque era lo más cercano built-in que te podías encontrar en c++ , qué recuerdos

1 1 respuesta

hda #129 Dic '21 Agujeros negros ( ͡° ͜ʖ ͡°)

#128 ¡los números complejos son isomorfos a vectores bidimensionales!

6

hda #130 Dic '21 Agujeros negros ( ͡° ͜ʖ ͡°)

#127 ahora que lo pienso, podría ahorrarme una línea calculando el aim antes del answer1. Pero claro, como lo hice secuencial (respuesta1, respuesta2) no lo pensé. Así que lo dejo así.

Bueno, voy a seguir currando, que al final...

Lykaiast #131 Dic '21

Segundo día completado! Contenta pero con miedo de lo que podría llegar después...

Parte 1

            int verticalPosition = 0;
            int horizontalPosition = 0;
            string[] movementsString = File.ReadAllLines("movements.txt");

        foreach (string movement in movementsString)
        {
            string instruction = movement.Split(' ')[0];
            int instructionValue = int.Parse(movement.Split(' ')[1]);

            switch (instruction)
            {
                case "down":
                    verticalPosition -= instructionValue;
                    break;
                case "up":
                    verticalPosition += instructionValue;
                    break;
                default:
                    horizontalPosition += instructionValue;
                    break;
            }
        }

        Console.WriteLine("The result is " + Math.Abs(verticalPosition * horizontalPosition));

Parte 2

            int verticalPosition = 0;
            int horizontalPosition = 0;
            int aim = 0;

        string[] movementsString = File.ReadAllLines("movements.txt");

        foreach (string movement in movementsString)
        {
            string instruction = movement.Split(' ')[0];
            int instructionValue = int.Parse(movement.Split(' ')[1]);

            switch (instruction)
            {
                case "down":
                    aim += instructionValue;
                    break;
                case "up":
                    aim -= instructionValue;
                    break;
                default:
                    horizontalPosition += instructionValue;
                    verticalPosition += aim * instructionValue;
                    break;
            }
        }

        Console.WriteLine("The result is " + Math.Abs(verticalPosition * horizontalPosition));

1 respuesta

Ranthas #132 Dic '21

La sobreingeniería está muy bonita los primeros días, ya veremos cuando lleguen las matrices y las permutaciones

1 2 respuestas

hda #133 Dic '21 Agujeros negros ( ͡° ͜ʖ ͡°)

Me apena pensar que me voy a perder un chorro de días, además inminente, que serán supongo los fáciles. Malditas sean las vacaciones.

1 respuesta

desu #134 Dic '21

#131 un truco/patron

en el switch el default siempre se usa para detectar errores, tienes mi ejemplo y alguno mas por atras #122

imaginate que el dia de ma;ana te hacen a;adir una nueva direccion, te olvidas de cambiar el codigo del switch, tu codigo funcionara pero mal... con el switch te petara.

#132 cuando he revisado la lista antes me he dado cuenta de que muchos habituales ni han empezado este a;o... hacen bien...

1 1 respuesta

JonaN #135 Dic '21 Juntabrackets

#133 puedes hacerlos en cualquier momento, como si te haces todos el 24 de diciembre.

1

Unrack #136 Dic '21

Mi solución.

spoiler

with open('input.txt') as f:
    input = [el.strip("\n").split(" ") for el in f.readlines()]

x=0
y=0
aim=0
for command, value in input:
  value = int(value)
  if command == "forward":
    x+=value
  elif command == "up":
    y-=value
  elif command == "down":
    y+=value

print(f"Primera parte: {x*y}.")

x=0
y=0
aim=0
for command, value in input:
  value = int(value)
  if command == "up":
    aim-=value
  elif command == "down":
    aim+=value
  elif command == "forward":
    x+=value
    y+= aim * value

print(f"Segunda parte: {x*y}")

1 respuesta

Fyn4r #137 Dic '21 Inocente

#132 yo mañana dejo de hacer las mierdas que estoy haciendo que se me va la vida. Luego actualizo el repo, ya veras xd

wdaoajw #138 Dic '21

Ostia la sobreingenieria para los challenge estos, ayyy lmao

SnAk0 #139 Dic '21 Cofrade

Groovy

Dia 1

List<Integer> depths = Service.getList("day1")
		.collect { Integer.parseInt(it) }

partOne(depths)
partTwo(depths)

void partOne(List<Integer> depths) {
	int increasedDepths = 0
	depths.eachWithIndex { Integer depth, int i ->
		if (depth > depths[i - 1]) increasedDepths++
	}
	println increasedDepths
}

void partTwo(List<Integer> depths) {
	int increasedDepths = 0
	depths.eachWithIndex { Integer depth, int i ->
		if (!(depths[i + 1] && depths[i + 2] && depths[i + 3])) return
		int firstValue = depth + depths[i + 1] + depths[i + 2]
		int secondValue = depths[i + 1] + depths[i + 2] + depths[i + 3]
		if (secondValue > firstValue) increasedDepths++
	}
	println increasedDepths
}

Dia 2

List<String> movements = Service.getList("day2")

partOne(movements)
partTwo(movements)

void partOne(List<String> movements) {
	int horizontal = 0
	int depth = 0
	movements.each {
		String[] command = it.split(" ")
		String action = command[0]
		int value = Integer.parseInt(action[1])
		switch (action) {
			case "up": depth -= value; break
			case "down": depth += value; break
			case "forward": horizontal += value
		}
	}
	println horizontal * depth
}

void partTwo(List<String> movements) {
	int horizontal = 0
	int depth = 0
	int aim = 0
	movements.each {
		String[] command = it.split(" ")
		String action = command[0]
		int value = Integer.parseInt(action[1])
		switch (action) {
			case "up": aim -= value; break
			case "down": aim += value; break
			case "forward":
				horizontal += value
				depth += aim * value
		}
	}
	println horizontal * depth
}

Service

class Service {
	static List<String> getList(String fileName) {
		InputStream is = Service.class.getClassLoader().getResourceAsStream("input/" + fileName)
		is.readLines()
	}
}

1

GuaNaGe #140 Dic '21

Sigo en mi tesitura, sencillito, si alguien ve alguna cosilla a mejorar que lo diga, yo encantado de aprender.

Día 2

public class Qwerty2 {

public static void main(String[] args) {

	List<String> list = loadFile();
	System.out.println(resultPart1(list));
	System.out.println(resultPart2(list));
}

private static List<String> loadFile() {

	String fileName = "resources/input.txt";
	List<String> list = new ArrayList<>();

	try (Stream<String> stream = Files.lines(Paths.get(fileName))) {

		list = stream.collect(Collectors.toList());

	} catch (IOException e) {
		e.printStackTrace();
	}

	return list;

}

private static int resultPart1(List<String> list) {

	Integer depth = 0;
	Integer horizontal = 0;

	for (int i = 0; i < list.size(); i++) {
		if (list.get(i).contains("forward")) {
			horizontal += Character.getNumericValue(list.get(i).charAt(list.get(i).length() - 1));
		} else if (list.get(i).contains("down")) {
			depth += Character.getNumericValue(list.get(i).charAt(list.get(i).length() - 1));
		} else {
			depth -= Character.getNumericValue(list.get(i).charAt(list.get(i).length() - 1));
		}
	}

	return depth * horizontal;
}

private static int resultPart2(List<String> list) {

	Integer depth = 0;
	
	Integer horizontal = 0;
	Integer objetive = 0;

	for (int i = 0; i < list.size(); i++) {
		if (list.get(i).contains("forward")) {
			horizontal += Character.getNumericValue(list.get(i).charAt(list.get(i).length() - 1));
			depth += objetive*Character.getNumericValue(list.get(i).charAt(list.get(i).length() - 1));
		} else if (list.get(i).contains("down")) {
			objetive += Character.getNumericValue(list.get(i).charAt(list.get(i).length() - 1));
		} else {
			objetive -= Character.getNumericValue(list.get(i).charAt(list.get(i).length() - 1));
		}
	}

	return depth * horizontal;
}

}

PD: mmmm ¿Sería recomendado splitear en 2? o mejor recorrer una vez y extraer lo que te interese.

Ahora hago un for, si spliteo hago 2 verdad?

B

[Borrado] #141 Dic '21

.

KarlosWins #142 Dic '21

.

B

[Borrado] #143 Dic '21

Pongo aquí mi código en java del día 2 en spoiler:

Ejercicio 2a

import java.io.*;
 

public class Day2a {
 

public static void main(String[] args) throws Exception
{
 
    File file = new File(
        "C:\\Users\\supervisor\\Documents\\AdventofCode2.txt");

    BufferedReader br = new BufferedReader(new FileReader(file));
    
    int F=0, U=0, D=0, aux=0;
    String nuevo;
            
    while ((nuevo = br.readLine()) != null) {
    	if ((nuevo).substring(0,1).equals("f")) {
            aux = Integer.valueOf(nuevo.substring(8));
            F = F +aux;}
    	else if ((nuevo).substring(0,1).equals("u")) {
            aux = Integer.valueOf(nuevo.substring(3));
            U = U +aux;}
    	else {
            aux = Integer.valueOf(nuevo.substring(5));
            D = D +aux;}
 	}
    br.close();
    System.out.println("En horizontal se ha movido: "+F+". En vertical: "+(D-U)+". El resultado es: "+(F*(D-U))+".");
}
}

Ejercicio 2b

import java.io.*;
 

public class Day2b {
 

public static void main(String[] args) throws Exception
{
 
    File file = new File(
        "C:\\Users\\supervisor\\Documents\\AdventofCode2.txt");

    BufferedReader br = new BufferedReader(new FileReader(file));
    
    int F=0, D=0, aux=0, aim=0;
    String nuevo;
            
    while ((nuevo = br.readLine()) != null) {
    	if ((nuevo).substring(0,1).equals("f")) {
            aux = Integer.valueOf(nuevo.substring(8));
            F = F +aux;
            D = D + aux*aim;}
    	else if ((nuevo).substring(0,1).equals("u")) {
            aux = Integer.valueOf(nuevo.substring(3));
            aim = aim - aux;}
    	else {
            aux = Integer.valueOf(nuevo.substring(5));
            aim = aim + aux;}
    }
    br.close();
    System.out.println("En horizontal se ha movido: "+F+". En vertical: "+D+". El resultado es: "+F*D+".");
}
}

1

B

[Borrado] #144 Dic '21

Prueba 2.A

2.A

with open("input", "r") as inputfile:
    lines = inputfile.read().splitlines()

OPERS = {
    'forward': (1, 0),
    'down': (0, 1),
    'up': (0,-1),
}

pos = [0, 0]
for line in lines:
    (oper, amount) = line.split(" ")
    pos = [sum(vec) for vec in zip(pos, [i*int(amount) for i in OPERS[oper]])]
print(pos[0] * pos[1])

Prueba 2.B

2.B

with open("input", "r") as inputfile:
    lines = inputfile.read().splitlines()

hor, aim, depth = (0, 0, 0)
for line in lines:
    (oper, amount) = line.split(" ")
    amount = int(amount)
    if oper == "forward":
        hor += amount
        depth += aim * amount
    elif oper == "down":
        aim += amount
    elif oper == "up":
        aim -= amount
print(hor * depth)

1 respuesta

desu #145 Dic '21

#136 #144 el mismo consejito que he dado arriba

Os falta el else para excepciones y lograr así la función completamente definida sobre el input

A los novatillos como vosotros que estáis empezando os recomiendo que os grabéis el patrón a fuego en la mente

edit: para el dia 3 dos tecnicas interesantes

realizar un analisis de la frecuencia...
realizar un algoritmo de votacion boyer-moore

1 1 respuesta

BeheritSp #146 Dic '21 Juntabrackets

Farmeando puntos ahora que se puede:

Day 3

lines_list = [line for line in open('input.txt', 'r').read().splitlines()]
digits_list = [[line[i] for line in lines_list]  for i,_ in enumerate(lines_list[0])]
gamma = [max(digits, key=digits.count) for digits in digits_list]
eps = [min(digits, key=digits.count) for digits in digits_list]
print("Part 1:", int("".join(gamma),2)*int("".join(eps),2))

max_lines = [line for line in lines_list]
min_lines = [line for line in lines_list]
for i,_ in enumerate(lines_list[0]):
    max_digits=[line[i] for line in max_lines]
    min_digits=[line[i] for line in min_lines]
    max_common=max(max_digits, key=max_digits.count) if not max_digits.count("0") == max_digits.count("1") else "1"
    min_common=min(min_digits, key=min_digits.count) if not min_digits.count("0") == min_digits.count("1") else "0"
    if len(max_lines) > 1:
        max_lines = [line for line in max_lines if line[i] == max_common]
    if len(min_lines) > 1:
        min_lines = [line for line in min_lines if line[i] == min_common]
print("Part 2:", int("".join(max_lines[0]),2)*int("".join(min_lines[0]),2))

B

[Borrado] #147 Dic '21

Dia 3

spoiler

import sys

ones, nums = {}, []

for t, line in enumerate(sys.stdin):
  nums.append(''.join(x for x in reversed(line.strip())))
  for i, v in enumerate(nums[-1]):
    ones[i] = ones.get(i, 0) + int(v)

# part 1
max_len = max(ones.keys())

epsilon = sum((ones[b] > (t + 1 - ones[b])) * (2 ** b) for b in range(max_len + 1))
gamma = ~(epsilon) & (2 ** (max_len + 1) - 1)

print(epsilon * gamma)

# part 2
def filter_list(l, p, return_largest):
  if len(l) > 1:
    ones = [x for x in l if x & (2 ** p)]
    zeros = [x for x in l if not x & (2 ** p)]

if return_largest:
  return ones if len(ones) >= len(zeros) else zeros
return ones if len(ones) < len(zeros) else zeros
  return l


oxygen, co2 = [[int(''.join(reversed(num)), 2) for num in nums]] * 2

for b in range(max_len, -1, -1):
  oxygen, co2 = [filter_list(l, b, v) for (l, v) in [(oxygen, True), (co2, False)]]

print(oxygen[0] * co2[0])

Lykaiast #148 Dic '21

#134 Gracias! Trataré de aplicarlo

hda #149 Dic '21 Agujeros negros ( ͡° ͜ʖ ͡°)

Hoy no he usado complejos XD

Si usáis el método pandas.DataFrame.mode() cuidado al gestionar los empates.

Día 3

# -*- coding: utf-8 -*-
"""
Created on Fri Dec  3 07:51:39 2021
@author: backm
"""

import pandas as pd
import numpy as np

bd_in = np.loadtxt("input.txt", dtype=str)


cols = [f"pos{n}" for n in range(len(bd_in[0]))]
values = [[ns[n] for ns in bd_in] for n in range(len(bd_in[0]))]
df = pd.DataFrame.from_dict(dict(zip(cols, values)))

gamma_rate_bin = "".join(df.mode().loc[0].to_list())
epsilon_rate_bin = "".join("1" if x == "0" else "0" for x in gamma_rate_bin)

gamma_rate_dec = int(gamma_rate_bin, 2)
epsilon_rate_dec = int(epsilon_rate_bin, 2)


answer1 = gamma_rate_dec*epsilon_rate_dec


def bitCriteria(df, mode=True):
    """
    Parameters
    ----------
    df : pandas DataFrame
        Dataframe with bit encoded data per column
    mode : bool, optional
        result by mode (True) or by antimode (False). The default is True.
    Returns
    -------
    df_out : pandas DataFrame
        Filtered df as son as it contain only one row.
    """
    df_out = df.copy()
    for i in range(len(df.loc[0])):
        mode_filter = "1" if len(df_out[cols[i]].mode(
        ).values) > 1 else df_out[cols[i]].mode().values[0]
        if not mode:
            mode_filter = "0" if mode_filter == "1" else "1"
        df_filtered = df_out[df_out[cols[i]] == mode_filter]
        if len(df_filtered) >= 1:
            df_out = df_filtered
        else:
            break
    return df_out


oxigen_rating = bitCriteria(df, mode=True)
oxigen_rating_bin = "".join(oxigen_rating.iloc[0].to_list())
oxigen_rating_dec = int(oxigen_rating_bin, 2)


co2_rating = bitCriteria(df, mode=False)
co2_rating_bin = "".join(co2_rating.iloc[0].to_list())
co2_rating_dec = int(co2_rating_bin, 2)


answer2 = oxigen_rating_dec*co2_rating_dec

Cecos94 #150 Dic '21

Dia 3, se me ha complicado un poco la parte dos y he decidido hacerlo recurso

spoiler

override def part1(inputs: Seq[String]): Int = {
var maxNumber = ""
var minNumber = ""

(0 until inputs.head.length).foreach(indx => {
  val onesCount = inputs.count(_(indx).toString == "1")
  if (onesCount > inputs.length/2) {
    maxNumber = maxNumber + "1"
    minNumber = minNumber + "0"
  } else {
    maxNumber = maxNumber + "0"
    minNumber = minNumber + "1"
  }
})
decodeBinary(maxNumber) * decodeBinary(minNumber)

}

override def part2(inputs: Seq[String]): Int = {

println(getMostSimilarRecursive("O", inputs))

decodeBinary(getMostSimilarRecursive("O", inputs)) *
  decodeBinary(getMostSimilarRecursive("CO2", inputs))

}

private def decodeBinary(number: String): Int = {
number.reverse.zipWithIndex.filter(.1 == '1').map(a => math.pow(2, a._2)).sum.toInt
}

private def getMostSimilarRecursive(indicator:String, inputs: Seq[String], index: Int = 0): String = {
if(inputs.length == 1) inputs.head
else {
val onesCount = inputs.count(_(index).toString == "1")

  val whichIndicator: Boolean = if(indicator == "O") onesCount >= roundUp(inputs.length, 2)
  else onesCount < roundUp(inputs.length, 2)
   if (whichIndicator) {
      getMostSimilarRecursive(
        indicator,
        inputs.filter(_(index).toString == "1"),
        index + 1)
    } else {
      getMostSimilarRecursive(
        indicator,
        inputs.filter(_(index).toString == "0"),
        index + 1)
    }
}

}

private def roundUp(num: Int, divisor: Int): Int = (num + divisor - 1) / divisor

2.A

2.B

Usuarios habituales

Tags