OJ Board

As I know, they have corrected input data, that's why you see many people got AC. About your solution to the prob, did you consider if 2 convex hulls are nested, or if their edges overlap (instead of intersect) ?
That's the only problem I can see, assuming that your code is correct. Oh, to be sure ...

Thanks for the help, I didn't expect inside points to be intersection points. Now I got AC.

I think prob 137 and this one are quite different problems. Since we're not sure if two polygons are convex in this problem (even though it unclearly mentioned something like that in the output description, it also said the two polygons are arbitrary at the beginning). In fact, i think this one is ...

thanks, it said O(n) to determine strongly connected components. Looks great

what is the best algorithms to find all strongly connected component of a graph ? I only know the trivial one in text book with time O(V * (E+v)) or O(V^3).

Thanks

actually I wanted to ask if -0.005 should be rounded "up" to 0.00 or -0.01 as usual.
btw, i think all we need is to find any intersection points of the edges of two polygons. Why is it so hard to get AC ?
If one polygon "touches" the other (they have exactly one point in common), do they intersect ?

Hi,
for this problem, I have several questions, if someone can help me clarify them:
1. What did it mean by "round up" anyway ? What is the round up for these numbers:
-0.5
0.5
0.3
-0.3
0.7
-0.7
2. If two intersection points are actually different but their rounded format are the same, should I ...

Admins, what happened ? Now they put such a test that there is no passage from the Theseus to Minotaur (unless I read input incorrectly).
So, what's the output would be for that case ?

Hi,
I think you have a mistakehere. "<=1", NOT "<1", of course it was wrong if the set of points of supporters of Majestix consist of a polygon that contains the 1 point of the supporter of Cleverdix.

It has lead me to strongly believe that there was something wrong with either the judge's input or output in this problem. As you may have noticed, there were only 3 people solved this out of more than 200 submissions. I have checked with one of them, and he said that there was actually something ...

actually, from what I am doing, there are two steps:
( Assume the deviding line cannot contain any vertex)
1) Find convex hulls of two sets of points.
2) Check if one point of a convex STRICTLY INSIDE the other convex. If there is, the answer is no, otherwise, go to step 3.
3) If there is at least ...

Yes, I did check that case.
First, I check if the two convex hulls have any two edges intersect (including endpoints), then I check if any vertices of one hull inside (or on edge or coincide with some vertex) of the other hull.
If either check returns true, then it's indivisible(No), else it is ...

The problem is not clearly stated. If anyone has read this problem, please clarify the following for me:

I am not sure if it is possible for a house to be on the deviding line ? There are two cases that I don't know what the answer should be (Yes/ No):
1) Two coincide points, each should be on ...

Oops, I missent the msg to some place, it didn't show up in the forum.

The second input I gave you was
B:ACD.B D (with no space after .)
not B:ACD. B D
The problem is when you read scanf("%s %c %c, &, &, &) it wil read everything into your first string, and then D to the first %c, and the second ...

Here is the output for your input of my AC program:

Paskill trapped in node D Lisper trapped in node F
Both annihilated in node E
Lisper trapped in node E
Both annihilated in node A
Paskill trapped in node A Both annihilated in node
Paskill trapped in node B Both annihilated in node
Both ...