advent2023

puzzle.c (4863B)

---

 #define _DEFAULT_SOURCE
 
 #include <limits.h>
 #include <stdio.h>
 #include <stdlib.h>
 #include <errno.h>
 #include <string.h>
 #include <strings.h>
 #include <assert.h>
 #include <stdbool.h>
 #include <inttypes.h>
 
 #define STR_LEN 2048
 #define CARDS_LEN 5
 #define COUNTS_LEN 15
 
 typedef enum HandType {
 	Hand_Unknown      = 0,
 	Hand_HighCard     = 50000,
 	Hand_OnePair      = 41000,
 	Hand_TwoPair      = 32000,
 	Hand_ThreeOfAKind = 31100,
 	Hand_FullHouse    = 22100,
 	Hand_FourOfAKind  = 21110,
 	Hand_FiveOfAKind  = 11111
 } HandType;
 
 typedef struct Hand {
 	HandType type;
 	int bid;
 	char cards_orig[CARDS_LEN+1];
 	int cards[CARDS_LEN];
 	int counts[COUNTS_LEN];
 	int32_t csum;
 } Hand;
 
 static int get_card(char c) {
 	if (c>='2'&&c<='9') return c-'0';
 	if (c=='T') return 10;
 	if (c=='J') return 11;
 	if (c=='Q') return 12;
 	if (c=='K') return 13;
 	if (c=='A') return 14;
 	return -1;
 }
 
 static int get_card2(char c) {
 	if (c>='2'&&c<='9') return c-'0';
 	if (c=='T') return 10;
 	if (c=='J') return 1;
 	if (c=='Q') return 12;
 	if (c=='K') return 13;
 	if (c=='A') return 14;
 	return -1;
 }
 
 void make_type(Hand *h) {
 	int sum = 10000*h->counts[0] +
 	           1000*h->counts[1] +
 	            100*h->counts[2] +
 	             10*h->counts[3] +
 	                h->counts[4];
 	h->type = (HandType)sum;
 }
 
 void make_counts(Hand *h, bool use_joker) {
 	memset(h->counts, 0, sizeof(int)*COUNTS_LEN);
 	for (int i=0; i<CARDS_LEN; ++i) {
 		h->counts[h->cards[i]]++;
 	}
 
 	int jk = get_card2('J');
 	if (use_joker && h->counts[jk]>0) {
 		printf("(jk:%d)", h->counts[jk]);
 		int *curmax = &h->counts[COUNTS_LEN-1];
 		for (int i=COUNTS_LEN-1; i>=0; --i) {
 			if (i!=jk) {
 				if (h->counts[i] > *curmax) {
 					curmax = &h->counts[i];
 				}
 			}
 		}
 		//printf("(curmax:%d)", *curmax);
 		*curmax += h->counts[jk];
 		h->counts[jk] = 0;
 	}
 }
 
 void make_csum(Hand *h) {
 	h->csum = 100000000*get_card(h->cards_orig[0]) +
 	            1000000*get_card(h->cards_orig[1]) +
 	              10000*get_card(h->cards_orig[2]) +
 	                100*get_card(h->cards_orig[3]) +
 	                    get_card(h->cards_orig[4]);
 }
 
 void make_csum2(Hand *h) {
 	h->csum = 100000000*get_card2(h->cards_orig[0]) +
 	            1000000*get_card2(h->cards_orig[1]) +
 	              10000*get_card2(h->cards_orig[2]) +
 	                100*get_card2(h->cards_orig[3]) +
 	                    get_card2(h->cards_orig[4]);
 }
 
 static int cmp_cards(const void *c1, const void *c2) {
 	return *(int *)c1 - *(int *)c2;
 }
 
 static int cmp_counts(const void *c1, const void *c2) {
 	return *(int *)c2 - *(int *)c1;
 }
 
 static int cmp_hands(const void *v1, const void *v2) {
 	const Hand *h1 = (Hand *)v1;
 	const Hand *h2 = (Hand *)v2;
 	if (h1->type!=h2->type) {
 		return h1->type - h2->type;
 	}
 	return h1->csum - h2->csum;
 }
 
 void puzzle(const char *filename, long long *result1, long long *result2) {
 	FILE *infile = fopen(filename, "r");
 	if (infile == NULL) {
 		fprintf(stderr, "fopen() error: %s\n", strerror(errno));
 		return;
 	}
 
 	char buf[STR_LEN] = {0};
 	unsigned int line_num = 0;
 	*result1 = 0;
 	*result2 = 0;
 
 	Hand *hands = NULL;
 	int hands_len = 0;
 	while (fgets(buf, STR_LEN, infile) != NULL) {
 		hands_len++;
 		hands = realloc(hands, sizeof(Hand)*hands_len);
 		Hand *h = &hands[hands_len-1];
 		memset(h, 0, sizeof(Hand));
 		sscanf(buf, "%s %d", h->cards_orig, &h->bid);
 		for (int i=0; i<CARDS_LEN; ++i) {
 			h->cards[i] = get_card(h->cards_orig[i]);
 		}
 		qsort(h->cards, CARDS_LEN, sizeof(int), cmp_cards);
 		make_counts(h, false);
 		make_csum(h);
 		qsort(h->counts, COUNTS_LEN, sizeof(int), cmp_counts);
 		make_type(h);
 		//
 
 		++line_num;
 		bzero(buf, STR_LEN);
 	}
 
 	printf("--------- part 1 ----------\n");
 	qsort(hands, hands_len, sizeof(Hand), cmp_hands);
 	for (int i=0; i<hands_len; ++i) {
 		printf("hand %2d %s, type %d, bid %3d; ", i, hands[i].cards_orig, hands[i].type, hands[i].bid);
 		for (int j=0; j<CARDS_LEN; ++j) {
 			printf("%2d ", hands[i].cards[j]);
 		}
 		printf(" csum: %10d | ", hands[i].csum);
 		for (int j=0; j<COUNTS_LEN; ++j) {
 			if (hands[i].counts[j]>0) {
 				printf("%d ", hands[i].counts[j]);
 			}
 		}
 		printf("\n");
 		*result1 += (i+1)*hands[i].bid;
 	}
 
 	// 246452271 too high
 	printf("----------- part 2 ------------\n");
 	for (int i=0; i<hands_len; ++i) {
 		Hand *h = &hands[i];
 		printf("hand %s: was type %d, now ", h->cards_orig, h->type);
 		memset(h->cards, 0, sizeof(int)*CARDS_LEN);
 		for (int j=0; j<CARDS_LEN; ++j) {
 			h->cards[j] = get_card2(h->cards_orig[j]);
 		}
 		make_counts(h, true);
 		make_csum2(h);
 		qsort(h->counts, COUNTS_LEN, sizeof(int), cmp_counts);
 		make_type(h);
 		printf("%d\n", h->type);
 	}
 	qsort(hands, hands_len, sizeof(Hand), cmp_hands);
 	for (int i=0; i<hands_len; ++i) {
 		printf("hand %2d %s type %d\n", i, hands[i].cards_orig, hands[i].type);
 		*result2 += (i+1)*hands[i].bid;
 	}
 
 	// mutiny! ignoring feof/ferror.
 	fclose(infile);
 }