geoffrey/hashcode2016
geoffrey/hashcode2016
Archived
1
0
Fork 0
Code Issues Pull requests Releases Wiki Activity

FLY LITTLE MONSTERS!

Browse source
This commit is contained in:
Geoffrey Frogeye 2016-02-11 21:35:07 +01:00
parent b2f1c7319f
commit 042f668374
1 changed files with 3 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
main.py
View file

@ -135,6 +135,7 @@ def load(d, w, p, q):
assert(Da[d]) assert(Da[d])
if (Dp[d] != Wp[w]): if (Dp[d] != Wp[w]):
Dd[d] += distance(Dp[d], Wp[w]) Dd[d] += distance(Dp[d], Wp[w])
Dd[d] = Cw[c]
Wi[w][p] += -q Wi[w][p] += -q
Di[d][p] += +q Di[d][p] += +q
assert(Wi[w][p] >= 0) assert(Wi[w][p] >= 0)
@ -148,6 +149,7 @@ def unload(d, w, p, q):
assert(Da[d]) assert(Da[d])
if (Dp[d] != Wp[w]): if (Dp[d] != Wp[w]):
Dd[d] += distance(Dp[d], Wp[w]) Dd[d] += distance(Dp[d], Wp[w])
Dd[d] = Cw[c]
Wi[w][p] += +q Wi[w][p] += +q
Di[d][p] += -q Di[d][p] += -q
assert(Dd[d] <= T) assert(Dd[d] <= T)
@ -159,6 +161,7 @@ def deliver(d, c, p, q):
assert(Da[d]) assert(Da[d])
if (Dp[d] != Cp[c]): if (Dp[d] != Cp[c]):
Dd[d] += distance(Dp[d], Cp[c]) Dd[d] += distance(Dp[d], Cp[c])
Dd[d] = Cp[c]
Ci[c][p] += +q Ci[c][p] += +q
Di[d][p] += -q Di[d][p] += -q
Dd[d] += 1 Dd[d] += 1