Search found 202 matches

by baodog
Fri Oct 24, 2008 10:45 pm
Forum: Volume 115 (11500-11599)
Topic: 11531 - Solve the Broken Maze
Replies: 15
Views: 6520

Re: 11531 - Solve the Broken Maze

Hi Laycurse,

Would you be willing to describe your solution a little?
I tried 4^4 states per column, and handling 256*256 state transitions,
but is too slow. How do you handle the states? How do you
go to the left after you have gone to the right in your DP? Thanks!
by baodog
Fri Oct 24, 2008 9:49 am
Forum: Bugs and suggestions
Topic: Joomla!
Replies: 1
Views: 1831

Re: Joomla!

Miguel says the machine hosting their DB is slow and cranky.
They will have it replaced in a month or so, then everything will be much
smoother.
by baodog
Thu Oct 23, 2008 9:26 pm
Forum: Volume 115 (11500-11599)
Topic: 11521 - Compressor
Replies: 18
Views: 5991

Re: 11521 - Compressor (Wrong data)

"Based on one solution the problemsetter has found that smaler strings have been found, so now it is being verified whether that solution is correct. I have forwarded an assumed correct output already, and not sure whether that has been placed." From this statement, it looks like both Igor's and the...
by baodog
Wed Oct 22, 2008 8:26 am
Forum: Volume 115 (11500-11599)
Topic: 11521 - Compressor
Replies: 18
Views: 5991

Re: 11521 - Compressor (Wrong data)

Is the data still wrong? I see Igor get accepted. Is this wrong solution getting accepted, or right solution? Thanks!
by baodog
Tue Oct 21, 2008 12:40 pm
Forum: Volume 115 (11500-11599)
Topic: 11534 - Say Goodbye to Tic-Tac-Toe
Replies: 10
Views: 3088

Re: 11534 - Say Goodbye to Tic-Tac-Toe

I get the same answers as you do.
by baodog
Tue Oct 21, 2008 4:35 am
Forum: Volume 115 (11500-11599)
Topic: 11529 - Strange Tax Calculation
Replies: 7
Views: 1343

Re: 11529 Special Tax

Thanks! I do a circular line sweep from each point, it takes O(n lg n) for each point.

I'm getting WA in 7 seconds though...
by baodog
Tue Oct 21, 2008 2:51 am
Forum: Volume 115 (11500-11599)
Topic: 11529 - Strange Tax Calculation
Replies: 7
Views: 1343

Re: 11529 Special Tax

How is O(n^2 lgn) possible :-) ? It takes O(n^3) to enumerate all the triangles.
Some triangles can contain other triangles, but they may not. All triangles
can overlap but not be inside each other.
by baodog
Tue Oct 21, 2008 12:46 am
Forum: Volume 115 (11500-11599)
Topic: 11529 - Strange Tax Calculation
Replies: 7
Views: 1343

11529 - Strange Tax Calculation

Hi,

I pick random 25000 random triangles, and use a really good random number generator
that can generate 1 million random numbers with no problem, but still get WA!

Help is really appreciated. I tried many submissions, brute forcing small cases,
and difference seeds for my random number generator.
by baodog
Tue Oct 21, 2008 12:44 am
Forum: Volume 115 (11500-11599)
Topic: 11531 - Solve the Broken Maze
Replies: 15
Views: 6520

Re: 11531 - Solve the Broken Maze

You want to use profile DP. For use brute force on a 4x(4!) grid, then do DP from there.
I still get wa though.
by baodog
Tue Oct 14, 2008 9:17 pm
Forum: Volume 115 (11500-11599)
Topic: 11521 - Compressor
Replies: 18
Views: 5991

Re: 11521 - Compressor (Wrong data)

Hi,

Can you shed some more light on this? :-), before the unknown period of time that it takes for the dataset to be fixed.
Will current Ac's become WA, and some WA's become Ac's ? Thanks!
What data is wrong and how?
THanks!
by baodog
Mon Oct 13, 2008 10:48 pm
Forum: Volume 115 (11500-11599)
Topic: 11528 - Switch Grid
Replies: 2
Views: 918

Re: 11528 - Switch Grid

Basically treat it as finding paths on a Bipartite graph, then easy solution comes out right away.
I have sent you a PM.
by baodog
Fri Oct 03, 2008 4:09 am
Forum: Volume 115 (11500-11599)
Topic: 11514 - Batman
Replies: 6
Views: 2356

Re: 11514 - Batman

How did you solve it? what's your complexity? Thanks!
I use sophisticated branch and bound + memorization of best energy for # of villains x powers left, but get TLE.

My code is below

Code: Select all

Accepted!  Thanks.  Note villains must be killed with one shot, using up all power.
}
}[/code]
by baodog
Thu Oct 02, 2008 8:09 am
Forum: Volume 115 (11500-11599)
Topic: 11509 - Touring Robot
Replies: 8
Views: 1877

11509 - Touring Robot

I cannot understand this problem. 1) You have to follow the order of the points? 0->1->2->3 ... ->n-1->0 and facing 1? 2) The sample IO makes no sense to me. In the first example, you go (0,0) -> (3,0), turn -> (1,0) -> (0,0) turn to face (1,0). That's 2 turns! Help is appreaciated to explain the 2 ...
by baodog
Sun Sep 28, 2008 10:56 pm
Forum: Volume 115 (11500-11599)
Topic: 11501 - Laurel Creek
Replies: 6
Views: 1366

Re: 11501 - Laurel Creek

Yes, you can.
by baodog
Thu Sep 25, 2008 6:33 am
Forum: Volume 114 (11400-11499)
Topic: 11491 - Erasing and Winning
Replies: 14
Views: 6304

Re: 11491 - Erasing and Winning

http://www.topcoder.com/tc?module=Stati ... onAncestor

See tutorial here, replace with O(lgn) or O(1) op for each max find.

Go to advanced search