aoc2015

commit db99c61b388768e429d1a50b4227c6d36cb1a1b8
parent 89d7940725ecc7ea7113615a492beac12bf61e0a
Author: Samir Parikh <noreply@samirparikh.com>
Date:   Fri, 28 Oct 2022 13:27:08 +0000

solve part 2 of day09 and cleanup code

Diffstat:
M
day09/day09.pl
 | 
19
++++---------------

1 file changed, 4 insertions(+), 15 deletions(-)
diff --git a/day09/day09.pl b/day09/day09.pl
@@ -5,10 +5,7 @@ use strict;
 use warnings;
 use v5.32;
 use Algorithm::Permute;
-use List::Util qw( min );
-#use Data::Dumper;
-#use lib '.';
-#use Day07 qw< evaluate >;
+use List::Util qw( min max );
 
 @ARGV = "input" unless @ARGV;
 chomp( my $input = do { local $/; <> } );
@@ -19,7 +16,6 @@ my @route_distances;
 
 foreach ( split /\n/, $input ) {
     my ( $from, $to, $distance ) = m/(\w+) to (\w+) = (\d+)/;
-    #say "$from\t$to\t$distance";
     $distances{ $from, $to } = $distance;
     $distances{ $to, $from } = $distance;
     $cities{ $from } += 1;
@@ -28,20 +24,13 @@ foreach ( split /\n/, $input ) {
 
 my @cities = keys %cities;
 
-#say Dumper \%distances;
-#say Dumper \%cities;
-#say "@cities";
-
 Algorithm::Permute::permute {
-#    print "next permutation: ", join ("->", @cities), "\n";
     my $distance = 0;
-    foreach my $i ( 0 .. ( scalar @cities ) - 2 ) {
-#        say $i;
-        $distance += $distances{ $cities[ $i ], $cities[ $i + 1 ] };
+    foreach ( 0 .. ( scalar @cities ) - 2 ) {
+        $distance += $distances{ $cities[ $_ ], $cities[ $_ + 1 ] };
     }
-#    say join (" -> ", @cities), " = ", $distance;
     push @route_distances => $distance;
 } @cities;
 
-
 say "part 1: ", min @route_distances;
+say "part 2: ", max @route_distances;