Search found 196 matches

by Robert Gerbicz
Sun Jul 27, 2008 12:50 am
Forum: Volume 106 (10600-10699)
Topic: 10645 - Menu
Replies: 12
Views: 7601

Re:

I'm having hard time with this one and I don't know why. I'm using dynamic programming in O(n * k * m) time and O(k * m) memory. My solution runs in O(n*k^2*m) time and using O(k*m*n) memory. But it works, and really fast: 0.01 sec. (first place). I like this problem, very good and interesting in d...
by Robert Gerbicz
Thu Jul 24, 2008 1:43 pm
Forum: Volume 114 (11400-11499)
Topic: 11459 - Snakes and Ladders
Replies: 33
Views: 14825

Re: 11459 - Snakes and Ladders

Today there was a rejudge for the problem. Now I've got AC, proving that my posted algorithm is good. Among the 26 users who tried it there are 16 users who got AC.
by Robert Gerbicz
Mon Jul 14, 2008 6:44 pm
Forum: Volume 114 (11400-11499)
Topic: 11463 - Commandos
Replies: 18
Views: 10225

Re: 11463 - Commandos

Use Floyd-Warshall in O(|V|^3), or two bfs in O(|E|) time.
by Robert Gerbicz
Sat Jul 12, 2008 11:32 pm
Forum: Volume 114 (11400-11499)
Topic: 11465 - Count the Polygons
Replies: 4
Views: 1263

Re: 11465 - Count the polygons

There is a method to solve the problem in O(u*2^u) time and O(2^u) memory where u=N/2.
I've done this on the contest. This algorithm took 1.32 sec.
by Robert Gerbicz
Sat Jul 12, 2008 11:26 pm
Forum: Volume 114 (11400-11499)
Topic: 11466 - Largest Prime Divisor
Replies: 29
Views: 15690

Re: 11466 - Largest Prime Divisor

Another critical input: if n=1 or n=-1 then you should also print -1.
by Robert Gerbicz
Mon Jul 07, 2008 6:33 pm
Forum: Volume 100 (10000-10099)
Topic: 10054 - The Necklace
Replies: 62
Views: 31413

Re: 10054 - The Necklace

One easy input (contains two tests), but your program may fail these if you don't use multiple edges in your code. You can form a necklace from both beads tests. 2 5 50 50 50 50 50 50 50 50 50 50 6 1 50 1 50 1 50 1 50 1 50 1 50 One possible output: Case #1 50 50 50 50 50 50 50 50 50 50 Case #2 1 50 ...
by Robert Gerbicz
Wed Jul 02, 2008 10:20 pm
Forum: Volume 100 (10000-10099)
Topic: 10078 - The Art Gallery
Replies: 20
Views: 6274

Re: 10078 - The Art Gallery

This problem is NOT a convex hull finding task. The points are sorted, as described in the problem statement.
[my AC solution haven't used a convex hull algorithm].
by Robert Gerbicz
Fri Jun 27, 2008 2:12 am
Forum: Volume 114 (11400-11499)
Topic: 11459 - Snakes and Ladders
Replies: 33
Views: 14825

Re: 11459 - Snakes and Ladders

Should give the following based on the problem description, because you only move to 100 after throwing the dice!! Not by tunneling to >100. I think you fail this case. Yes, probably, but in that case the problem's description would be totally broken, because it says: The ***squares*** of the grid ...
by Robert Gerbicz
Thu Jun 26, 2008 3:30 pm
Forum: Volume 114 (11400-11499)
Topic: 11459 - Snakes and Ladders
Replies: 33
Views: 14825

Re: 11459 - Snakes and Ladders

Robert, during the contest, there are 2 people who got AC on this problem. You can refer to http://icpcres.ecs.baylor.edu/onlinejudge/index.php?option=com_onlinejudge&Itemid=13&page=show_contest&contest=201 and you will find it. It's very few, and proves nothing. See for example problem 11272, it h...
by Robert Gerbicz
Thu Jun 26, 2008 1:39 pm
Forum: Volume 114 (11400-11499)
Topic: 11459 - Snakes and Ladders
Replies: 33
Views: 14825

Re: 11459 - Snakes and Ladders

Your algo is not right. Notice it says No square contains more than one endpoint of ***any*** (any one) snake or ladder --- that means diffrent snakes can share end points. ... maybe that's why so few acs. I checked the dataset and found that many squares have both end point and starting point. And...
by Robert Gerbicz
Tue Jun 24, 2008 1:09 am
Forum: General
Topic: Low success rate problems, Data seeds
Replies: 1
Views: 2645

Re: Low success rate problems, Data seeds

Yes, obviously there are many broken/wrong problems on acm uva. But I think it would be much better to investigate also those problems that has been solved by less than 3 peoples (so 0,1 or 2), because in these cases one of them in general is the problemsetter by his wrong solution and another peopl...
by Robert Gerbicz
Sat Jun 21, 2008 2:50 pm
Forum: Volume 114 (11400-11499)
Topic: 11459 - Snakes and Ladders
Replies: 33
Views: 14825

11459 - Snakes and Ladders

This problem has been solved by only 2 peoples on the contest, but it has been attempted by lots of peoples and it should be an easy problem. Just a simulation task. What is wrong by my method: 0. Read the number of test cases. While there is a testcase do: 1. Read the number of players, ladders, di...
by Robert Gerbicz
Sat Jun 21, 2008 11:51 am
Forum: Bugs and suggestions
Topic: Waterloo contest, without verdict. It's very confusing!!!!!!
Replies: 1
Views: 1506

Waterloo contest, without verdict. It's very confusing!!!!!!

Would it be possible to know why the "Real Time Clarification" topic contains the old contest's data and not the new Waterloo? Also, how can I interpret the submission for problem D without a verdict? This is so confusing... I've sent a clarification email half an hour and 0 response. And I can't ma...
by Robert Gerbicz
Sun Jun 15, 2008 12:57 am
Forum: Other words
Topic: Felix Halim's Hunting UVA Problems returns!
Replies: 7
Views: 6940

Re: Felix Halim's Hunting UVA Problems returns!

Sorry, I didn't get it. My old uva id doesn't work and we do not have any user id on the new site. We login with user name and password. So what is the new user id? One possible way to get that (probably not the easiest): login goto My Statistics, there you can find how many problems have you solve...
by Robert Gerbicz
Mon Jun 09, 2008 11:04 pm
Forum: Other words
Topic: Felix Halim's Hunting UVA Problems returns!
Replies: 7
Views: 6940

Re: Felix Halim's Hunting UVA Problems returns!

sohel wrote:I am getting an error : Path '//html/body/div[2]/div/div[4]/div[3]/div/div/table[2]/tr' doesn't exists!.
Yes, there was a problem on the site. But now it has been fixed. Note that you should use your new user uva id, not the old!
Your stat is here: http://felix-halim.net/uva/hunting.php?id=5284

Go to advanced search