Guardian of Decency - H

Do you want to discuss about these problems? Go now!
Users are shared (no need to re-register).

Moderator: Board moderators

Post Reply
Rostislav
New poster
Posts: 21
Joined: Sun Oct 05, 2003 11:19 am
Location: Bulgaria, Shoumen
Contact:

Guardian of Decency - H

Post by Rostislav » Mon Nov 14, 2005 10:15 pm

Is it possible to give me some hints about that problem
http://acmicpc-live-archive.uva.es/nuev ... php?p=3415

Rostislav
P.S. Adrian K

AnGeLoSo
New poster
Posts: 8
Joined: Tue Oct 11, 2005 1:47 am

Post by AnGeLoSo » Mon Nov 14, 2005 11:38 pm

Do u get T.L.E. using some backtricking or branch and bound algorithm??

Rostislav
New poster
Posts: 21
Joined: Sun Oct 05, 2003 11:19 am
Location: Bulgaria, Shoumen
Contact:

Post by Rostislav » Tue Nov 15, 2005 12:31 am

yes

Monsoon
Learning poster
Posts: 66
Joined: Fri Jul 23, 2004 4:42 pm
Location: Poland

Post by Monsoon » Tue Nov 15, 2005 1:09 am

it's max independent set problem in biparite graph :)

Post Reply

Return to “ACM ICPC Archive Board”