OJ Board

hello
can somebody please give a hint about this problem?

thank you

hello

my statistics sais i solved 759 problems, but actually i solved 755. i guess it has something to do with contest that was recently erased

emotional blind wrote:Strange
What is your outout in that case?

785398.1634 0.0000 0.0000

emotional blind wrote:

fpavetic wrote:there can be cases where sum of length of two sides is less than length of third side. try this case: 1 2 1000

I dont think so. I got Accepted without checking this.

i got accepted after checking that

there can be cases where sum of length of two sides is less than length of third side. try this case: 1 2 1000

i got this problem accepted by storing intermediate calculations in long double, and printing the result as double after many failed submissions.

gvcormac wrote: If you insist on implementing the problem as specified, you have to worry about segment intersection. There are algorithms for this but sub-quadratic is complicated.

in this case it is not that complicated because there are only vertical and horizontal segments.

thank you. i rewrote my solution and i found that a correct solution should contain exactly n!-1 comparisons

can someone please confirm that these are correct outputs for 1,2, 3 and 4. i constantly get output limit exceeded. and if i get rid of indentation, i get wa program sort(input,output); var a : integer; begin readln(a); writeln(a) end. program sort(input,output); var a,b : integer; begin readln(a,b)...

artikali: just add ml.clear() at the begining of each case and you'll get your solution accepted

although i am surprised that a solution using cin for reading passes

kalinov wrote:

david wrote:Anyway here's my code, in case someone wants to test it.

Your program fails on this case:

Code: Select all

input:
1

0 0 5 0 2 4
4 0 6 0 -4 16

output:
pair 1: yes

hvala

and here is one more test case that helped me:

1

0 1 2 0 3 1
1 3 2 0 3 3

output:

pair 1: yes

there is a way to find kth element in unsorted sequence in O(n) average, where n is the length of the sequence.

i think that output for tc9 should be no, because the only points these two triangles share are on the edge they share, and according to the problem statement, points on edges are not interior. or have i misunderstood something?

can anybody provide some tricky cases for this task? thanks some io: 11 0 0 2 0 0 2 1 1 3 3 2 3 0 0 2 0 0 2 3 0 5 0 4 2 0 0 1 0 1 1 0 0 1 0 1 1 0 0 0 1 1 0 0 0 3 1 1 3 0 0 100 0 0 100 1 1 3 1 1 3 1 1 3 1 1 3 0 0 100 0 0 100 0 0 2 0 0 2 0 0 1 0 0 1 0 0 1 0 0 1 0 0 2 0 0 2 0 0 0 1 1 0 0 1 1 0 1 1 0 0 ...

think about hashing so you can get rid of slen constant :: "To simplify things, you can assume that the text only includes lower case letters."