C#•3y ago

Pipeline(algorithm exercise)

I can't understand this problem, does anyone has an idea how to solve it?

7 Replies

i love cat(mull-rom splines)•3y ago

DP actually looks like a bitmask dp

P3trovOP•3y ago

Really, I can't understand this condition 😄

i love cat(mull-rom splines)•3y ago

i guess?

f(i, j, byte[3] map) = max({
    f(i, j+1, map) : j+1 < agent[i].max,
    f(i+1, 0, map with map[j] assigned with i)+1 : map[agent[i][j]] is not assigned
})

for all assignment in map do
    yield (agent[i].guid, map[i].name)

f(i, j, byte[3] map) = max({
    f(i, j+1, map) : j+1 < agent[i].max,
    f(i+1, 0, map with map[j] assigned with i)+1 : map[agent[i][j]] is not assigned
})

for all assignment in map do
    yield (agent[i].guid, map[i].name)

byte[3] to size of Pn i dont think it actually needs to store the state, but i cant think of other ways and before returning just set a global byte[Pn] map when f(_) is > lastmax or you could set it to byte[15]

P3trovOP•3y ago

after a while i will try it

Unknown User•3y ago

Message Not Public

i love cat(mull-rom splines)•3y ago

also also thing is 10x15 isnt a whole lot of mappings

Unknown User•3y ago

Message Not Public

Gaming

Programming

Pipeline(algorithm exercise)

Did you find this page helpful?