OJ Board

I have found a couple of problems with a special corrector where I get PE.

I get always PE in this problem 10372 Leaps Tall Buildings (in a single bound).

Yes, there is something definitely wrong with the testcases.

Could you post some test case, I don't know what's wrong with my code.

An example is the following:

P - your position
X - enemy

.....
.PX..
.....

X's direction is to the left and you decide to go to the right:

.....
.XP..
.....

This is forbidden because you jump over X and he jumps over you.

SAT is formulated as: (a|b|c)&(c|d|~d) .... etc

This problem is formulated as (a&b&c)|(c&d&~d) .... etc

Hi, I've have not coded it yet but what I thought was the following.

First compute the min spanning tree.
Apply an algorithm similar to LCA to the tree as in problem QTREE of http://www.spoj.pl. (http://www.spoj.pl/problems/QTREE/)

By the way it would be nice if the problem statements could be viewed in a bigger window.

Hi,

It would be great if it were possible to download our own accepted code directly from the judge in the same way as acm.tju.edu.cn.

There is a test case
I don't know why but I finally got AC after taking care of this exception.
So the matter is that there is no way of dissecting an hexagon in 0 parallelograms ...

I get exactly the same output but still WA.

I'm getting crazy with this problem.

Thanks Jan.

Hi sclo,

I used exactly the algorithm you mentioned but I'm getting WA. How did you handle precision errors?

Well I used an O(n) algorithm which iterates over diagonals rather than square by square.

I'm getting tons of WA. I have tried this problem using rationals so in case the line intersects one of the vertexes of the polygon I don't get any precision errors. I used the method described above. Could you post some tricky test cases?

Thanks in advance.

Pfff, Silly mistake just an integer overflow.

I have the same results but still WA. I don't know what I am doing wrong.