Day 13 initial commit

Author: mathiassteger

input0.txt

@@ -1,7 +1,4 @@
-0 <-> 2
-1 <-> 1
-2 <-> 0, 3, 4
-3 <-> 2, 4
-4 <-> 2, 3, 6
-5 <-> 6
-6 <-> 4, 5
+0: 3
+1: 2
+4: 4
+6: 4

input13.txt

@@ -0,0 +1,43 @@
+0: 3
+1: 2
+2: 4
+4: 4
+6: 5
+8: 6
+10: 8
+12: 8
+14: 6
+16: 6
+18: 9
+20: 8
+22: 6
+24: 10
+26: 12
+28: 8
+30: 8
+32: 14
+34: 12
+36: 8
+38: 12
+40: 12
+42: 12
+44: 12
+46: 12
+48: 14
+50: 12
+52: 12
+54: 10
+56: 14
+58: 12
+60: 14
+62: 14
+64: 14
+66: 14
+68: 14
+70: 14
+72: 14
+74: 20
+78: 14
+80: 14
+90: 17
+96: 18

src/day12/Main.java

@@ -1,88 +1,111 @@
 package day12;
 
 import java.util.ArrayList;
-import java.util.HashMap;
-import java.util.HashSet;
+import java.util.Arrays;
 
 import util.ReadInputHelper;
 
 public class Main {
 	public static void main(String[] args) {
-		ArrayList<String> lines = new ReadInputHelper(12).getLines();
+		ArrayList<String> lines = new ReadInputHelper(13).getLines();
 
-		HashMap<Integer, ArrayList<Integer>> map = new HashMap<>();
+		ArrayList<Wall> walls = new ArrayList<>();
 
+		int max = 0;
 		for (int i = 0; i < lines.size(); i++) {
-			String[] parts = lines.get(i).split(" <-> ");
-			Integer id = Integer.parseInt(parts[0]);
-			String[] fStrings = parts[1].split(", ");
-			ArrayList<Integer> followers = new ArrayList<>();
+			String[] line = lines.get(i).split(": ");
+			int name = Integer.parseInt(line[0]);
+			if (name > max)
+				max = name;
+			walls.add(new Wall(Integer.parseInt(line[0]), i, Integer.parseInt(line[1])));
+		}
+
+		int sum = 0;
+		loop: while (true) {
+			for (int i = 0; true; i++) {
+				int time = sum + i;
+				int index = walls.indexOf(new Wall(i, 0, -1));
+
+				if (index == -1) {
+					continue;
+				}
 
-			for (int j = 0; j < fStrings.length; j++) {
-				followers.add(Integer.parseInt(fStrings[j]));
+				Wall wall = walls.get(index);
+
+				if (wall.getSpos(time) == 0) {
+					sum++;
+					break;
+				}
+
+				if (wall.name >= max) {
+					break loop;
+				}
 			}
-			map.put(i, followers);
+
 		}
-		int counter = 0;
-		ArrayList<HashSet<Integer>> groups = new ArrayList<>();
+		System.out.println(sum);
+	}
+}
 
-		for (int j = 0; j < map.size(); j++) {
-			ArrayList<Integer> stack = new ArrayList<>();
+class Wall {
+	public int name, depth, size, spos = 0;
+	boolean reachedTop = false;
+	int[] sps;
+	int ceil;
 
-			stack.add(j);
-			HashSet<Integer> used = new HashSet<>();
-			while (!stack.isEmpty()) {
+	public Wall(int name, int depth, int size) {
+		this.name = name;
+		this.depth = depth;
+		this.size = size;
 
-				ArrayList<Integer> fs = map.get(stack.remove(0));
+		if (size != -1) {
+			sps = new int[size + size - 2];
+			initSPos();
+		}
+	}
 
-				if (fs.size() > 0 && fs != null)
-					for (int i = 0; i < fs.size(); i++) {
-						if (!used.contains(fs.get(i))) {
-							stack.add(fs.get(i));
-						}
+	public void incScanner() {
+		if (size - 1 == spos)
+			reachedTop = true;
+		if (spos == 0)
+			reachedTop = false;
 
-						used.add(fs.get(i));
-					}
+		if (!reachedTop)
+			spos++;
+		else
+			spos--;
 
-//				if (stack.contains(0)) {
-//					counter++;
-//					break;
-//				}
-			}
+	}
 
-			groups.add(used);
+	public boolean equals(Object o) {
+		Wall other = (Wall) o;
+		return name == other.name;
+	}
+
+	public void reset() {
+		spos = 0;
+	}
+
+	public void initSPos() {
+		int end1 = size-2;
+		int counter = size-2;
+		for (int i = 0; i < end1; i++){
+			sps[i] = counter--;
 		}
 
-		groups.forEach(e -> {
-			System.out.println(e.toString());
-		});
-		
-		System.out.println();
-		System.out.println();
-		
-		ArrayList<HashSet<Integer>> rslt = new ArrayList<>();
-
-		for (int i = 0; i < groups.size(); i++) {
-			HashSet<Integer> starter = groups.get(i);
-			for (int j = 0; j < groups.size(); j++) {
-				if (groups.get(j) != starter)
-					if (groups.get(j).containsAll(starter))
-						starter.clear();
-			}
-		}
-
-		for (int i = 0; i < groups.size(); i++) {
-			if(groups.get(i).size() > 0){
-				rslt.add(groups.get(i));
-			}
+		counter = 0;
+		for(int i = end1; i < sps.length;i++){
+			sps[i] = counter++;
 		}
 
-		rslt.forEach(e -> {
-			System.out.println(e.toString());
-		});
+		System.out.println(Arrays.toString(sps));
+	}
 
-		System.out.println(counter);
-		System.out.println(rslt.size());
+	public int getSpos(int index) {
+		if (size == 2)
+			return index % 2;
+		else
+			return Math.abs(sps[(index + size-2) % sps.length]);
 	}
 
-}
+}

src/day13/Main.java

@@ -0,0 +1,17 @@
+package day13;
+
+import java.util.ArrayList;
+import java.util.HashMap;
+
+import util.ReadInputHelper;
+
+public class Main {
+	public static void main(String[] args) {
+		ArrayList<String> lines = new ReadInputHelper(12).getLines();
+
+		HashMap<Integer, ArrayList<Integer>> map = new HashMap<>();
+
+		for (int i = 0; i < lines.size(); i++) {
+		}
+	}
+}