frero/advent_of_code
0
0
Fork 0
mirror of https://github.com/fredrikr79/advent_of_code.git synced 2025-12-27 04:30:20 +01:00
Code Issues Packages Projects Releases Wiki Activity

solve 2024 day 2 part 2

Browse Source
This commit is contained in:
Fredrik Robertsen
2024-12-02 19:29:38 +01:00
committed by GitHub
parent 95ff77d9fa
commit cd20a596d1
1 changed files with 8 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
2024/day_2/uiua/README.md
View File

@@ -1,3 +1,11 @@
# part 1
[solution](https://uiua.org/pad?src=0_14_0-dev_5__JmZyYXMgImlucHV0IgoKIyByYWdnZWQgbGluZXMKIyBzcGxpdCBzdHJpbmcgb24gbmV3bGluZSwKIyBhbGxvd2luZyByYWdnZWQsIGJveGVkIGFycmF5ClJMaW5lcyDihpAg4oqc4pah4oq44omgQFxuCgojIHNwbGl0IHNwYWNlCiMgc3BsaXQgb24gc3BhY2UgY2hhciwKIyBwYXJzZSB0byBudW1iZXIKU3BsaXRTIOKGkCDiipzii5XiirjiiaBAIAoKIyBjcmVhdGVzIGFycmF5IG9mIGJveGVkIG51bWJlcnMKIyBmcm9tIHNpbmdsZSBzdHJpbmcKUGFyc2Ug4oaQIOKNmlNwbGl0UyBSTGluZXMKCiMgaXMgaW4gZ2l2ZW4gaW50ZXJ2YWw_CiMgYWNjZXB0cyBudW1iZXIgezN9IGlmZgojIC0gezN9IOKJpSB7MX07IGFuZAojIC0gezN9IOKJpCB7Mn0KSXNJR0kg4oaQID0xw5cg4oqDKOKJpeKKmeKLheKKmXziiaTii4XiipniipkpCgojIGRlbHRhCiMgY2FsY3VsYXRlIGRpc3RhbmNlIGJldHdlZW4KIyBlYWNoIG51bWJlciBwYWlyIGluIHNlcXVlbmNlCs60IOKGkCDijLXiiaEvLeKXqzIKCiMgaXMgZGVsdGEgaW4gcmFuZ2U_CiMgYWNjZXB0cyBzZXF1ZW5jZSBvZiBudW1iZXJzIGlmZgojIC0gZGlzdGFuY2UgzrQgYmV0d2VlbiBlYWNoCiMgICBudW1iZXIgaXMgMSDiiaQgzrQg4omkIDMKSXNESVIg4oaQID0xL8OXIElzSUdJIDEgMyDOtAoKIyBpcyBtb25vdG9uaWM_CiMgYWNjZXB0cyBzZXF1ZW5jZSBvZiBudW1iZXJzIGlmZgojIC0gdGhleSBhcmUgYWxsIGluY3JlYXNpbmc7IG9yCiMgLSB0aGV5IGFyZSBhbGwgZGVjcmVhc2luZwpJc01vbm8g4oaQIOKGpeKKgyjiiY184omN4oeMKeKKuOKNhgoKIyBhY2NlcHRzIHNlcXVlbmNlIG9mIG51bWJlcnMgaWZmCiMgLSBpcyBtb25vdG9uaWM7IGFuZAojIC0gMSDiiaQgzrQg4omkIDMKSXNTYWZlIOKGkCA9McOXIOKKg0lzTW9ubyBJc0RJUgoKIyB1bmJveCBzdW0gb2Ygc2FmZSBzZXF1ZW5jZXMKU29sIOKGkCDCsOKWoS8rIOKNmklzU2FmZQpTb2wgUGFyc2UK)
note: has a runtime complexity of O(n * length of line) for n lines. so its essentially O(n^2), but not really because the length of each line is much lower than the amount of lines.
# part 2
[solution](https://uiua.org/pad?src=0_14_0-dev_5__JmZyYXMgImlucHV0IgoKIyByYWdnZWQgbGluZXMKIyBzcGxpdCBzdHJpbmcgb24gbmV3bGluZSwKIyBhbGxvd2luZyByYWdnZWQsIGJveGVkIGFycmF5ClJMaW5lcyDihpAg4oqc4pah4oq44omgQFxuCgojIHNwbGl0IHNwYWNlCiMgc3BsaXQgb24gc3BhY2UgY2hhciwKIyBwYXJzZSB0byBudW1iZXIKU3BsaXRTIOKGkCDiipzii5XiirjiiaBAIAoKIyBjcmVhdGVzIGFycmF5IG9mIGJveGVkIG51bWJlcnMKIyBmcm9tIHNpbmdsZSBzdHJpbmcKUGFyc2Ug4oaQIOKNmlNwbGl0UyBSTGluZXMKCiMgaXMgaW4gZ2l2ZW4gaW50ZXJ2YWw_CiMgYWNjZXB0cyBudW1iZXIgezN9IGlmZgojIC0gezN9IOKJpSB7MX07IGFuZAojIC0gezN9IOKJpCB7Mn0KSXNJR0kg4oaQID0xw5cg4oqDKOKJpeKKmeKLheKKmXziiaTii4XiipniipkpCgojIGRlbHRhCiMgY2FsY3VsYXRlIGRpc3RhbmNlIGJldHdlZW4KIyBlYWNoIG51bWJlciBwYWlyIGluIHNlcXVlbmNlCs60IOKGkCDijLXiiaEvLeKXqzIKCiMgaXMgZGVsdGEgaW4gcmFuZ2U_CiMgYWNjZXB0cyBzZXF1ZW5jZSBvZiBudW1iZXJzIGlmZgojIC0gZGlzdGFuY2UgzrQgYmV0d2VlbiBlYWNoCiMgICBudW1iZXIgaXMgMSDiiaQgzrQg4omkIDMKSXNESVIg4oaQID0xL8OXIElzSUdJIDEgMyDOtAoKIyBpcyBtb25vdG9uaWM_CiMgYWNjZXB0cyBzZXF1ZW5jZSBvZiBudW1iZXJzIGlmZgojIC0gdGhleSBhcmUgYWxsIGluY3JlYXNpbmc7IG9yCiMgLSB0aGV5IGFyZSBhbGwgZGVjcmVhc2luZwpJc01vbm8g4oaQIOKGpeKKgyjiiY184omN4oeMKeKKuOKNhgoKIyBhY2NlcHRzIHNlcXVlbmNlIG9mIG51bWJlcnMgaWZmCiMgLSBpcyBtb25vdG9uaWM7IGFuZAojIC0gMSDiiaQgzrQg4omkIDMKSXNTYWZlIOKGkCA9McOXIOKKg0lzTW9ubyBJc0RJUgoKIyBjcmVhdGUgdGhlIG5vdCBvZiB7MX0tc2l6ZSAKIyBpZGVudGl0eSBtYXRyaXgKTm90SUQg4oaQIMKs4oqePeKIqeKHoS4KCiMgY3JlYXRlIG7DlyhuLTEpLW1hdHJpeCBmb3JtCiMgbGVuZ3RoIG4gc2VxdWVuY2Ugd2hlcmUgdGhlCiMgaSd0aCBudW1iZXIgaXMgcmVtb3ZlZCwgaGVuY2UKIyAobi0xKSBjb2x1bW4gc2l6ZS4KQ292ZXIg4oaQIOKJoeKWveKKmcKkTm90SUTip7suCgojIHVzZSBzb2x1dGlvbiBmcm9tIHBhcnQgMSwKIyBidXQgcnVuIGl0IG9uIGVhY2ggY292ZXIKU29sIOKGkCDCsOKWoS8r4o2aKC_ihqXiiaFJc1NhZmUgQ292ZXIpClNvbCBQYXJzZQo=)
note: this one has horrible runtime complexity. it uses the previous solution from part 1, but with an additional O(n^2) for each line (because it computes the not of an identity matrix equal to the length of each line). sounds like O(n^3). no wonder it takes a little while to run the code with the input.