Search found 27 matches

by greve
Tue May 25, 2010 2:32 pm
Forum: Volume 117 (11700-11799)
Topic: 11793 - Electoral Districts
Replies: 2
Views: 1836

Re: 11793 - Electoral Districts

The answer given in the sample output is not correct. The correct answer is -1. Fortunately the judge data is fine.
by greve
Tue Oct 27, 2009 9:25 pm
Forum: Volume 116 (11600-11699)
Topic: 11685 - Moveable maze
Replies: 1
Views: 2438

Re: 11685 - Moveable maze

Unfortunately there seems to be no good solution for this problem. Even the official judge solution is wrong. For details, see http://forums.topcoder.com/?module=Thre ... 29#1149317.
by greve
Tue Oct 27, 2009 9:16 pm
Forum: Volume 117 (11700-11799)
Topic: 11705 - Grasshopper
Replies: 5
Views: 2646

Re: 11705 -- Grasshopper

I was also stumped by that statement for a while. I finally realized that it meant that position (x,y) is better than (x', y') iff x < x' or (x = x' and y < y'), i.e. just lexicographical order. In other words, we first do a comparison on the x-coordinate (north/south) preferring northernmost, and i...
by greve
Mon Aug 10, 2009 6:37 pm
Forum: Volume 116 (11600-11699)
Topic: 11644 - Pyragrid
Replies: 1
Views: 398

Re: 11644 - Pyragrid

I just solved the problem, so you can use my solution to get the correct output for your test cases (http://uvatoolkit.com/problemssolve.php#11644).
by greve
Wed May 20, 2009 8:38 am
Forum: Volume 116 (11600-11699)
Topic: 11613 - Acme Corporation
Replies: 5
Views: 1909

Re: 11613 - Acme Corporation

You are right - I am solving min cost flow. I have also been told that it can be done with a single run of min-cost max-flow using the successive shortest path method, so that should speed up my solution significantly.
by greve
Tue May 19, 2009 7:20 pm
Forum: Volume 116 (11600-11699)
Topic: 11613 - Acme Corporation
Replies: 5
Views: 1909

Re: 11613 - Acme Corporation

I contacted the problem author, and he told me that there was an error in the sample output. It is supposed to be 20 (not 2), but it will probably be corrected soon. Anyway, the problem can be solved using discrete ternary search and max-cost max-flow, but my solution is quite slow, so maybe there i...
by greve
Mon May 18, 2009 7:31 pm
Forum: Volume 116 (11600-11699)
Topic: 11613 - Acme Corporation
Replies: 5
Views: 1909

11613 - Acme Corporation

Can anybody explain to me how the answer for the case in the sample input is 2? I have been looking at the problem for a while now, and it seems to me that it can be solved using max-cost max-flow, but it seems a bit pointless to try if one cannot understand the sample output.
by greve
Fri Feb 06, 2009 9:38 pm
Forum: Volume 9 (900-999)
Topic: 972 - Horizon Line
Replies: 2
Views: 5589

Re: 972 - Horizon Line

The inputs you have provided are a bit misleading because they are not valid according to the problem statement.
by greve
Sun Oct 26, 2008 12:32 pm
Forum: Volume 115 (11500-11599)
Topic: 11545 - Avoiding Jungle in the Dark
Replies: 13
Views: 4513

Re: 11545 Avoiding Jungle in the Dark

9 S.**....*****D S.****..*****D S*.**.*.*****D S**.....*****D S**...*.*****D S**.*...*****D S**.*.*.*****D S**.***.*****D S****.*.*****D According to my AC program all answers are -1. Your code outputs 29 on all of them. You can get the expected answers for your own input sets on my homepage, http:...
by greve
Wed Oct 08, 2008 3:13 pm
Forum: Volume 102 (10200-10299)
Topic: 10269 - Adventure of Super Mario
Replies: 5
Views: 3189

Re: 10269 - Adventure of Super Mario

I thought about the case for some time, and initially thought that there was a bug in my solution, but now I believe that my solution (i.e. the one on uvatoolkit) is correct. The explanation for the second case is as follows. First we go from village 1 to castle 2 for at cost of 8 and then we use th...
by greve
Mon Sep 08, 2008 7:06 pm
Forum: Volume 102 (10200-10299)
Topic: 10269 - Adventure of Super Mario
Replies: 5
Views: 3189

Re: 10269 - Adventure of Super Mario

My solution returns the same output (you can test other sets for the problem on http://www.uvatoolkit.com).
by greve
Wed Jun 25, 2008 9:49 pm
Forum: Algorithms
Topic: becoming a maestro of DP
Replies: 7
Views: 4425

Re: becoming a maestro of DP

Also try my site http://uvatoolkit.com/problemssolve.php (search for DP).
by greve
Mon May 26, 2008 6:56 pm
Forum: Volume 107 (10700-10799)
Topic: 10707 - 2D-Nim
Replies: 15
Views: 20617

Re:

Darko wrote:Can someone check if their AC is still AC on the new server?
I just coded it and got AC.
by greve
Sun May 25, 2008 8:46 pm
Forum: Bugs and suggestions
Topic: 10750 - Beautiful Points
Replies: 7
Views: 3985

Re: 10750 - Beautiful Points

Bump again.
by greve
Wed Mar 19, 2008 10:04 am
Forum: Volume 114 (11400-11499)
Topic: 11423 - Cache Simulator
Replies: 3
Views: 1495

There is a good discussion about this problem on the topcoder forums:
http://forums.topcoder.com/?module=Thre ... 02&start=0

I implemented the algorithm mentioned and got AC in 1.320 seconds.

Go to advanced search