You are given an array A of size N such that Aᵢ=0 initially, for all 1≤ᵢ≤N.
You have M enemies and each enemy will blast one bomb on an index. The ᵢᵗ enemy (1≤ᵢ≤M) will place their bomb at index Xᵢ, and the bomb will have a range of Yiᵢ.
Due to the iᵗ bomb, all indices in the range [Xᵢ−Yᵢ,Xᵢ+Yᵢ] might be affected:
For indices j, max(1,Xᵢ−Yᵢ)≤j<Xᵢ), the value at jᵗ index decreases by ((Xᵢ−j)⋅(Xᵢ−j+1).
For indices Xi​<k≤min(N,Xi​+Yi​)), the value at the ndex increases by ((k−Xi​)⋅(k−Xi​+1).
Find the resultant array after your mom fell down the 5th floor :D