## Search found 41 matches

Mon Jan 22, 2007 1:15 pm
Forum: Volume 111 (11100-11199)
Topic: 11155 - Be Efficient
Replies: 15
Views: 10312
Mon Jan 22, 2007 12:56 pm
Forum: Volume 111 (11100-11199)
Topic: 11160 - Going Together
Replies: 10
Views: 5684
Can you share more tests , please ? I pass all the tests on the board and from the problem statement , and still I can't AC it.

Wed Jul 19, 2006 1:13 pm
Forum: Algorithms
Topic: Graph problem
Replies: 12
Views: 3610
Don't worry dude !
If you still have problems after Tanu's private message ask here..
Wed Jul 19, 2006 4:06 am
Forum: Algorithms
Topic: Graph problem
Replies: 12
Views: 3610
I think you actually got the right algorithm for Camelot , but try to do it with bfs , because this recursion does many stack calls. And posting the whole matrix and so many variables .. only fills the stack , I don't know how much memory does it need. And the bfs finds the optimal way when you visi...
Mon Jul 17, 2006 1:03 am
Forum: Algorithms
Topic: Graph problem
Replies: 12
Views: 3610
Do a bfs from the startx,starty , generate all the possible next positions and if they are not visited enqueue them and so on , keep the distance to D[x][y]. when you pop the position you are interested in stop the bfs and output it's distance....
Sun Apr 02, 2006 2:19 pm
Forum: Volume 110 (11000-11099)
Topic: 11024 - Circular Lock
Replies: 14
Views: 4318
rushel , you are underestimating the problem , it's not that easy.
Sun Feb 26, 2006 4:35 pm
Forum: Volume 109 (10900-10999)
Topic: 10999 - Crabbles
Replies: 26
Views: 13819
Isn't there a trickier and faster way to solve this problem ? Cause this seems too much brute force to me , is this the way to solve this kind of problems ? Thank you in advance !

P.S. I just was hoping for something really clever
Wed Oct 26, 2005 8:09 pm
Forum: Volume 109 (10900-10999)
Topic: 10937 - Blackbeard the Pirate
Replies: 14
Views: 7056
It is a travelling salesman problem
Mon Oct 17, 2005 11:53 am
Forum: Volume 109 (10900-10999)
Topic: 10926 - How Many Dependencies?
Replies: 33
Views: 14010
Thank you for your reply , I did it the same way .. but a friend told me that it could be done with topological sorting(if someone knows how it is done with top. sorting please tell) , this is why I asked you Anyway , thank you !
Mon Oct 17, 2005 12:53 am
Forum: Volume 109 (10900-10999)
Topic: 10926 - How Many Dependencies?
Replies: 33
Views: 14010
Timo , did you use the dfs for making a topological sort ? If yes , after this how did you count the value for every vertex ?
Mon Oct 17, 2005 12:50 am
Forum: Volume 109 (10900-10999)
Topic: 10930 - A-Sequence
Replies: 102
Views: 31505
To see if some numbers make some SUM , use DP ! It is a standart algorithm - making of sum from some coins. Ask if you have any further questions:)
Mon Sep 26, 2005 2:51 am
Forum: Volume 109 (10900-10999)
Topic: 10918 - Tri Tiling
Replies: 12
Views: 6048
I figured out the DP solution and am happy now
Mon Sep 26, 2005 1:50 am
Forum: Volume 109 (10900-10999)
Topic: 10918 - Tri Tiling
Replies: 12
Views: 6048

### 10918 - Tri-Tialing

Hello , I cannot figure out the solution , and when the problem is considered as an easy one I am getting little frustrated ( there probably is something very little which I can't see ) :( Please help me to get out of this situation. This is the solution I coded , but it appears to be wrong. I don't...
Sat Jul 09, 2005 11:28 am
Forum: Algorithms
Topic: Sweeping Algorithms
Replies: 2
Views: 1028
Thank you I will try it
Sat Jul 09, 2005 1:38 am
Forum: Algorithms
Topic: Sweeping Algorithms
Replies: 2
Views: 1028

### Sweeping Algorithms

I have recently studied the sweeping technique and am excited about it. I want to try solving some problems with it . Any suggestions ? ( Some problem names/numbers - from UVa , IOI/BOI/CeOI .. doesn't matters as long as it is solveable by sweeping).