Search found 146 matches
- Mon May 14, 2012 1:54 am
- Forum: Bugs and suggestions
- Topic: 12026 - Radars
- Replies: 1
- Views: 3889
12026 - Radars
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...
- Tue May 08, 2012 3:41 am
- Forum: Volume 124 (12400-12499)
- Topic: 12431 - Happy 10/9 Day
- Replies: 4
- Views: 1961
Re: 12431 - Happy 10/9 Day
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...
- Mon Mar 14, 2011 1:03 pm
- Forum: Bugs and suggestions
- Topic: 11934 - Magic Formula
- Replies: 1
- Views: 1662
11934 - Magic Formula
The sample input is wrong in HTML version of this problem.
Sample Input
Sample Input
Sample Output0 0 10 5 100
0 0 10 6 100
1 2 3 4 5
1 2 3 4 5
0 0 0 0 0
PDF output is correct, please copy it to HTML version of the problem101
0
0
4
- Tue Nov 09, 2010 12:39 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11892 - ENimEN
- Replies: 9
- Views: 3453
Re: 11892-EnimEn
It is also improtant how many stacks are there with only 1 element, if all of them have 1 element.
- Mon Nov 08, 2010 8:40 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11892 - ENimEN
- Replies: 9
- Views: 3453
Re: 11892-EnimEn
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.
- Mon Nov 08, 2010 1:21 am
- Forum: Volume 118 (11800-11899)
- Topic: 11868 - Game of Blocks
- Replies: 6
- Views: 4408
Re: 11868 - Game of Blocks
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.
- Fri Nov 05, 2010 11:04 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11868 - Game of Blocks
- Replies: 6
- Views: 4408
Re: 11868 - Game of Blocks
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...
- Fri Nov 05, 2010 7:47 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11868 - Game of Blocks
- Replies: 6
- Views: 4408
Re: 11868 - Game of Blocks
Angeh, what optimizations have you tried?
- Tue Nov 02, 2010 5:18 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11872 - Where to Run
- Replies: 6
- Views: 2868
Re: 11872 - Where to Run
Consider a simple graph with 2 nodes: (0 => 1).what do you mean by this ??
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%,
....
- Tue Nov 02, 2010 4:24 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11872 - Where to Run
- Replies: 6
- Views: 2868
Re: 11872 - Where to Run
We do have one path in the first case. But it is possible to stay more than once in the same junction.
- Tue Nov 02, 2010 1:25 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11872 - Where to Run
- Replies: 6
- Views: 2868
Re: 11872 - Where to Run
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...
- Mon Nov 01, 2010 3:42 pm
- Forum: Volume 118 (11800-11899)
- Topic: 11888 - Abnormal 89's
- Replies: 11
- Views: 6533
Re: 11888 - Abnormal 89's
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.
- Mon Nov 01, 2010 11:01 am
- Forum: Volume 118 (11800-11899)
- Topic: 11898 - Killer Problem
- Replies: 6
- Views: 3565
Re: 11898 - Killer Problem
That looks like a Range Minimal Query problem.
- Mon Nov 01, 2010 10:59 am
- Forum: Volume 118 (11800-11899)
- Topic: 11893 - Fabulous DAGy
- Replies: 10
- Views: 3661
Re: 11893 - Fabulous DAGy
Thanks Angeh, that explains the problem pretty much 

- Mon Nov 01, 2010 2:06 am
- Forum: Volume 118 (11800-11899)
- Topic: 11893 - Fabulous DAGy
- Replies: 10
- Views: 3661
11893 - Fabulous DAGy
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...