No longer hardcode D17P2
This commit is contained in:
parent
d66f782831
commit
887499b02b
|
@ -9,3 +9,4 @@ edition = "2018"
|
||||||
[dependencies]
|
[dependencies]
|
||||||
intcode = { path = "../intcode" }
|
intcode = { path = "../intcode" }
|
||||||
grid = { path = "../grid" }
|
grid = { path = "../grid" }
|
||||||
|
itertools = "0.7.2"
|
||||||
|
|
|
@ -1,8 +1,9 @@
|
||||||
use grid::*;
|
use grid::*;
|
||||||
use intcode::*;
|
use intcode::*;
|
||||||
use std::char;
|
use std::char;
|
||||||
use std::collections::{HashMap,HashSet};
|
use std::collections::{HashMap, HashSet};
|
||||||
use std::fmt;
|
use std::fmt;
|
||||||
|
use itertools::Itertools;
|
||||||
|
|
||||||
#[derive(Debug, PartialEq, Eq, Hash, Clone)]
|
#[derive(Debug, PartialEq, Eq, Hash, Clone)]
|
||||||
struct Movement {
|
struct Movement {
|
||||||
|
@ -24,11 +25,7 @@ fn find_commands(field: &HashMap<Position2D, char>) -> Vec<Movement> {
|
||||||
let mut commands = Vec::new();
|
let mut commands = Vec::new();
|
||||||
loop {
|
loop {
|
||||||
let mut steps = 0;
|
let mut steps = 0;
|
||||||
let turn = if field.get(&(robot_position + (robot_direction + 1))) == Some(&'#') {
|
let turn = ((field.get(&(robot_position + (robot_direction + 1))) == Some(&'#')) as i8) * 2 - 1;
|
||||||
1
|
|
||||||
} else {
|
|
||||||
-1
|
|
||||||
};
|
|
||||||
robot_direction += turn;
|
robot_direction += turn;
|
||||||
while field.get(&(robot_position + robot_direction)) == Some(&'#') {
|
while field.get(&(robot_position + robot_direction)) == Some(&'#') {
|
||||||
robot_position += robot_direction;
|
robot_position += robot_direction;
|
||||||
|
@ -83,7 +80,7 @@ fn main() {
|
||||||
.enumerate()
|
.enumerate()
|
||||||
.flat_map(move |(y, s)| s.chars().enumerate().map(move |(x, c)| ((x, y).into(), c)))
|
.flat_map(move |(y, s)| s.chars().enumerate().map(move |(x, c)| ((x, y).into(), c)))
|
||||||
.collect();
|
.collect();
|
||||||
//let field = test_input();
|
// let field = test_input();
|
||||||
let p1 = field
|
let p1 = field
|
||||||
.iter()
|
.iter()
|
||||||
.filter(|(pos, obj)| {
|
.filter(|(pos, obj)| {
|
||||||
|
@ -99,10 +96,12 @@ fn main() {
|
||||||
|
|
||||||
let commands = find_commands(&field);
|
let commands = find_commands(&field);
|
||||||
println!("Commands: {}", commands.len());
|
println!("Commands: {}", commands.len());
|
||||||
for c in commands.iter() { println!("{}", c); }
|
for c in commands.iter() {
|
||||||
|
println!("{}", c);
|
||||||
|
}
|
||||||
let mut pos = 0;
|
let mut pos = 0;
|
||||||
//let mut segments = Vec::new();
|
let mut segments = Vec::new();
|
||||||
let segments = vec![
|
/*let segments = vec![
|
||||||
vec![
|
vec![
|
||||||
Movement{ rotation: -1, distance: 8 },
|
Movement{ rotation: -1, distance: 8 },
|
||||||
Movement{ rotation: 1, distance: 12 },
|
Movement{ rotation: 1, distance: 12 },
|
||||||
|
@ -119,62 +118,78 @@ fn main() {
|
||||||
Movement{ rotation: 1, distance: 10 },
|
Movement{ rotation: 1, distance: 10 },
|
||||||
Movement{ rotation: -1, distance: 6 },
|
Movement{ rotation: -1, distance: 6 },
|
||||||
]
|
]
|
||||||
];
|
];*/
|
||||||
/*
|
while pos < commands.len() - 4 {
|
||||||
while pos < commands.len() {
|
if let Some((n, mov)) = (2..=4)
|
||||||
if let Some((n, mov)) = (1..=5)
|
|
||||||
.filter_map(|i| {
|
.filter_map(|i| {
|
||||||
let reference = commands[pos..].windows(i).next();
|
let reference = commands[pos..].windows(i).next();
|
||||||
let dupes = commands[pos..]
|
if segments.contains(&reference.unwrap()) {
|
||||||
.windows(i)
|
Some(((i, 99), reference))
|
||||||
.filter(|&w| Some(w) == reference)
|
|
||||||
.count();
|
|
||||||
if dupes > 0 {
|
|
||||||
Some(((i, dupes), reference))
|
|
||||||
} else {
|
} else {
|
||||||
None
|
let dupes = commands[pos..]
|
||||||
|
.windows(i)
|
||||||
|
.filter(|&w| Some(w) == reference)
|
||||||
|
.count();
|
||||||
|
if dupes > 0 {
|
||||||
|
Some(((i, dupes), reference))
|
||||||
|
} else {
|
||||||
|
None
|
||||||
|
}
|
||||||
}
|
}
|
||||||
})
|
})
|
||||||
.max_by_key(|((x, y), _)| x + y*2)
|
.inspect(|_| println!("hit for {}", pos))
|
||||||
|
.max_by_key(|((x, y), _)| x * y)
|
||||||
{
|
{
|
||||||
pos += n.0;
|
pos += n.0;
|
||||||
segments.push(mov.unwrap());
|
segments.push(mov.unwrap());
|
||||||
|
} else {
|
||||||
|
//panic!("nothing found at position {}", pos);
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
let filtered: HashSet<_> = segments.clone().into_iter().map(|mut curr| {
|
let filtered: HashSet<_> = segments
|
||||||
for s in &segments {
|
.clone()
|
||||||
if curr.len() <= s.len() {
|
.into_iter()
|
||||||
continue
|
/*
|
||||||
|
.map(|mut curr| {
|
||||||
|
for s in &segments {
|
||||||
|
if curr.len() <= s.len() {
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
let index_after = curr.len() - s.len();
|
||||||
|
if s == &&curr[index_after..] {
|
||||||
|
curr = &curr[..index_after];
|
||||||
|
}
|
||||||
|
if s == &&curr[..index_after] {
|
||||||
|
curr = &curr[index_after..];
|
||||||
|
}
|
||||||
}
|
}
|
||||||
let index_after = curr.len() - s.len();
|
curr
|
||||||
if s == &&curr[index_after..] {
|
})
|
||||||
curr = &curr[..index_after];
|
.filter(|s| !s.is_empty())
|
||||||
}
|
*/
|
||||||
if s == &&curr[..index_after] {
|
.collect();
|
||||||
curr = &curr[index_after..];
|
let mut filtered: Vec<_> = filtered
|
||||||
}
|
.into_iter()
|
||||||
}
|
.zip(['A', 'B', 'C'].iter())
|
||||||
curr
|
.collect();
|
||||||
})
|
filtered.sort_by_key(|(_, c)| c.to_owned());
|
||||||
.filter(|s| !s.is_empty())
|
dbg!(&segments, segments.len());
|
||||||
.collect();
|
|
||||||
//dbg!(&segments, segments.len());
|
|
||||||
dbg!(filtered.len());
|
dbg!(filtered.len());
|
||||||
println!(
|
println!(
|
||||||
"{}",
|
"{}",
|
||||||
filtered
|
filtered
|
||||||
.iter()
|
.iter()
|
||||||
.map(|s| s.iter().map(|m| m.to_string()).collect::<String>() + "\n")
|
.map(|s| s.0.iter().map(|m| m.to_string()).collect::<String>() + "\n")
|
||||||
.collect::<String>()
|
.collect::<String>()
|
||||||
);
|
);
|
||||||
*/
|
//let filtered = segments;
|
||||||
let filtered = segments;
|
|
||||||
let mut instructions = Vec::new();
|
let mut instructions = Vec::new();
|
||||||
let mut pos = 0;
|
let mut pos = 0;
|
||||||
while pos < commands.len() {
|
while pos < commands.len() {
|
||||||
|
println!("searching");
|
||||||
for i in 1.. {
|
for i in 1.. {
|
||||||
if filtered.contains(&commands[pos..pos+i].to_vec()) {
|
if filtered.iter().any(|(c, _)| c == &&commands[pos..pos + i]) {
|
||||||
instructions.push(&commands[pos..pos+i]);
|
instructions.push(&commands[pos..pos + i]);
|
||||||
pos += i;
|
pos += i;
|
||||||
println!("match for {}..{}", pos, i);
|
println!("match for {}..{}", pos, i);
|
||||||
break;
|
break;
|
||||||
|
@ -183,14 +198,21 @@ fn main() {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
for i in instructions {
|
fn dir(rotation: i8) -> char {
|
||||||
println!("{}", i.iter().map(|m| m.to_string()).collect::<String>());
|
if rotation == 1 { 'R' } else { 'L' }
|
||||||
}
|
}
|
||||||
|
|
||||||
// it’s surprisingly easy to do this manually with enough debug prints above.
|
|
||||||
// proper solution once the headache is gone. fml
|
|
||||||
input[0] = 2;
|
input[0] = 2;
|
||||||
let mut path: Vec<i64> = "A,B,A,B,C,C,B,A,B,C\nL,8,R,12,R,12,R,10\nR,10,R,12,R,10\nL,10,R,10,L,6\nn\n".chars().map(|c| c as i64).collect();
|
let raw_path = (instructions.iter().map(|i| filtered.iter().find(|(f, c)| i == f).unwrap().1).join(",")
|
||||||
path.reverse();
|
+ "\n"
|
||||||
println!("Part 2: {:?}", IntComputer::new(input, 0, path).get_all_outputs());
|
+ &filtered.into_iter().map(|(f, _)| f.iter().map(|m| format!("{},{}", dir(m.rotation), m.distance)).join(",")).join("\n")
|
||||||
|
+ "\nn\n");
|
||||||
|
let path: Vec<i64> = raw_path
|
||||||
|
.chars()
|
||||||
|
.map(|c| c as i64)
|
||||||
|
.rev()
|
||||||
|
.collect();
|
||||||
|
println!(
|
||||||
|
"Part 2: {:?}",
|
||||||
|
IntComputer::new(input, 0, path).get_all_outputs().pop()
|
||||||
|
);
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in New Issue
Block a user