Problem p02647 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <bits/stdc++.h>
#define rep(i, a, b) for (auto i = (a); i < (b); i++)
#define per(i, a, b) for (auto i = (a); i >= (b); i--)
#define Min(a, b) ((a) < (b) ? (a) : (b))
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define int_inf 0x3f3f3f3f
#define int_max 2147483647
#define ll_max 9223372036854775807
#define ull_max 18446744073709551615
#define ll_inf 0x7f7f7f7f7f7f7f7f
#define lowbit(x) (x) & (-x)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define eps 1e-8
#define all(v) (v.begin(), v.end())
#define db double
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const double pi = acos(-1.0);
const double inf = 1e100;
template <class T> inline T read() {
  T x = 0, f = 1;
  char s = getchar();
  while (s < '0' || s > '9') {
    if (s == '-')
      f = -1;
    s = getchar();
  };
  while (s >= '0' && s <= '9') {
    x = (x << 3) + (x << 1) + s - 48;
    s = getchar();
  };
  return x * f;
}
template <typename T> inline void wri(T x) {
  if (x < 0) {
    x = -x;
    putchar('-');
  };
  if (x / 10)
    wri(x / 10);
  putchar(x % 10 + 48);
}
template <typename T> inline void print(T x, char s) {
  wri(x);
  putchar(s);
}
template <typename T> T gcd(T a, T b) { return b == 0 ? a : gcd(b, a % b); }
// 关闭流同步就不能手写读入优化啦
int n, k, a[200010], b[200010];
bool check() {
  int flag = 1;
  rep(i, 1, n + 1) {
    if (a[i] != n)
      return false;
  }
  return true;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> n >> k;
  rep(i, 1, n + 1) { cin >> a[i]; }
  while (k--) {
    if (check())
      break;
    memset(b, 0, sizeof(b));
    rep(i, 1, n + 1) {
      int l = max(1, i - a[i]), r = min(n, i + a[i]);
      b[l]++, b[r + 1]--;
    }
    rep(i, 1, n + 1) a[i] = a[i - 1] + b[i];
  }
  rep(i, 1, n + 1) { cout << a[i] << " "; }
  return 0;
}


Error: TLE

Fixed submission:

#include <bits/stdc++.h>
#define rep(i, a, b) for (auto i = (a); i < (b); i++)
#define per(i, a, b) for (auto i = (a); i >= (b); i--)
#define Min(a, b) ((a) < (b) ? (a) : (b))
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define int_inf 0x3f3f3f3f
#define int_max 2147483647
#define ll_max 9223372036854775807
#define ull_max 18446744073709551615
#define ll_inf 0x7f7f7f7f7f7f7f7f
#define lowbit(x) (x) & (-x)
#define mp make_pair
#define fi first
#define se second
#define pb push_back
#define eps 1e-8
#define all(v) (v.begin(), v.end())
#define db double
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
const ll mod = 1e9 + 7;
const double pi = acos(-1.0);
const double inf = 1e100;
template <class T> inline T read() {
  T x = 0, f = 1;
  char s = getchar();
  while (s < '0' || s > '9') {
    if (s == '-')
      f = -1;
    s = getchar();
  };
  while (s >= '0' && s <= '9') {
    x = (x << 3) + (x << 1) + s - 48;
    s = getchar();
  };
  return x * f;
}
template <typename T> inline void wri(T x) {
  if (x < 0) {
    x = -x;
    putchar('-');
  };
  if (x / 10)
    wri(x / 10);
  putchar(x % 10 + 48);
}
template <typename T> inline void print(T x, char s) {
  wri(x);
  putchar(s);
}
template <typename T> T gcd(T a, T b) { return b == 0 ? a : gcd(b, a % b); }
// 关闭流同步就不能手写读入优化啦
int n, k, a[200010], b[200010];
bool check() {
  int flag = 1;
  rep(i, 1, n + 1) {
    if (a[i] != n)
      return false;
  }
  return true;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> n >> k;
  rep(i, 1, n + 1) { cin >> a[i]; }
  while (k--) {
    if (check())
      break;
    memset(b, 0, sizeof(b));
    rep(i, 1, n + 1) {
      rep(j, max(1, i - a[i]), min(n + 1, i + a[i] + 1)) { b[j]++; }
    }
    rep(i, 1, n + 1) a[i] = b[i];
  }
  rep(i, 1, n + 1) { cout << a[i] << " "; }
  return 0;
}