Admins, please increase Memory Limit in this task.
It is wrong that solutions with O(Q*log2(10^9)) memory - segment tree on hash table - has not got any chance to pass Memory Limit without additional input queries coordinates compression (because 100000 * 30 * (3*double + char) is obviously > 64 Mb).

This data structure is quite complex even without input queries coordinates compression, why not to AC such solutions? Nowadays commonly used ML is 256 Mb, not 64.

Edited by author 19.05.2024 12:37

Edited by author 19.05.2024 12:39

I use Segment tree.I can't find anything wrong in my code.Why?

Can't catch where is error. Is there an error in my algorythm?
х - energy quantum, amount of which is calculated by division (power_supply/sqr(d)), where 'power_supply' is amount of energy stored by previous save action and 'd' is an area in which wall segments are enforced. Energy portion for each segment is calculated by formula (d-delta)*x, where delta is a distance from the targeted segment. After energy distribution I just set power_supply to 0. Also energy saving and wall enforcing occurs after energy is generated for time passed from previous action.

Edited by author 11.09.2013 19:50