-
Notifications
You must be signed in to change notification settings - Fork 2
exactlyelectrical
bradendubois edited this page Nov 24, 2021
·
10 revisions
ID: exactlyelectrical
Difficulty: 2.1
CPU Time: 1 second
Memory: 1024 MB
For this, take the absolute value of the difference between a and c, and the absolute value of the difference between b and d. The path needs to be exactly this many total units; if t is >= this distance, we have at least enough, and if the remaining distance (t - distance) is strictly even, then we can simply bounce back and forth along some adjacent road to waste the remaining charge units.