Day 5: Print Queue

Megathread guidelines

  • Keep top level comments as only solutions, if you want to say something other than a solution put it in a new post. (replies to comments can be whatever)
  • You can send code in code blocks by using three backticks, the code, and then three backticks or use something such as https://topaz.github.io/paste/ if you prefer sending it through a URL

FAQ

  • mykl@lemmy.world
    link
    fedilink
    arrow-up
    4
    ·
    edit-2
    17 days ago

    Dart

    A bit easier than I first thought it was going to be.

    I had a look at the Uiua discussion, and this one looks to be beyond my pay grade, so this will be it for today.

    import 'package:collection/collection.dart';
    import 'package:more/more.dart';
    
    (int, int) solve(List<String> lines) {
      var parts = lines.splitAfter((e) => e == '');
      var pred = SetMultimap.fromEntries(parts.first.skipLast(1).map((e) {
        var ps = e.split('|').map(int.parse);
        return MapEntry(ps.last, ps.first);
      }));
      ordering(a, b) => pred[a].contains(b) ? 1 : 0;
    
      var pageSets = parts.last.map((e) => e.split(',').map(int.parse).toList());
      var partn = pageSets.partition((ps) => ps.isSorted(ordering));
      return (
        partn.truthy.map((e) => e[e.length ~/ 2]).sum,
        partn.falsey.map((e) => (e..sort(ordering))[e.length ~/ 2]).sum
      );
    }
    
    part1(List<String> lines) => solve(lines).$1;
    part2(List<String> lines) => solve(lines).$2;