Comments
0

For Problem D I found it here Explanation.
-8

For Problem C

If the explosion kills the next monster, it explodes too"

How to solve if it didn't explode too??
0

Thank you. I just've learnt about & operation in sparse table. But i can't understand the complexity when test case as:

100000 100000

1, 2, 1, 2, 1, 2, 1, 2, 1, 2,...........10^5th array element.(Repeating 1,2)

query [L,R]

1 10^5

1 10^5

1 10^5

1 10^5

.

.

.

1 10^5th query.

won't it get TLE if given 2 sec ? If not why??
0

I want to learn Sparse table. Can you give me an idea using Sparse table?

Specially for calculating the subarray part.
+3

I also didn't know it before, got the solution by generating few cases while contest.Generate 6/7 cases and you will find the pattern.

  • See this case: n = 5; k = 5; "a B a b a"
  • Take minimum integer x so that k <= (x)(x+1)/2;
  • For the first B , pos1 = (n — x)th index from left side.

  • Keep = (x)(x+1)/2 — k;

  • For the second b , pos2 = (pos1 + keep + 1)th index from the left side.
  • Without pos1 and pos2 all positions will be a.
+1

My approach was wrong.that's why i've got WA. But you don't know how many contestants struggled whole time without submission in such case and not going to next problem. Which form will they fill? :(
-8

Thank You.Nice Editorial.solved C...First approach :)

+11

I think my name should be "send_rating" :) :D
0

But ,problems was not so cool.....!!! 4 me As Beginer....!!! (:
-25

Eid mubarak....!