OJ Board

I have two questions for this problem:

1. Can I jump from/to a leaves of length 0 (zero)?

2. When jumping along a straight line, can this line touch the end of another leave or not?

Example:
1
2 7 5
1 3
4 3 3 2 1

is the output
6
or
4
?

Hi.

Can someone give me any hint how to solve this problem without receiving TIME LIMIT EXCEEDED?

I tried to sort the points (C++ QUICK SORT), first by X and then by Y coordinate, and after that run 4 for loops with breaking conditions.
Is this slow?

little joey wrote:

One advise: Don't assume anything that's not explicitly written in the problem description.


What do you mean by this?

1) In the INDEX list, if there is a character that is not ALPHA_NUM what should I do with it?
ex:--- INDEX LIST ---

//foR*
ab*c<>
?a?b?

What are the ...

I have the same problem.
I don't understand nothing, too.
Anyone can explain what shoul I do!!!

I have 3 questions about this problem:

1) xenon said that we shoul think about BIG FORESTS! How big it can be?
I use char forest[2500][2500]. Is this enough? Beyond this I receive MEMORY LIMIT.

2) What about THE LAST FOREST? How INPUT ends? is it EOF, and should I print "%" after the LAST FOREST ...

1) You DON'T have to check for markers that are not in a closed zone.
2) You DON'T have to check if there are diferent markers in one zone.
At least I DIDN'T and got ACC.

To Little John:
I think that your algorithm is ok.
I don't think that there are HIGH and LOW PRIORITIES.
Maybe you have CASE SENSITIVE ERROR (when replacing "G" and "P").

Here is my algorithm (ACC).
---------------------------------
"XPGX" -> "XGPX"
"EGPX" or "XGPUK" or "EGPUK" -> "EPGX" or "XPGUK ...

I had a lot of troubles with this problem. (especially with PASCAL).
Finally got ACCEPTED assuming INPUT as follows:

INPUT:
------------------------------
4
(blank)
F
AB
CF
(blank or eof)
C
AB
(blank or eof)
G
(blank or eof)
Z
AB
BC
XY
(blank or eof)
-------------------------

OUTPUT ...

I don't understand completely this problem.
I have two questions:

1)
Should I SORT books at the begining, or to leave them as they are in the INPUT?

2)
And after that, does it mean that each book has its OWN POSITION on the shelves, and it need to be returned on that position?

There are two types of triangles:
--
\/

/\
--

Three types of parallelograms:
---
/ /
---

---
\ \
---

/\
/ \
\ /
\/

One type of hexagon:
---
/ \
\ /
---

It seems that there are no inputs of type :
--
/ /
\ \
--
because I got ACC WITH AND WITHOUT checking for this figure to be ...

Here is the output for this case:

INPUT:
2 2
1 0
0 1
200

OUTPUT:
Region 1
Water level is 1.00 meters.
50.00 percent of the region is under water.

I think that you should not join parts with equal transparency.
That means:

INPUT:
1

1
1.0 2.0 5.0 2.0 1.0

OUPTUT:
3
-inf 1.000 1.000
1.000 5.000 1.000
5.000 +inf 1.000

I got Accepted without joining these neighbouring parts with equel transparecys.

Another thing:
I DID NOT CONCIDER NEGATIVE Y.

I can't get ACCEPTED on this easy problem.
My formula is: n!/(k1!*k2!*...*km!).
Any special case?
What is output if there is a blank line (word with length 0)?
[/cpp]