Added solution for "Day 9: Mirage Maintenance", part 1
This commit is contained in:
parent
f1b1439524
commit
f69d60e5db
|
@ -69,6 +69,10 @@
|
||||||
<Filename Value="UNumberTheory.pas"/>
|
<Filename Value="UNumberTheory.pas"/>
|
||||||
<IsPartOfProject Value="True"/>
|
<IsPartOfProject Value="True"/>
|
||||||
</Unit>
|
</Unit>
|
||||||
|
<Unit>
|
||||||
|
<Filename Value="solvers\UMirageMaintenance.pas"/>
|
||||||
|
<IsPartOfProject Value="True"/>
|
||||||
|
</Unit>
|
||||||
</Units>
|
</Units>
|
||||||
</ProjectOptions>
|
</ProjectOptions>
|
||||||
<CompilerOptions>
|
<CompilerOptions>
|
||||||
|
|
|
@ -26,7 +26,7 @@ uses
|
||||||
Classes, SysUtils, CustApp,
|
Classes, SysUtils, CustApp,
|
||||||
USolver,
|
USolver,
|
||||||
UTrebuchet, UCubeConundrum, UGearRatios, UScratchcards, UGiveSeedFertilizer, UWaitForIt, UCamelCards,
|
UTrebuchet, UCubeConundrum, UGearRatios, UScratchcards, UGiveSeedFertilizer, UWaitForIt, UCamelCards,
|
||||||
UHauntedWasteland, UNumberTheory;
|
UHauntedWasteland, UNumberTheory, UMirageMaintenance;
|
||||||
|
|
||||||
type
|
type
|
||||||
|
|
||||||
|
@ -59,6 +59,7 @@ begin
|
||||||
engine.RunAndFree(TWaitForIt.Create);
|
engine.RunAndFree(TWaitForIt.Create);
|
||||||
engine.RunAndFree(TCamelCards.Create);
|
engine.RunAndFree(TCamelCards.Create);
|
||||||
engine.RunAndFree(THauntedWasteland.Create);
|
engine.RunAndFree(THauntedWasteland.Create);
|
||||||
|
engine.RunAndFree(TMirageMaintenance.Create);
|
||||||
engine.Free;
|
engine.Free;
|
||||||
end;
|
end;
|
||||||
|
|
||||||
|
|
|
@ -0,0 +1,136 @@
|
||||||
|
{
|
||||||
|
Solutions to the Advent Of Code.
|
||||||
|
Copyright (C) 2023 Stefan Müller
|
||||||
|
|
||||||
|
This program is free software: you can redistribute it and/or modify it under
|
||||||
|
the terms of the GNU General Public License as published by the Free Software
|
||||||
|
Foundation, either version 3 of the License, or (at your option) any later
|
||||||
|
version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful, but WITHOUT
|
||||||
|
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
||||||
|
FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU General Public License along with
|
||||||
|
this program. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
}
|
||||||
|
|
||||||
|
unit UMirageMaintenance;
|
||||||
|
|
||||||
|
{$mode ObjFPC}{$H+}
|
||||||
|
|
||||||
|
interface
|
||||||
|
|
||||||
|
uses
|
||||||
|
Classes, SysUtils, Generics.Collections, USolver;
|
||||||
|
|
||||||
|
type
|
||||||
|
|
||||||
|
{ TMirageMaintenance }
|
||||||
|
|
||||||
|
TMirageMaintenance = class(TSolver)
|
||||||
|
private
|
||||||
|
FN: Integer;
|
||||||
|
FLagrangePolynomialsInN: specialize TList<Int64>;
|
||||||
|
procedure CalcLagrangePolynomials;
|
||||||
|
public
|
||||||
|
constructor Create;
|
||||||
|
destructor Destroy; override;
|
||||||
|
procedure ProcessDataLine(const ALine: string); override;
|
||||||
|
procedure Finish; override;
|
||||||
|
function GetDataFileName: string; override;
|
||||||
|
function GetPuzzleName: string; override;
|
||||||
|
end;
|
||||||
|
|
||||||
|
implementation
|
||||||
|
|
||||||
|
{ TMirageMaintenance }
|
||||||
|
|
||||||
|
procedure TMirageMaintenance.CalcLagrangePolynomials;
|
||||||
|
var
|
||||||
|
sign, i, j: Integer;
|
||||||
|
begin
|
||||||
|
FLagrangePolynomialsInN.Clear;
|
||||||
|
if FN mod 2 = 0 then
|
||||||
|
sign := -1
|
||||||
|
else
|
||||||
|
sign := 1;
|
||||||
|
|
||||||
|
// Calculates the polynomials in N and -1.
|
||||||
|
for i := 0 to FN - 1 do
|
||||||
|
begin
|
||||||
|
FLagrangePolynomialsInN.Add(sign);
|
||||||
|
sign := -sign;
|
||||||
|
|
||||||
|
if i < FN - FN div 2 then
|
||||||
|
begin
|
||||||
|
// Multiplies by the non-cancelled numerator terms.
|
||||||
|
for j := FN - i + 1 to FN do
|
||||||
|
FLagrangePolynomialsInN[i] := FLagrangePolynomialsInN[i] * j;
|
||||||
|
// Divides by the non-cancelled denominator terms.
|
||||||
|
for j := 2 to i do
|
||||||
|
FLagrangePolynomialsInN[i] := FLagrangePolynomialsInN[i] div j;
|
||||||
|
end
|
||||||
|
else begin
|
||||||
|
// Multiplies by the non-cancelled numerator terms.
|
||||||
|
for j := i + 1 to FN do
|
||||||
|
FLagrangePolynomialsInN[i] := FLagrangePolynomialsInN[i] * j;
|
||||||
|
// Divides by the non-cancelled over-counted numerator term.
|
||||||
|
FLagrangePolynomialsInN[i] := FLagrangePolynomialsInN[i] div (FN - i);
|
||||||
|
// Divides by the non-cancelled denominator terms.
|
||||||
|
for j := 2 to FN - i - 1 do
|
||||||
|
FLagrangePolynomialsInN[i] := FLagrangePolynomialsInN[i] div j;
|
||||||
|
end;
|
||||||
|
end;
|
||||||
|
end;
|
||||||
|
|
||||||
|
constructor TMirageMaintenance.Create;
|
||||||
|
begin
|
||||||
|
FLagrangePolynomialsInN := specialize TList<Int64>.Create;
|
||||||
|
FN := 0;
|
||||||
|
end;
|
||||||
|
|
||||||
|
destructor TMirageMaintenance.Destroy;
|
||||||
|
begin
|
||||||
|
FLagrangePolynomialsInN.Free;
|
||||||
|
inherited Destroy;
|
||||||
|
end;
|
||||||
|
|
||||||
|
procedure TMirageMaintenance.ProcessDataLine(const ALine: string);
|
||||||
|
var
|
||||||
|
split: TStringArray;
|
||||||
|
i, y: Integer;
|
||||||
|
p: Int64;
|
||||||
|
begin
|
||||||
|
split := ALine.Split(' ');
|
||||||
|
if Length(split) <> FN then
|
||||||
|
begin
|
||||||
|
FN := Length(split);
|
||||||
|
CalcLagrangePolynomials;
|
||||||
|
end;
|
||||||
|
|
||||||
|
for i := 0 to FN - 1 do
|
||||||
|
begin
|
||||||
|
y := StrToInt(split[i]);
|
||||||
|
p := y * FLagrangePolynomialsInN[i];
|
||||||
|
Inc(FPart1, p);
|
||||||
|
end;
|
||||||
|
end;
|
||||||
|
|
||||||
|
procedure TMirageMaintenance.Finish;
|
||||||
|
begin
|
||||||
|
|
||||||
|
end;
|
||||||
|
|
||||||
|
function TMirageMaintenance.GetDataFileName: string;
|
||||||
|
begin
|
||||||
|
Result := 'mirage_maintenance.txt';
|
||||||
|
end;
|
||||||
|
|
||||||
|
function TMirageMaintenance.GetPuzzleName: string;
|
||||||
|
begin
|
||||||
|
Result := 'Day 9: Mirage Maintenance';
|
||||||
|
end;
|
||||||
|
|
||||||
|
end.
|
||||||
|
|
|
@ -76,6 +76,10 @@
|
||||||
<Filename Value="UHauntedWastelandTestCases.pas"/>
|
<Filename Value="UHauntedWastelandTestCases.pas"/>
|
||||||
<IsPartOfProject Value="True"/>
|
<IsPartOfProject Value="True"/>
|
||||||
</Unit>
|
</Unit>
|
||||||
|
<Unit>
|
||||||
|
<Filename Value="UMirageMaintenanceTestCases.pas"/>
|
||||||
|
<IsPartOfProject Value="True"/>
|
||||||
|
</Unit>
|
||||||
</Units>
|
</Units>
|
||||||
</ProjectOptions>
|
</ProjectOptions>
|
||||||
<CompilerOptions>
|
<CompilerOptions>
|
||||||
|
|
|
@ -5,7 +5,7 @@ program AdventOfCodeFPCUnit;
|
||||||
uses
|
uses
|
||||||
Interfaces, Forms, GuiTestRunner, USolver, UBaseTestCases, UTrebuchetTestCases, UCubeConundrumTestCases,
|
Interfaces, Forms, GuiTestRunner, USolver, UBaseTestCases, UTrebuchetTestCases, UCubeConundrumTestCases,
|
||||||
UGearRatiosTestCases, UScratchcardsTestCases, UGiveSeedFertilizerTestCases, UWaitForItTestCases, UCamelCardsTestCases,
|
UGearRatiosTestCases, UScratchcardsTestCases, UGiveSeedFertilizerTestCases, UWaitForItTestCases, UCamelCardsTestCases,
|
||||||
UHauntedWastelandTestCases;
|
UHauntedWastelandTestCases, UMirageMaintenanceTestCases;
|
||||||
|
|
||||||
{$R *.res}
|
{$R *.res}
|
||||||
|
|
||||||
|
|
|
@ -0,0 +1,89 @@
|
||||||
|
{
|
||||||
|
Solutions to the Advent Of Code.
|
||||||
|
Copyright (C) 2023 Stefan Müller
|
||||||
|
|
||||||
|
This program is free software: you can redistribute it and/or modify it under
|
||||||
|
the terms of the GNU General Public License as published by the Free Software
|
||||||
|
Foundation, either version 3 of the License, or (at your option) any later
|
||||||
|
version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful, but WITHOUT
|
||||||
|
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
|
||||||
|
FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU General Public License along with
|
||||||
|
this program. If not, see <http://www.gnu.org/licenses/>.
|
||||||
|
}
|
||||||
|
|
||||||
|
unit UMirageMaintenanceTestCases;
|
||||||
|
|
||||||
|
{$mode ObjFPC}{$H+}
|
||||||
|
|
||||||
|
interface
|
||||||
|
|
||||||
|
uses
|
||||||
|
Classes, SysUtils, fpcunit, testregistry, USolver, UBaseTestCases, UMirageMaintenance;
|
||||||
|
|
||||||
|
type
|
||||||
|
|
||||||
|
{ TMirageMaintenanceFullDataTestCase }
|
||||||
|
|
||||||
|
TMirageMaintenanceFullDataTestCase = class(TEngineBaseTest)
|
||||||
|
protected
|
||||||
|
function CreateSolver: ISolver; override;
|
||||||
|
published
|
||||||
|
procedure TestPart1;
|
||||||
|
procedure TestPart2;
|
||||||
|
end;
|
||||||
|
|
||||||
|
{ TMirageMaintenanceExampleTestCase }
|
||||||
|
|
||||||
|
TMirageMaintenanceExampleTestCase = class(TExampleEngineBaseTest)
|
||||||
|
protected
|
||||||
|
function CreateSolver: ISolver; override;
|
||||||
|
published
|
||||||
|
procedure TestPart1;
|
||||||
|
procedure TestPart2;
|
||||||
|
end;
|
||||||
|
|
||||||
|
implementation
|
||||||
|
|
||||||
|
{ TMirageMaintenanceFullDataTestCase }
|
||||||
|
|
||||||
|
function TMirageMaintenanceFullDataTestCase.CreateSolver: ISolver;
|
||||||
|
begin
|
||||||
|
Result := TMirageMaintenance.Create;
|
||||||
|
end;
|
||||||
|
|
||||||
|
procedure TMirageMaintenanceFullDataTestCase.TestPart1;
|
||||||
|
begin
|
||||||
|
AssertEquals(1877825184, FSolver.GetResultPart1);
|
||||||
|
end;
|
||||||
|
|
||||||
|
procedure TMirageMaintenanceFullDataTestCase.TestPart2;
|
||||||
|
begin
|
||||||
|
AssertEquals(-1, FSolver.GetResultPart2);
|
||||||
|
end;
|
||||||
|
|
||||||
|
{ TMirageMaintenanceExampleTestCase }
|
||||||
|
|
||||||
|
function TMirageMaintenanceExampleTestCase.CreateSolver: ISolver;
|
||||||
|
begin
|
||||||
|
Result := TMirageMaintenance.Create;
|
||||||
|
end;
|
||||||
|
|
||||||
|
procedure TMirageMaintenanceExampleTestCase.TestPart1;
|
||||||
|
begin
|
||||||
|
AssertEquals(114, FSolver.GetResultPart1);
|
||||||
|
end;
|
||||||
|
|
||||||
|
procedure TMirageMaintenanceExampleTestCase.TestPart2;
|
||||||
|
begin
|
||||||
|
AssertEquals(-1, FSolver.GetResultPart2);
|
||||||
|
end;
|
||||||
|
|
||||||
|
initialization
|
||||||
|
|
||||||
|
RegisterTest(TMirageMaintenanceFullDataTestCase);
|
||||||
|
RegisterTest(TMirageMaintenanceExampleTestCase);
|
||||||
|
end.
|
Loading…
Reference in New Issue