One problem is about getting an optimal solution for a game like Click-o-mania.
The other problem is about bombs that are thrown to demolish circular areas and the total destroyed area is required.
Does anybody remember the problem numbers?
Thanks.Problem numbers?
Moderator: Board moderators
Problem numbers?
I have seen two problems more than a year ago, but I cannot remember their numbers, so I can't reach them again
One problem is about getting an optimal solution for a game like Click-o-mania.
The other problem is about bombs that are thrown to demolish circular areas and the total destroyed area is required.
Does anybody remember the problem numbers? Thanks.
One problem is about getting an optimal solution for a game like Click-o-mania.
The other problem is about bombs that are thrown to demolish circular areas and the total destroyed area is required.
Does anybody remember the problem numbers?
Thanks.http://acm.uva.es/p/v105/10559.html is similar to Click-o-mania, but the difference is that it is one-dimensional. Is this what u were looking for?
Thanks I am not sure if the Click-o-mania problem was for 1-D or 2-D, but this seems to be the right problem. I suppose the problem in 2-D will be really so hard that you can't expect to find such a problem in UVA, unless the limits allow for an exponential-time algorithm. Does anybody know a similar problem but in 2-D?
I am not sure if the Click-o-mania problem was for 1-D or 2-D, but this seems to be the right problem. I suppose the problem in 2-D will be really so hard that you can't expect to find such a problem in UVA, unless the limits allow for an exponential-time algorithm. Does anybody know a similar problem but in 2-D?