antifallobst
/
bwinf-42-1
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity
7 Commits 1 Branch 0 Tags 5.9 MiB
Rust 100%
Go to file
antifallobst 18f419dfe5
feat(nandu): implemented input file parsing 		2023-09-17 23:44:57 +02:00
nandu feat(nandu): implemented input file parsing 2023-09-17 23:44:57 +02:00
st-egano feat(st-egano): implemented everything lol 2023-09-15 18:15:10 +02:00
zauberschule fix: remoced double about from cli help 2023-09-15 00:07:24 +02:00
.gitignore initial commit 2023-09-13 18:26:07 +02:00
README.md initial commit 2023-09-13 18:26:07 +02:00

README.md

BundesWettbewerbINFormatik 42.1

Ideas

St. Egano

This is going to be so straight forward, that I've no clue how to come up with an idea for this lol.

Zauberschule

The idea is to create a graph and just solve the thing with dijkstra. In this graph, every field of the maps is represented as a node. Every node is connected to the nodes next to it and the node with the same index on the other map. For connections on the same map, the gravity is 1. For connections to the other map, the gravity is 3. And, voila, now we have a graph to run dijkstra on.

Nandu

The blocks represent logic gates.

  • White: NAND
  • Red: NOT
  • Blue: Just copies the signal

The idea is to just simulate™ these logic flows.