Problem:
Score : 500 points

Problem Statement

We have N bulbs arranged on a number line, numbered 1 to N from left to right.
Bulb i is at coordinate i.

Each bulb has a non-negative integer parameter called intensity.
When there is a bulb of intensity d at coordinate x, the bulb illuminates the segment from coordinate x-d-0.5 to x+d+0.5.
Initially, the intensity of Bulb i is A_i. We will now do the following operation K times in a row:

For each integer i between 1 and N (inclusive), let B_i be the number of bulbs illuminating coordinate i. Then, change the intensity of each bulb i to B_i.

Find the intensity of each bulb after the K operations.

Constraints

1 \leq N \leq 2 \times 10^5

1 \leq K \leq 2 \times 10^5

0 \leq A_i \leq N

Input

Input is given from Standard Input in the following format:

N K
A_1 A_2 \ldots A_N

Output

Print the intensity A{'}_i of each bulb i after the K operations to Standard Output in the following format:

A{'}_1 A{'}_2 \ldots A{'}_N

Sample Input 1

5 1
1 0 0 1 0

Sample Output 1

1 2 2 1 2

Initially, only Bulb 1 illuminates coordinate 1, so the intensity of Bulb 1 becomes 1 after the operation.
Similarly, the bulbs initially illuminating coordinate 2 are Bulb 1 and 2, so the intensity of Bulb 2 becomes 2.

Sample Input 2

5 2
1 0 0 1 0

Sample Output 2

3 3 4 4 3

Solution in C# (.NET Core 3.1.201) (judge verdict: Accepted)

using System;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using System.Text.RegularExpressions;
using System.Threading.Tasks;
using static System.Math;
using MethodImplAttribute = System.Runtime.CompilerServices.MethodImplAttribute;
using MethodImplOptions = System.Runtime.CompilerServices.MethodImplOptions;

public static class P
{
    public static void Main()
    {
        var nk = Console.ReadLine().Split().Select(int.Parse).ToArray();
        var n = nk[0];
        var k = nk[1];
        var a = Console.ReadLine().Split().Select(int.Parse).ToArray();
        //var a = Enumerable.Repeat(0, n).ToArray();
        //nが小さい時注意
        var monoid = new AbelianMonoid<int>((x, y) => x + y, 0);
        for (int count = 0; count < k; count++)
        {
            RangeGetSegmentTree<int> next = new RangeGetSegmentTree<int>(n, monoid);
            for (int i = 0; i < n; i++)
                next.Operate(Max(i - a[i], 0), Min(i + a[i], n - 1), 1);
            var isAllN = true;
            for (int i = 0; i < n; i++)
            {
                a[i] = next[i];
                if (a[i] != n) isAllN = false;
            }
            if (isAllN) break;
        }

        Console.WriteLine(string.Join(" ", a));
    }
}

class Monoid<T>
{
    public Func<T, T, T> Operation { get; }
    public T Identity { get; }

    public Monoid(Func<T, T, T> operation, T identity)
    {
        Operation = operation;
        Identity = identity;
    }
}

class AbelianMonoid<T> : Monoid<T>
{
    public AbelianMonoid(Func<T, T, T> operation, T identity) : base(operation, identity) { }
}

class RangeGetSegmentTree<T>
{
    public readonly int Size;
    readonly bool IsCommutative;
    Func<T, T, T> Merge;
    T Identity;
    T[] Operators;
    int Height;
    int LeafCount;

    public RangeGetSegmentTree(int size, Monoid<T> monoid)
    {
        Size = size;
        Identity = monoid.Identity;
        Merge = monoid.Operation;
        Height = 1;
        LeafCount = 1;
        while (LeafCount < size) { Height++; LeafCount <<= 1; }
        Operators = new T[LeafCount << 1];
        for (int i = 0; i < Operators.Length; i++)
            Operators[i] = monoid.Identity;
    }
    public RangeGetSegmentTree(int size, AbelianMonoid<T> monoid) : this(size, monoid as Monoid<T>) { IsCommutative = true; }

    public T this[int index]
    {
        get { return Query(index); }
        set { Propagate(index += LeafCount); Operators[index] = value; }
    }

    public void Operate(int i, T x)
    {
        i += LeafCount;
        if (!IsCommutative) Propagate(i);
        Operators[i] = Merge(Operators[i], x);
    }

    public void Operate(int l, int r, T x)
    {
        l += LeafCount; r += LeafCount;
        if (!IsCommutative) Propagate(l, r);
        for (; l <= r; l = (l + 1) >> 1, r = (r - 1) >> 1)
        {
            if ((l & 1) == 1) Operators[l] = Merge(Operators[l], x);
            if ((r & 1) == 0) Operators[r] = Merge(Operators[r], x);
        }
    }

    public T Query(int i)
    {
        i += LeafCount;
        T res = Operators[i];
        while (0 < (i >>= 1)) res = Merge(res, Operators[i]);
        return res;
    }
    /*public T Query(int index)
    {
        index += LeafCount;
        Propagate(index);
        return Operators[index];
    }*/

    private void Eval(int section)
    {
        var leftChild = section << 1;
        var rightChild = leftChild | 1;
        Operators[leftChild] = Merge(Operators[leftChild], Operators[section]);
        Operators[rightChild] = Merge(Operators[rightChild], Operators[section]);
        Operators[section] = Identity;
    }

    private void Propagate(int sectionIndex)
    {
        for (int i = Height - 1; i >= 1; i--)
            Eval(sectionIndex >> i);
    }

    private void Propagate(int l, int r)
    {
        if (l == r) { Propagate(l); return; }
        int xor = l ^ r, i = Height - 1;
        for (; (xor >> i) == 0; i--) { Eval(l >> i); }
        for (; i >= 1; i--) { Eval(l >> i); Eval(r >> i); }
    }
}