bcc/adventofcode2018
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

days 5-11

Browse source
This commit is contained in:
Ben Charlton 2018-12-11 21:39:38 +00:00
parent d3ae65f625
commit 1d2d5def97
18 changed files with 804 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

66
7/1.pl Normal file
View file

@ -0,0 +1,66 @@
#!/usr/bin/perl
use strict;
use v5.10;
use Data::Dumper;
chomp (my @data = <STDIN>);
my %deps;
my %steps;
foreach my $line (sort @data) {
my ($dep, $step) = ($line =~ /Step (\S+) must be finished before step (\S+) can begin\./);
say "$dep, $step";
if (exists $deps{$step}) {
my $t = $deps{$step};
push @$t, $dep;
$deps{$step} = $t;
} else {
my @add = ($dep);
$deps{$step} = \@add;
}
$steps{$dep}=0;
$steps{$step}=0;
}
my @final;
while (my @doable = find_nextsteps(\%deps) ) {
my $first = $doable[0];
mark_complete($first, \%deps);
push @final, $first;
}
say join "", @final;
sub mark_complete {
my ($step, $deps) = @_;
# complete task.
$steps{$step} = 1;
# remove from dep list.
foreach my $s (sort keys %$deps) {
my @tasks = @{$$deps{$s}};
@tasks = grep {!/$step/} @tasks;
if ($#tasks > -1) {
$$deps{$s} = \@tasks;
} else {
delete $$deps{$s};
}
}
}
sub find_nextsteps {
my ($deps) = @_;
# find next.
my @doable;
foreach my $s (sort keys %steps) {
next if ($steps{$s} == 1);
if (!$$deps{$s}) {
push @doable, $s;
}
}
return sort @doable;
}

110
7/2.pl Normal file
View file

@ -0,0 +1,110 @@
#!/usr/bin/perl
use strict;
use v5.10;
use Data::Dumper;
my $timeoffset = 60;
my $workers = 5;
# set up time delay...
my %time;
foreach my $n ('A'..'Z') {
$time{$n} = $timeoffset + ord($n)-64;
}
chomp (my @data = <STDIN>);
my %deps;
my %steps;
foreach my $line (sort @data) {
my ($dep, $step) = ($line =~ /Step (\S+) must be finished before step (\S+) can begin\./);
say "$dep, $step";
if (exists $deps{$step}) {
my $t = $deps{$step};
push @$t, $dep;
$deps{$step} = $t;
} else {
my @add = ($dep);
$deps{$step} = \@add;
}
$steps{$dep}=0;
$steps{$step}=0;
}
my @final;
my %workercurrent;
my %workertime;
my $totaltime = 0;
while ( !check_complete() ) {
my @doable = find_nextsteps(\%deps);
foreach my $w (1...$workers) {
say "worker $w, $workercurrent{$w} $workertime{$w}";
if ($workertime{$w} <= 1 && $workercurrent{$w}) {
mark_complete($workercurrent{$w}, \%deps);
push @final, $workercurrent{$w};
$workercurrent{$w} = undef;
}
if (!$workercurrent{$w}) {
if (my $next = pop @doable) {
say "adding... w:$w t:$next";
$steps{$next} = 2;
$workercurrent{$w} = $next;
$workertime{$w} = $time{$next};
}
}
$workertime{$w}--;
}
$totaltime++;
}
say join "", @final;
say $totaltime;
sub check_complete {
foreach my $k (keys %steps) {
say "check: $k $steps{$k}";
if ($steps{$k} != 1) {
return 0;
}
}
return 1;
}
sub mark_complete {
my ($step, $deps) = @_;
# complete task.
$steps{$step} = 1;
# remove from dep list.
foreach my $s (sort keys %$deps) {
my @tasks = @{$$deps{$s}};
@tasks = grep {!/$step/} @tasks;
if ($#tasks > -1) {
$$deps{$s} = \@tasks;
} else {
delete $$deps{$s};
}
}
}
sub find_nextsteps {
my ($deps) = @_;
# find next.
my @doable;
foreach my $s (sort keys %steps) {
next if ($steps{$s} > 0);
if (!$$deps{$s}) {
push @doable, $s;
}
}
return sort @doable;
}

7
7/sample.txt Normal file
View file

@ -0,0 +1,7 @@
Step C must be finished before step A can begin.
Step C must be finished before step F can begin.
Step A must be finished before step B can begin.
Step A must be finished before step D can begin.
Step B must be finished before step E can begin.
Step D must be finished before step E can begin.
Step F must be finished before step E can begin.