OJ Board

The trick is that: "The rectangle consists of four straight lines and the area in between." so the line segment can intersect with a the area of the rectangle, and not necessarily intersect with the one of the sides of the rectangle.

so, for this test case:
1
1 1 2 2 0 4 4 0

the ouput is
T

i'm also getting WA for this problem, and it got me frustrated :(
i apply tarjan's algorithm, to get SCC. i put each scc in a structure called Element which contains arrayList<Character> then i sort it and i convert the sorted list to a string. after sorting i add this scc element to and array list ...

i'm really interested in knowing the correct approach to this problem, so can anyone please reply to this thread

i tried different approaches, but they all failed. now i got AC but in 2.7 seconds :-? (so clearly my algo. isn't good and there are much better ones)

the idea of my soln is that i ...

thanks a lot krien, i got it now

pdwd wrote:http://forums.topcoder.com/?module=Thre ... 66&start=0

sorry pdwd, but i didn't understand what ctgPi said i'd be really grateful if you could illustrate it more
and if this approach is totally wrong, what is the correct approach to this problem

Hi all,
i was trying to solve this problem "Elevator" from the Brazilian National Contest
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=226&page=show_problem&problem=2934

my approach is to get the minimum diagonal of a rectangle to enclose the 2 circles, and if this ...