Day 13 parts 1 & 2 (with tons of debug, before code cleaning)
This commit is contained in:
@@ -108,3 +108,14 @@ The instructions made a square!
|
||||
The transparent paper is pretty big, so for now, focus on just completing the first fold. After the first fold in the example above, 17 dots are visible - dots that end up overlapping after the fold is completed count as a single dot.
|
||||
|
||||
How many dots are visible after completing just the first fold instruction on your transparent paper?
|
||||
|
||||
Your puzzle answer was 802.
|
||||
--- Part Two ---
|
||||
|
||||
Finish folding the transparent paper according to the instructions. The manual says the code is always eight capital letters.
|
||||
|
||||
What code do you use to activate the infrared thermal imaging camera system?
|
||||
|
||||
Your puzzle answer was RKHFZGUB.
|
||||
|
||||
Both parts of this puzzle are complete! They provide two gold stars: **
|
||||
|
||||
234
2021/day13/aoc-c.c
Normal file
234
2021/day13/aoc-c.c
Normal file
@@ -0,0 +1,234 @@
|
||||
/* aoc-c.c: Advent of Code 2021, day 13 parts 1 & 2
|
||||
*
|
||||
* Copyright (C) 2021 Bruno Raoult ("br")
|
||||
* Licensed under the GNU General Public License v3.0 or later.
|
||||
* Some rights reserved. See COPYING.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License along with this
|
||||
* program. If not, see <https://www.gnu.org/licenses/gpl-3.0-standalone.html>.
|
||||
*
|
||||
* SPDX-License-Identifier: GPL-3.0-or-later <https://spdx.org/licenses/GPL-3.0-or-later.html>
|
||||
*/
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <unistd.h>
|
||||
#include <string.h>
|
||||
#include <malloc.h>
|
||||
#include <ctype.h>
|
||||
|
||||
#include "debug.h"
|
||||
#include "pool.h"
|
||||
#include "bits.h"
|
||||
#include "list.h"
|
||||
|
||||
#define MAX_POINTS 1024
|
||||
#define MAX_FLIPS 1024
|
||||
|
||||
typedef struct square {
|
||||
int x;
|
||||
int y;
|
||||
} square_t;
|
||||
|
||||
typedef struct flip {
|
||||
char xy; /* 0: x, 1: y */
|
||||
int val;
|
||||
} flip_t;
|
||||
|
||||
static square_t points[MAX_POINTS]; /* points list */
|
||||
static int npoints; /* ... and size */
|
||||
|
||||
static flip_t flips[MAX_FLIPS]; /* flips list */
|
||||
static int nflips; /* ... and size */
|
||||
|
||||
static void print_points()
|
||||
{
|
||||
int i;
|
||||
|
||||
log(2, "points (%d) :\n", npoints);
|
||||
for (i = 0; i < npoints; ++i)
|
||||
log(2, "x=%d y=%d\n", points[i].x, points[i].y);
|
||||
}
|
||||
|
||||
static void print_dots()
|
||||
{
|
||||
int prevx = 0, prevy = 0, x = 0, y = 0;
|
||||
log(2, "points (%d) :\n", npoints);
|
||||
for (int i = 0; i < npoints; ++i) {
|
||||
y = points[i].y;
|
||||
if (y != prevy) {
|
||||
printf("\n");
|
||||
prevy = y;
|
||||
x = 0;
|
||||
}
|
||||
/* print spaces before next point */
|
||||
while(x < points[i].x) {
|
||||
printf(".");
|
||||
x++;
|
||||
}
|
||||
x++;
|
||||
printf("#");
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
static void print_flips()
|
||||
{
|
||||
int i;
|
||||
|
||||
log(2, "flips (%d) :\n", nflips);
|
||||
for (i = 0; i < nflips; ++i)
|
||||
log_i(2, "xy=%c val=%d\n", flips[i].xy, flips[i].val);
|
||||
}
|
||||
|
||||
/* sort array and pack it (remove duplicates). sort by y first, then x.
|
||||
*/
|
||||
static void ins_sort_points()
|
||||
{
|
||||
for (int i = 1, j = 0; i < npoints; i++, j = i - 1) {
|
||||
square_t cur = points[i];
|
||||
|
||||
while (j >= 0 && ((points[j].y > cur.y) ||
|
||||
((points[j].y == cur.y) && (points[j].x > cur.x)))) {
|
||||
points[j + 1] = points[j];
|
||||
j = j - 1;
|
||||
}
|
||||
points[j + 1] = cur;
|
||||
}
|
||||
int cur = 0;
|
||||
//if array is empty
|
||||
// or contains a single element
|
||||
if (npoints > 1) {
|
||||
for (int i = 0; i < npoints - 1; ++i) {
|
||||
if (points[i].x != points[i + 1].x || points[i].y != points[i + 1].y) {
|
||||
points[cur++] = points[i];
|
||||
}
|
||||
}
|
||||
points[cur++] = points[npoints-1];
|
||||
}
|
||||
npoints = cur;
|
||||
|
||||
return;
|
||||
}
|
||||
|
||||
static void flipx(int n)
|
||||
{
|
||||
for (int i = 0; i < npoints; ++i) {
|
||||
square_t *p = points+i;
|
||||
if (points[i].x > n) {
|
||||
log(3, "flipping %d,%d -> ", p->x, p->y);
|
||||
p->x = 2 * n - p->x;
|
||||
log(3, "%d,%d\n", p->x, p->y);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static void flipy(int n)
|
||||
{
|
||||
for (int i = 0; i < npoints; ++i) {
|
||||
square_t *p = points+i;
|
||||
if (points[i].y > n) {
|
||||
log(3, "flipping %d,%d -> ", p->x, p->y);
|
||||
p->y = 2 * n - p->y;
|
||||
log(3, "%d,%d\n", p->x, p->y);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* read data and create graph.
|
||||
*/
|
||||
static int read_input()
|
||||
{
|
||||
ssize_t len;
|
||||
size_t alloc = 0;
|
||||
char *buf;
|
||||
|
||||
/* get points list */
|
||||
while ((len = getline(&buf, &alloc, stdin)) > 1) {
|
||||
sscanf(buf, "%d,%d", &points[npoints].x, &points[npoints].y);
|
||||
npoints++;
|
||||
//log(1, "len=%d x=%d, y=%d ss=%d\n", len, x, y, ss);
|
||||
}
|
||||
/* get flip list */
|
||||
while ((len = getline(&buf, &alloc, stdin)) > 1) {
|
||||
sscanf(buf, "fold along %c=%d", &flips[nflips].xy, &flips[nflips].val);
|
||||
nflips++;
|
||||
//log(1, "len=%d x=%d, y=%d ss=%d\n", len, x, y, ss);
|
||||
}
|
||||
free(buf);
|
||||
return 1;
|
||||
}
|
||||
|
||||
static int part1()
|
||||
{
|
||||
print_points();
|
||||
print_flips();
|
||||
ins_sort_points();
|
||||
print_points();
|
||||
|
||||
if (flips[0].xy == 'x') {
|
||||
flipx(flips[0].val);
|
||||
} else {
|
||||
flipy(flips[0].val);
|
||||
}
|
||||
ins_sort_points();
|
||||
print_points();
|
||||
return npoints;
|
||||
}
|
||||
|
||||
static int part2()
|
||||
{
|
||||
print_points();
|
||||
print_flips();
|
||||
ins_sort_points();
|
||||
print_points();
|
||||
|
||||
for (int i = 0; i < nflips; ++i) {
|
||||
if (flips[i].xy == 'x') {
|
||||
flipx(flips[i].val);
|
||||
} else {
|
||||
flipy(flips[i].val);
|
||||
}
|
||||
}
|
||||
ins_sort_points();
|
||||
print_points();
|
||||
print_dots();
|
||||
return npoints;
|
||||
}
|
||||
|
||||
static int doit(int part)
|
||||
{
|
||||
read_input();
|
||||
return part == 1? part1(): part2();
|
||||
}
|
||||
|
||||
static int usage(char *prg)
|
||||
{
|
||||
fprintf(stderr, "Usage: %s [-d debug_level] [-p part]\n", prg);
|
||||
return 1;
|
||||
}
|
||||
|
||||
int main(int ac, char **av)
|
||||
{
|
||||
int opt, part = 1;
|
||||
|
||||
while ((opt = getopt(ac, av, "d:p:")) != -1) {
|
||||
switch (opt) {
|
||||
case 'd':
|
||||
debug_level_set(atoi(optarg));
|
||||
break;
|
||||
case 'p': /* 1 or 2 */
|
||||
part = atoi(optarg);
|
||||
if (part < 1 || part > 2)
|
||||
return usage(*av);
|
||||
break;
|
||||
default:
|
||||
return usage(*av);
|
||||
}
|
||||
}
|
||||
if (optind < ac)
|
||||
return usage(*av);
|
||||
|
||||
printf("%s : res=%d\n", *av, doit(part));
|
||||
exit (0);
|
||||
}
|
||||
Reference in New Issue
Block a user