OJ Board

The problem statement is not clear. Please find below suggested improvements to the problem description in bold. All points below were implied from the sample input/output file. It's not clear what is a radar: Radar occupies whole area of the zone it's inside. It's not clear if the zone that radar o...

How did you handle overflow in this problem? Or there is a way to solve it without using fast exponentiation? An intermediate step in fast exponentiation can result in numbers that are close to 10^12, and squaring those can be close to 10^24 - but that doesn't fit in long long. An obvious choice wou...

The sample input is wrong in HTML version of this problem.

Sample Input

0 0 10 5 100
0 0 10 6 100
1 2 3 4 5
1 2 3 4 5
0 0 0 0 0

Sample Output

101
0
0
4

PDF output is correct, please copy it to HTML version of the problem

It is also improtant how many stacks are there with only 1 element, if all of them have 1 element.

If there is more than one element in any stack then the first player can choose to take the whole stack, or leave one element. Think about the difference and you should be able to solve this problem.

What is the complexity of your solution? There exists a solution with complexity O( (L^2 + L*C) * log N ) which is described in this thread.

The solution can be improved by using hashes, by at least a factor of 10. And MOD operation can be done only in the outer loop, that could improve the solution by around a factor of 2. How many seconds does it currently take on the maximum possible test? How many states there are in the map in the w...

Angeh, what optimizations have you tried?

what do you mean by this ??

Consider a simple graph with 2 nodes: (0 => 1).
The probability to stay in 0 for 5 minutes is 50%,
The probability to stay in 0 for 10 minutes is 25%,
The probability to stay in 0 for 15 minutes is 12.5%,
....

We do have one path in the first case. But it is possible to stay more than once in the same junction.

What does the Problem Expect !!! That is a very good question. I've spent like half of an hour re-reading the problem and more time investigating input and output data. The plan is, from your current junction, you first find the number of junctions which are safe (no police are there) and if you go...

Mizanur, on each iteration when looking for alindrome the algorithm copies whole string. Try to find a way not to copy the string and I believe it should be AC.

That looks like a Range Minimal Query problem.

Thanks Angeh, that explains the problem pretty much

Does anyone understand what this problem asks for? DAGy is made up of a directed acyclic graph plus one additional directed edge. With this additional edge a cycle forms that goes through every vertex in the graph. It is guaranteed that each input graph is a directed acyclic graph with one additiona...