commit dd99347c35f4a66f94266b7a7a1e36d5912e700f · aylac.top/advent_of_code

+1 -1

.zed/settings.json

···

       1
       1
       -
       { "disable_ai": true, "edit_predictions": { "disabled_globs": ["*"] } }

     

       1
       1
       +
       { "disable_ai": true, "edit_predictions": { "disabled_globs": ["*"] }, "agent": {"enabled": false, "button": false}, "inline_code_actions": false }

+20

2015/9/gleam/gleam.toml

···

       1
       1
       +
       name = "main"

     

       2
       2
       +
       version = "1.0.0"

     

       3
       3
       +
       

     

       4
       4
       +
       # Fill out these fields if you intend to generate HTML documentation or publish

     

       5
       5
       +
       # your project to the Hex package manager.

     

       6
       6
       +
       #

     

       7
       7
       +
       # description = ""

     

       8
       8
       +
       # licences = ["Apache-2.0"]

     

       9
       9
       +
       # repository = { type = "github", user = "", repo = "" }

     

       10
       10
       +
       # links = [{ title = "Website", href = "" }]

     

       11
       11
       +
       #

     

       12
       12
       +
       # For a full reference of all the available options, you can have a look at

     

       13
       13
       +
       # https://gleam.run/writing-gleam/gleam-toml/.

     

       14
       14
       +
       

     

       15
       15
       +
       [dependencies]

     

       16
       16
       +
       gleam_stdlib = ">= 0.44.0 and < 2.0.0"

     

       17
       17
       +
       simplifile = ">= 2.3.0 and < 3.0.0"

     

       18
       18
       +
       

     

       19
       19
       +
       [dev-dependencies]

     

       20
       20
       +
       gleeunit = ">= 1.0.0 and < 2.0.0"

+14

2015/9/gleam/manifest.toml

···

       1
       1
       +
       # This file was generated by Gleam

     

       2
       2
       +
       # You typically do not need to edit this file

     

       3
       3
       +
       

     

       4
       4
       +
       packages = [

     

       5
       5
       +
         { name = "filepath", version = "1.1.2", build_tools = ["gleam"], requirements = ["gleam_stdlib"], otp_app = "filepath", source = "hex", outer_checksum = "B06A9AF0BF10E51401D64B98E4B627F1D2E48C154967DA7AF4D0914780A6D40A" },

     

       6
       6
       +
         { name = "gleam_stdlib", version = "0.65.0", build_tools = ["gleam"], requirements = [], otp_app = "gleam_stdlib", source = "hex", outer_checksum = "7C69C71D8C493AE11A5184828A77110EB05A7786EBF8B25B36A72F879C3EE107" },

     

       7
       7
       +
         { name = "gleeunit", version = "1.7.0", build_tools = ["gleam"], requirements = ["gleam_stdlib"], otp_app = "gleeunit", source = "hex", outer_checksum = "CD701726CBCE5588B375D157B4391CFD0F2F134CD12D9B6998A395484DE05C58" },

     

       8
       8
       +
         { name = "simplifile", version = "2.3.0", build_tools = ["gleam"], requirements = ["filepath", "gleam_stdlib"], otp_app = "simplifile", source = "hex", outer_checksum = "0A868DAC6063D9E983477981839810DC2E553285AB4588B87E3E9C96A7FB4CB4" },

     

       9
       9
       +
       ]

     

       10
       10
       +
       

     

       11
       11
       +
       [requirements]

     

       12
       12
       +
       gleam_stdlib = { version = ">= 0.44.0 and < 2.0.0" }

     

       13
       13
       +
       gleeunit = { version = ">= 1.0.0 and < 2.0.0" }

     

       14
       14
       +
       simplifile = { version = ">= 2.3.0 and < 3.0.0" }

+168

2015/9/gleam/src/main.gleam

