Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
A
Advent of Code 2022
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Package registry
Container registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
GitLab community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Falk Rehse
Advent of Code 2022
Commits
adb2521c
Commit
adb2521c
authored
Dec 11, 2022
by
Falk Rehse
Browse files
Options
Downloads
Patches
Plain Diff
Day 11-2
parent
b84d8033
No related branches found
No related tags found
No related merge requests found
Changes
4
Show whitespace changes
Inline
Side-by-side
Showing
4 changed files
src/day_11_2/mod.rs
+82
-0
82 additions, 0 deletions
src/day_11_2/mod.rs
src/day_11_2/monkey.rs
+66
-0
66 additions, 0 deletions
src/day_11_2/monkey.rs
src/day_11_2/operation.rs
+31
-0
31 additions, 0 deletions
src/day_11_2/operation.rs
src/main.rs
+2
-1
2 additions, 1 deletion
src/main.rs
with
181 additions
and
1 deletion
src/day_11_2/mod.rs
0 → 100644
+
82
−
0
View file @
adb2521c
mod
monkey
;
mod
operation
;
use
monkey
::
Monkey
;
use
operation
::
Operation
;
const
ROUNDS
:
u32
=
10000
;
pub
fn
solve_from_str
(
input
:
&
str
)
->
u64
{
let
mut
monkeys
=
input
.split
(
"
\n\n
"
)
.map
(|
monkey
|
Monkey
::
from_str
(
monkey
))
.collect
();
solve
(
&
mut
monkeys
)
}
pub
fn
solve
(
monkeys
:
&
mut
Vec
<
Monkey
>
)
->
u64
{
let
common_multiple
:
u64
=
monkeys
.iter
()
.map
(|
monkey
|
monkey
.test_divisible_by
)
.product
();
// for i in (1..monkeys[0].test_divisible_by).rev() {
// let mut is_greatest_common_divisor = true;
// for monkey in & *monkeys {
// if monkey.test_divisible_by % i != 0 {
// is_greatest_common_divisor = false;
// break;
// }
// }
// if is_greatest_common_divisor {
// common_multiple = i;
// break;
// }
// }
dbg!
(
common_multiple
);
for
_
in
0
..
ROUNDS
{
for
i
in
0
..
monkeys
.len
()
{
while
!
monkeys
[
i
]
.items
.is_empty
()
{
monkeys
[
i
]
.inspections
+=
1
;
let
mut
item
=
monkeys
[
i
]
.items
.pop_front
()
.unwrap
()
.clone
();
match
monkeys
[
i
]
.operation
{
Operation
::
Add
(
number
)
=>
item
+=
number
,
Operation
::
Multiply
(
number
)
=>
item
*=
number
,
Operation
::
Square
()
=>
item
*=
item
,
}
item
=
item
%
common_multiple
;
if
item
%
monkeys
[
i
]
.test_divisible_by
==
0
{
let
to_monkey_true
=
monkeys
[
i
]
.to_monkey_true
;
monkeys
[
to_monkey_true
]
.items
.push_back
(
item
);
}
else
{
let
to_monkey_false
=
monkeys
[
i
]
.to_monkey_false
;
monkeys
[
to_monkey_false
]
.items
.push_back
(
item
);
}
}
}
}
dbg!
(
&
monkeys
);
monkeys
.sort_by_key
(|
monkey
|
monkey
.inspections
);
monkeys
.iter
()
.rev
()
.take
(
2
)
.map
(|
monkey
|
monkey
.inspections
)
.product
()
}
This diff is collapsed.
Click to expand it.
src/day_11_2/monkey.rs
0 → 100644
+
66
−
0
View file @
adb2521c
use
std
::
collections
::
VecDeque
;
use
crate
::
day_11_2
::
operation
::
Operation
;
#[derive(Debug)]
pub
struct
Monkey
{
pub
items
:
VecDeque
<
u64
>
,
pub
operation
:
Operation
,
pub
test_divisible_by
:
u64
,
pub
to_monkey_true
:
usize
,
pub
to_monkey_false
:
usize
,
pub
inspections
:
u64
,
}
impl
Monkey
{
pub
fn
from_str
(
input
:
&
str
)
->
Monkey
{
let
mut
data
=
input
.split
(
'\n'
);
data
.next
();
let
items
=
data
.next
()
.expect
(
"Expected items!"
);
let
mut
items
=
items
.chars
();
items
.nth
(
17
);
let
items
:
String
=
items
.collect
();
let
items
=
items
.split
(
", "
)
.map
(|
item
|
item
.parse
()
.expect
(
"Expected number!"
))
.collect
();
let
operation
=
Operation
::
from_str
(
data
.next
()
.expect
(
"Expected operation!"
));
let
test_divisible_by
=
data
.next
()
.expect
(
"Expected test!"
);
let
test_divisible_by
=
test_divisible_by
.split
(
' '
)
.nth
(
5
)
.expect
(
"Expected number!"
)
.parse
()
.expect
(
"Expected number!"
);
let
to_monkey_true
=
data
.next
()
.expect
(
"Expected if true!"
);
let
to_monkey_true
=
to_monkey_true
.split
(
' '
)
.nth
(
9
)
.expect
(
"Expected number!"
)
.parse
()
.expect
(
"Expected number!"
);
let
to_monkey_false
=
data
.next
()
.expect
(
"Expected if false!"
);
let
to_monkey_false
=
to_monkey_false
.split
(
' '
)
.nth
(
9
)
.expect
(
"Expected number!"
)
.parse
()
.expect
(
"Expected number!"
);
Monkey
{
items
,
operation
,
test_divisible_by
,
to_monkey_true
,
to_monkey_false
,
inspections
:
0
,
}
}
}
This diff is collapsed.
Click to expand it.
src/day_11_2/operation.rs
0 → 100644
+
31
−
0
View file @
adb2521c
#[derive(Debug)]
pub
enum
Operation
{
Add
(
u64
),
Multiply
(
u64
),
Square
(),
}
impl
Operation
{
pub
fn
from_str
(
input
:
&
str
)
->
Operation
{
let
operation
=
input
.split
(
' '
)
.nth
(
6
)
.expect
(
"Expected operation!"
);
if
operation
==
"+"
{
Operation
::
Add
(
input
.split
(
' '
)
.nth
(
7
)
.expect
(
"Expected number!"
)
.parse
()
.expect
(
"Expected number!"
),
)
}
else
if
operation
==
"*"
{
if
let
Ok
(
number
)
=
input
.split
(
' '
)
.nth
(
7
)
.expect
(
"Expected number!"
)
.parse
()
{
Operation
::
Multiply
(
number
)
}
else
{
Operation
::
Square
()
}
}
else
{
panic!
(
"Unexpected operation!"
);
}
}
}
This diff is collapsed.
Click to expand it.
src/main.rs
+
2
−
1
View file @
adb2521c
...
...
@@ -17,13 +17,14 @@ mod day_9_2;
mod
day_10_1
;
mod
day_10_2
;
mod
day_11_1
;
mod
day_11_2
;
use
std
::
fs
;
fn
main
()
{
let
input
=
fs
::
read_to_string
(
"input"
)
.expect
(
"Could not read input!"
);
let
solution
=
day_11_
1
::
solve_from_str
(
input
.as_str
());
let
solution
=
day_11_
2
::
solve_from_str
(
input
.as_str
());
println!
(
"Solution: {}"
,
solution
);
}
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment