Completed day 12 part 1... part 2 is still computing :/

aforgiel · Dec 13, 2023 · 866601d · 866601d
1 parent fd5122f
commit 866601d
Show file tree

Hide file tree

Showing 11 changed files with 4,994 additions and 77 deletions.
diff --git a/AdventOfCodeDay11/AdventOfCodeDay11.cpp b/AdventOfCodeDay11/AdventOfCodeDay11.cpp
@@ -228,52 +228,31 @@ Map::ExpandCoordinates(std::map<int, int>& coordinates, int max, int increment)
 		it1 = coordinates.find(value);
 		if (it1 == coordinates.end())
 		{
-#if COMMENT == true
-			printf("\t%d:", value);
-#endif
 			for (expended = value + 1; expended <= max; expended++)
 			{
 				it2 = coordinates.find(expended);
 				if (it2 != coordinates.end())
 				{
 					it2->second += increment;
-#if COMMENT == true
-					printf(" %d=>%d", expended, it2->second);
-#endif
 				}
 			}
-#if COMMENT == true
-			printf("\n");
-#endif
 		}
 	}
 }
 
-
 int64_t
 Map::FindSolution(int increment)
 {
 	int64_t result = 0;
 
 	for (int i = 0; i < 2; i++)
-	{
-#if COMMENT == true
-		printf("Expension of %s\n", i == X ? "X" : "Y");
-#endif
 		ExpandCoordinates(coordinates[i], max[i], increment);
-	}
 
 	int i, j;
 
 	for (i = 0; i < (galaxies.size() - 1); i++)
 		for (j = i + 1; j < galaxies.size(); j++)
-		{
-#if COMMENT == true
-			printf("[%d,%d] ", i + 1, j + 1);
-			printf("%d\n", Distance(galaxies[i], galaxies[j]));
-#endif
 			result += Distance(galaxies[i], galaxies[j]);
-		}
 
 	return result;
 }