···

       1
       1
       +
       import gleam/dict.{type Dict}

     

       2
       2
       +
       import gleam/int.{to_string}

     

       3
       3
       +
       import gleam/io.{println}

     

       4
       4
       +
       import gleam/list

     

       5
       5
       +
       import gleam/result.{unwrap}

     

       6
       6
       +
       import gleam/set.{type Set}

     

       7
       7
       +
       import gleam/string.{trim}

     

       8
       8
       +
       import simplifile.{read}

     

       9
       9
       +
       

     

       10
       10
       +
       type Distance {

     

       11
       11
       +
         Distance(place1: String, place2: String, value: Int)

     

       12
       12
       +
       }

     

       13
       13
       +
       

     

       14
       14
       +
       type TwoPlaces {

     

       15
       15
       +
         TwoPlaces(place1: String, place2: String)

     

       16
       16
       +
       }

     

       17
       17
       +
       

     

       18
       18
       +
       type DistanceDict =

     

       19
       19
       +
         Dict(TwoPlaces, Int)

     

       20
       20
       +
       

     

       21
       21
       +
       type MapPlaces {

     

       22
       22
       +
         MapPlaces(dict: DistanceDict, places: Set(String))

     

       23
       23
       +
       }

     

       24
       24
       +
       

     

       25
       25
       +
       fn find_shortest_path(distance_dict, places, shortest_path, path, place place1) {

     

       26
       26
       +
         case set.size(places) == 0 {

     

       27
       27
       +
           True -> path

     

       28
       28
       +
           False ->

     

       29
       29
       +
             places

     

       30
       30
       +
             |> set.fold(shortest_path, fn(shortest_path, place2) {

     

       31
       31
       +
               let assert Ok(dist) = dict.get(distance_dict, TwoPlaces(place1, place2))

     

       32
       32
       +
               let path = path + dist

     

       33
       33
       +
               case path < shortest_path {

     

       34
       34
       +
                 True ->

     

       35
       35
       +
                   find_shortest_path(

     

       36
       36
       +
                     distance_dict,

     

       37
       37
       +
                     places |> set.delete(place2),

     

       38
       38
       +
                     shortest_path,

     

       39
       39
       +
                     path,

     

       40
       40
       +
                     place2,

     

       41
       41
       +
                   )

     

       42
       42
       +
                 False -> shortest_path

     

       43
       43
       +
               }

     

       44
       44
       +
             })

     

       45
       45
       +
         }

     

       46
       46
       +
       }

     

       47
       47
       +
       

     

       48
       48
       +
       fn find_shortest_path_helper(distance_dict: DistanceDict, places: Set(String)) {

     

       49
       49
       +
         places

     

       50
       50
       +
         |> set.fold(1_000_000, fn(shortest_path, place1) {

     

       51
       51
       +
           let places = places |> set.delete(place1)

     

       52
       52
       +
           let path =

     

       53
       53
       +
             places

     

       54
       54
       +
             |> set.fold(shortest_path, fn(shortest_path, place2) {

     

       55
       55
       +
               let assert Ok(path) = dict.get(distance_dict, TwoPlaces(place1, place2))

     

       56
       56
       +
               find_shortest_path(

     

       57
       57
       +
                 distance_dict,

     

       58
       58
       +
                 places |> set.delete(place2),

     

       59
       59
       +
                 shortest_path,

     

       60
       60
       +
                 path,

     

       61
       61
       +
                 place2,

     

       62
       62
       +
               )

     

       63
       63
       +
             })

     

       64
       64
       +
           case path < shortest_path {

     

       65
       65
       +
             True -> path

     

       66
       66
       +
             False -> shortest_path

     

       67
       67
       +
           }

     

       68
       68
       +
         })

     

       69
       69
       +
       }

     

       70
       70
       +
       

     

       71
       71
       +
       fn find_longest_path(distance_dict, places, longest_path, path, place place1) {

     

       72
       72
       +
         case set.size(places) == 0 {

     

       73
       73
       +
           True ->

     

       74
       74
       +
             case path > longest_path {

     

       75
       75
       +
               True -> path

     

       76
       76
       +
               False -> longest_path

     

       77
       77
       +
             }

     

       78
       78
       +
           False -> {

     

       79
       79
       +
             let #(place2, longest_distance) =

     

       80
       80
       +
               places

     

       81
       81
       +
               |> set.fold(#("", 0), fn(longest_distance_tuple, place2) {

     

       82
       82
       +
                 let assert Ok(distance) =

     

       83
       83
       +
                   dict.get(distance_dict, TwoPlaces(place1, place2))

     

       84
       84
       +
                 let #(_, longest_distance) = longest_distance_tuple

     

       85
       85
       +
                 case distance > longest_distance {

     

       86
       86
       +
                   True -> #(place2, distance)

     

       87
       87
       +
                   False -> longest_distance_tuple

     

       88
       88
       +
                 }

     

       89
       89
       +
               })

     

       90
       90
       +
       

     

       91
       91
       +
             let path = path + longest_distance

     

       92
       92
       +
             find_longest_path(

     

       93
       93
       +
               distance_dict,

     

       94
       94
       +
               places |> set.delete(place2),

     

       95
       95
       +
               longest_path,

     

       96
       96
       +
               path,

     

       97
       97
       +
               place2,

     

       98
       98
       +
             )

     

       99
       99
       +
           }

     

       100
       100
       +
         }

     

       101
       101
       +
       }

     

       102
       102
       +
       

     

       103
       103
       +
       fn find_longest_path_helper(distance_dict: DistanceDict, places: Set(String)) {

     

       104
       104
       +
         places

     

       105
       105
       +
         |> set.fold(0, fn(longest_path, place1) {

     

       106
       106
       +
           let places = places |> set.delete(place1)

     

       107
       107
       +
           let path =

     

       108
       108
       +
             places

     

       109
       109
       +
             |> set.fold(longest_path, fn(longest_path, place2) {

     

       110
       110
       +
               let assert Ok(path) = dict.get(distance_dict, TwoPlaces(place1, place2))

     

       111
       111
       +
               find_longest_path(

     

       112
       112
       +
                 distance_dict,

     

       113
       113
       +
                 places |> set.delete(place2),

     

       114
       114
       +
                 longest_path,

     

       115
       115
       +
                 path,

     

       116
       116
       +
                 place2,

     

       117
       117
       +
               )

     

       118
       118
       +
             })

     

       119
       119
       +
           case path > longest_path {

     

       120
       120
       +
             True -> path

     

       121
       121
       +
             False -> longest_path

     

       122
       122
       +
           }

     

       123
       123
       +
         })

     

       124
       124
       +
       }

     

       125
       125
       +
       

     

       126
       126
       +
       pub fn main() {

     

       127
       127
       +
         let input =

     

       128
       128
       +
           read(from: "../input.txt")

     

       129
       129
       +
           |> unwrap("")

     

       130
       130
       +
           |> trim()

     

       131
       131
       +
           |> string.split("\n")

     

       132
       132
       +
           |> list.map(fn(v) {

     

       133
       133
       +
             case string.split(v, " ") {

     

       134
       134
       +
               [place1, "to", place2, "=", distance] ->

     

       135
       135
       +
                 Distance(place1, place2, distance |> int.base_parse(10) |> unwrap(0))

     

       136
       136
       +
               _ -> Distance("silent_fail", "because_we_are_lazy", 0)

     

       137
       137
       +
             }

     

       138
       138
       +
           })

     

       139
       139
       +
       

     

       140
       140
       +
         let MapPlaces(distance_dict, places) =

     

       141
       141
       +
           input

     

       142
       142
       +
           |> list.fold(MapPlaces(dict.new(), set.new()), fn(v, distance) {

     

       143
       143
       +
             let map =

     

       144
       144
       +
               dict.insert(

     

       145
       145
       +
                 v.dict,

     

       146
       146
       +
                 TwoPlaces(distance.place1, distance.place2),

     

       147
       147
       +
                 distance.value,

     

       148
       148
       +
               )

     

       149
       149
       +
             let map =

     

       150
       150
       +
               dict.insert(

     

       151
       151
       +
                 map,

     

       152
       152
       +
                 TwoPlaces(distance.place2, distance.place1),

     

       153
       153
       +
                 distance.value,

     

       154
       154
       +
               )

     

       155
       155
       +
             let places = set.insert(v.places, distance.place1)

     

       156
       156
       +
             let places = set.insert(places, distance.place2)

     

       157
       157
       +
             MapPlaces(map, places)

     

       158
       158
       +
           })

     

       159
       159
       +
       

     

       160
       160
       +
         println(

     

       161
       161
       +
           find_shortest_path_helper(distance_dict, places)

     

       162
       162
       +
           |> to_string,

     

       163
       163
       +
         )

     

       164
       164
       +
         println(

     

       165
       165
       +
           find_longest_path_helper(distance_dict, places)

     

       166
       166
       +
           |> to_string,

     

       167
       167
       +
         )

     

       168
       168
       +
       }