Problem p02647 (C++) — buggy submission, verdict: Runtime Error

// SmartCoder
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace __gnu_pbds;
using namespace std;

#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(c, i)                                                               \\
  for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define minei(x) min_element(x.begin(), x.end()) - (x).begin()
#define maxei(x) max_element(x.begin(), x.end()) - (x).begin()
#define LSOne(S) (S & (-S))

#define uns(v)                                                                 \\
  sort((v).begin(), (v).end()), v.erase(unique(v.begin(), v.end()), v.end())
#define acusum(x) accumulate(x.begin(), x.end(), 0)
#define acumul(x) accumulate(x.begin(), x.end(), 1, multiplies<int>());
#define bits(x) __builtin_popcount(x)
#define oo INT_MAX
#define inf 1000000000
#define MAXN 1000007
#define MOD 1000000007

const double pi = acos(-1.0);
const double eps = 1e-11;

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    indexed_set;

int main() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  vector<int> v(n + 2, 0);
  vector<int> ans(n + 2, 0);
  for (int i = 1; i <= n; i++)
    cin >> v[i];
  while (k--) {
    int maxOut = 0;
    for (int i = 0; i < n + 2; i++)
      ans[i] = 0;
    for (int i = 1; i <= n; i++) {
      int left = max(1, i - v[i]);
      int right = min(n, i + v[i]);
      ans[left] += 1;
      ans[right + 1] -= 1;
    }
    for (int i = 1; i <= n; i++) {
      ans[i] += ans[i - 1];
      v[i] = ans[i];
      maxOut += v[i] == n;
    }
    if (maxOut == n)
      break;
  }
  for (int i = 1; i <= n; i++) {
    cout << v[i] << " ";
  }

  return 0;
}


Error: WA

Fixed submission:

// SmartCoder
#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp> // Including tree_order_statistics_node_update

using namespace __gnu_pbds;
using namespace std;

#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define all(c) (c).begin(), (c).end()
#define tr(c, i)                                                               \\
  for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define minei(x) min_element(x.begin(), x.end()) - (x).begin()
#define maxei(x) max_element(x.begin(), x.end()) - (x).begin()
#define LSOne(S) (S & (-S))

#define uns(v)                                                                 \\
  sort((v).begin(), (v).end()), v.erase(unique(v.begin(), v.end()), v.end())
#define acusum(x) accumulate(x.begin(), x.end(), 0)
#define acumul(x) accumulate(x.begin(), x.end(), 1, multiplies<int>());
#define bits(x) __builtin_popcount(x)
#define oo INT_MAX
#define inf 1000000000
#define MAXN 1000007
#define MOD 1000000007

const double pi = acos(-1.0);
const double eps = 1e-11;

typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    indexed_set;

int main() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, k;
  cin >> n >> k;
  vector<int> v(n + 2, 0);
  for (int i = 1; i <= n; i++)
    cin >> v[i];
  while (k--) {
    int maxOut = 0;
    vector<int> ans(n + 2, 0);
    for (int i = 1; i <= n; i++) {
      int left = max(1, i - v[i]);
      int right = min(n + 1, i + v[i]);
      ans[left] += 1;
      ans[right + 1] -= 1;
    }
    for (int i = 1; i <= n; i++) {
      ans[i] += ans[i - 1];
    }
    for (int i = 1; i <= n; i++) {
      v[i] = ans[i];
      maxOut += v[i] == n;
    }
    if (maxOut == n)
      break;
  }
  for (int i = 1; i <= n; i++) {
    cout << v[i] << " ";
  }

  return 0;
}