It's from Innopolis Open, Final Round, 2015-2016, the problem A. I can't approach it, can somebody give me a hint?
Have nice day,
I've a problem with this problem, could anyone help me out with a hint? Anything is appreciated :)
Statement: There's a museum made up by N * N cells, forming a square. We should place N guards, so that in every column and row there's exactly 1 guard. Also the guards have their "preferences", so every of them have a rectangular area where he wants to be placed to guard. The problem is to give a distribution of the guards (N points) where everyone is in his preferred rectangle or state that there's no such distribution.
Here's the statement in hungarian language with a picture too: here.
Thank you for reading, have a nice day.
I'm trying to solve UVa 12732, but the judge gives me wrong answer. My idea is that if I have n numbers then I compare two disjunct group of integers. This way in one query I can reduce the set of potential heavier coins from n to , and then I do the same on these potential heavier coins, until there will be a trivial case like only one or two coins remained. So it does queries I think. And for 3 ≤ n ≤ 120 it's less or equal than 5. Could anyone help my why does it get this verdict?
Here is my code: http://ideone.com/XYG4fz
Have a nice day.
I'm trying to solve 525D-Arthur And Walls, but something strange is happening. First it TLEd at test #25. Then I did some optimizations on it, and submitted, I was very happy because it passed a lot of tests, but then an interesting thing happened! At test #91, it aborted the whole judging with "Denial Of Judgement" verdict. I'm confused because I never saw that verdict.
Thanks for any advice or explanation!
PS.: If its an commonly known thing, please don't blame me, I'm pretty new there :)