Discussion @ 1208. Legendary Teams Contest @ Timus Online Judge

Не сводится ли данная задача к...

Posted by Leonid (SLenik) Andrievskiy 11 Jul 2009 01:43

Господа, скажите, а не сводится ли даная задача к задаче о посроении всех тупиковых покрытий для булевой матрицы, строки которой - программисты, а столбцы - команды? (a[i, j] = 1, если соотв. программист есть в команде).

this task it's simple to solve dp or bruteforce ;)

Posted by [LG]_#\#@P$T[101]R 11 Jul 2009 01:57

No subject

Posted by Shellkunchik 20 Jul 2009 21:20

Edited by author 20.07.2009 21:21

Re: No subject

Posted by Leonid (SLenik) Andrievskiy 20 Jul 2009 21:21

> this task it's simple to solve dp or bruteforce ;)
I wanna find another solution or reduce the problem to cybernetics.

Re: No subject

Posted by svr 20 Jul 2009 22:52

There is all accepted methods with there bounderies
but special "cybernetics" exits for burocrats only.

Discussion of Problem 1208. Legendary Teams Contest