Problem p03841 (C++)

Buggy submission (status: Runtime Error):
// need
#include <algorithm>
#include <iostream>

// data structure
#include <bitset>
// #include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
// #include <array>
// #include <tuple>
#include <complex>
#include <unordered_map>
#include <unordered_set>
// #include <deque>
#include <valarray>

// stream
// #include <istream>
// #include <sstream>
// #include <ostream>

// etc
#include <cassert>
#include <functional>
#include <iomanip>
// #include <typeinfo>
#include <chrono>
#include <numeric>
#include <random>

#define INIT                                                                   \
  std::ios::sync_with_stdio(false);                                            \
  std::cin.tie(0);
#define VAR(type, ...)                                                         \
  type __VA_ARGS__;                                                            \
  MACRO_VAR_Scan(__VA_ARGS__);
template <typename T> void MACRO_VAR_Scan(T &t) { std::cin >> t; }
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &...rest) {
  std::cin >> first;
  MACRO_VAR_Scan(rest...);
}
#define VEC_ROW(type, n, ...)                                                  \
  std::vector<type> __VA_ARGS__;                                               \
  MACRO_VEC_ROW_Init(n, __VA_ARGS__);                                          \
  for (int i = 0; i < n; ++i) {                                                \
    MACRO_VEC_ROW_Scan(i, __VA_ARGS__);                                        \
  }
template <typename T> void MACRO_VEC_ROW_Init(int n, T &t) { t.resize(n); }
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First &first, Rest &...rest) {
  first.resize(n);
  MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T> void MACRO_VEC_ROW_Scan(int p, T &t) { std::cin >> t[p]; }
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First &first, Rest &...rest) {
  std::cin >> first[p];
  MACRO_VEC_ROW_Scan(p, rest...);
}
#define OUT(d) std::cout << d;
#define FOUT(n, d) std::cout << std::fixed << std::setprecision(n) << d;
#define SOUT(n, c, d) std::cout << std::setw(n) << std::setfill(c) << d;
#define SP std::cout << " ";
#define TAB std::cout << "\t";
#define BR std::cout << "\n";
#define ENDL std::cout << std::endl;
#define FLUSH std::cout << std::flush;
#define VEC(type, c, n)                                                        \
  std::vector<type> c(n);                                                      \
  for (auto &i : c)                                                            \
    std::cin >> i;
#define MAT(type, c, m, n)                                                     \
  std::vector<std::vector<type>> c(m, std::vector<type>(n));                   \
  for (auto &r : c)                                                            \
    for (auto &i : r)                                                          \
      std::cin >> i;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORLL(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define RFORLL(i, a, b) for (ll i = ll(b) - 1; i >= ll(a); --i)
#define REPLL(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREPLL(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define PAIR std::pair<int, int>
#define PAIRLL std::pair<ll, ll>
#define IN(a, x, b) (a <= x && x < b)
#define SHOW(d)                                                                \
  { std::cerr << #d << "\t:" << d << "\n"; }
#define SHOWVECTOR(v)                                                          \
  {                                                                            \
    std::cerr << #v << "\t:";                                                  \
    for (const auto &xxx : v) {                                                \
      std::cerr << xxx << " ";                                                 \
    }                                                                          \
    std::cerr << "\n";                                                         \
  }
#define SHOWVECTOR2(v)                                                         \
  {                                                                            \
    std::cerr << #v << "\t:\n";                                                \
    for (const auto &xxx : v) {                                                \
      for (const auto &yyy : xxx) {                                            \
        std::cerr << yyy << " ";                                               \
      }                                                                        \
      std::cerr << "\n";                                                       \
    }                                                                          \
  }
#define SHOWPAIR(p)                                                            \
  { std::cerr << #p << "\t:(" << p.first << ",\t" << p.second << ")\n"; }
#define SHOWPAIRVECTOR2(v)                                                     \
  {                                                                            \
    std::cerr << #v << "\t:\n";                                                \
    for (const auto &xxx : v) {                                                \
      for (const auto &yyy : xxx) {                                            \
        std::cerr << '(' << yyy.first << ", " << yyy.second << ") ";           \
      }                                                                        \
      std::cerr << "\n";                                                       \
    }                                                                          \
  }
#define SHOWPAIRVECTOR(v)                                                      \
  {                                                                            \
    for (const auto &xxx : v) {                                                \
      std::cerr << '(' << xxx.first << ", " << xxx.second << ") ";             \
    }                                                                          \
    std::cerr << "\n";                                                         \
  }
#define SHOWQUEUE(a)                                                           \
  {                                                                            \
    std::queue<decltype(a.front())> tmp(a);                                    \
    std::cerr << #a << "\t:";                                                  \
    for (int i = 0; i < static_cast<int>(a.size()); ++i) {                     \
      std::cerr << tmp.front() << "\n";                                        \
      tmp.pop();                                                               \
    }                                                                          \
    std::cerr << "\n";                                                         \
  }
template <typename T> inline T CHMAX(T &a, const T b) {
  return a = (a < b) ? b : a;
}
template <typename T> inline T CHMIN(T &a, const T b) {
  return a = (a > b) ? b : a;
}
#define EXCEPTION(msg)                                                         \
  throw std::string("Exception : " msg " [ in ") + __func__ + " : " +          \
      std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg)                                                         \
  try {                                                                        \
    if (cond)                                                                  \
      EXCEPTION(msg);                                                          \
  } catch (std::string s) {                                                    \
    std::cerr << s << std::endl;                                               \
  }
void CHECKTIME(std::function<void()> f) {
  auto start = std::chrono::system_clock::now();
  f();
  auto end = std::chrono::system_clock::now();
  auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start))
                 .count();
  std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n";
}

#define int ll
using ll = long long;
using ull = unsigned long long;
constexpr int INFINT = 1 << 30;                         // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;             // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                         // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr double EPS = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;

#define NO                                                                     \
  {                                                                            \
    OUT("No") BR;                                                              \
    return 0;                                                                  \
  }

signed main() {
  INIT;
  VAR(int, n);
  VEC(int, x, n);
  std::vector<PAIR> pv(n);
  REP(i, n) { pv[i] = PAIR(x[i], i); }
  std::sort(ALL(pv));
  std::vector<int> v(n * n, -1);
  std::vector<int> cnt(n, n);
  int pos = 0;
  REP(i, n) {
    auto p(pv[i]);
    if (v[p.first - 1] != -1)
      NO;
    int rest = p.second;
    while (rest) {
      if (v[pos] == -1) {
        --rest;
        --cnt[p.second];
        v[pos] = p.second + 1;
      }
      ++pos;
    }
    if (pos > p.first)
      NO;
    v[p.first - 1] = p.second + 1;
    --cnt[p.second];
  }
  pos = n * n - 1;
  std::reverse(ALL(pv));
  REP(i, n) {
    auto p(pv[i]);
    while (cnt[p.second]) {
      if (v[pos] == -1) {
        --cnt[p.second];
        v[pos] = p.second + 1;
      }
      --pos;
    }
    if (pos < p.first - 1)
      NO;
  }
  REP(i, n * n) {
    if (v[i] == -1)
      assert(false);
  }
  OUT("Yes") BR;
  REP(i, n * n) { OUT(v[i]) SP; }
  BR;
  return 0;
}

Fixed submission:
// need
#include <algorithm>
#include <iostream>

// data structure
#include <bitset>
// #include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
// #include <array>
// #include <tuple>
#include <complex>
#include <unordered_map>
#include <unordered_set>
// #include <deque>
#include <valarray>

// stream
// #include <istream>
// #include <sstream>
// #include <ostream>

// etc
#include <cassert>
#include <functional>
#include <iomanip>
// #include <typeinfo>
#include <chrono>
#include <numeric>
#include <random>

#define INIT                                                                   \
  std::ios::sync_with_stdio(false);                                            \
  std::cin.tie(0);
#define VAR(type, ...)                                                         \
  type __VA_ARGS__;                                                            \
  MACRO_VAR_Scan(__VA_ARGS__);
template <typename T> void MACRO_VAR_Scan(T &t) { std::cin >> t; }
template <typename First, typename... Rest>
void MACRO_VAR_Scan(First &first, Rest &...rest) {
  std::cin >> first;
  MACRO_VAR_Scan(rest...);
}
#define VEC_ROW(type, n, ...)                                                  \
  std::vector<type> __VA_ARGS__;                                               \
  MACRO_VEC_ROW_Init(n, __VA_ARGS__);                                          \
  for (int i = 0; i < n; ++i) {                                                \
    MACRO_VEC_ROW_Scan(i, __VA_ARGS__);                                        \
  }
template <typename T> void MACRO_VEC_ROW_Init(int n, T &t) { t.resize(n); }
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Init(int n, First &first, Rest &...rest) {
  first.resize(n);
  MACRO_VEC_ROW_Init(n, rest...);
}
template <typename T> void MACRO_VEC_ROW_Scan(int p, T &t) { std::cin >> t[p]; }
template <typename First, typename... Rest>
void MACRO_VEC_ROW_Scan(int p, First &first, Rest &...rest) {
  std::cin >> first[p];
  MACRO_VEC_ROW_Scan(p, rest...);
}
#define OUT(d) std::cout << d;
#define FOUT(n, d) std::cout << std::fixed << std::setprecision(n) << d;
#define SOUT(n, c, d) std::cout << std::setw(n) << std::setfill(c) << d;
#define SP std::cout << " ";
#define TAB std::cout << "\t";
#define BR std::cout << "\n";
#define ENDL std::cout << std::endl;
#define FLUSH std::cout << std::flush;
#define VEC(type, c, n)                                                        \
  std::vector<type> c(n);                                                      \
  for (auto &i : c)                                                            \
    std::cin >> i;
#define MAT(type, c, m, n)                                                     \
  std::vector<std::vector<type>> c(m, std::vector<type>(n));                   \
  for (auto &r : c)                                                            \
    for (auto &i : r)                                                          \
      std::cin >> i;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORLL(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define RFORLL(i, a, b) for (ll i = ll(b) - 1; i >= ll(a); --i)
#define REPLL(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREPLL(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define PAIR std::pair<int, int>
#define PAIRLL std::pair<ll, ll>
#define IN(a, x, b) (a <= x && x < b)
#define SHOW(d)                                                                \
  { std::cerr << #d << "\t:" << d << "\n"; }
#define SHOWVECTOR(v)                                                          \
  {                                                                            \
    std::cerr << #v << "\t:";                                                  \
    for (const auto &xxx : v) {                                                \
      std::cerr << xxx << " ";                                                 \
    }                                                                          \
    std::cerr << "\n";                                                         \
  }
#define SHOWVECTOR2(v)                                                         \
  {                                                                            \
    std::cerr << #v << "\t:\n";                                                \
    for (const auto &xxx : v) {                                                \
      for (const auto &yyy : xxx) {                                            \
        std::cerr << yyy << " ";                                               \
      }                                                                        \
      std::cerr << "\n";                                                       \
    }                                                                          \
  }
#define SHOWPAIR(p)                                                            \
  { std::cerr << #p << "\t:(" << p.first << ",\t" << p.second << ")\n"; }
#define SHOWPAIRVECTOR2(v)                                                     \
  {                                                                            \
    std::cerr << #v << "\t:\n";                                                \
    for (const auto &xxx : v) {                                                \
      for (const auto &yyy : xxx) {                                            \
        std::cerr << '(' << yyy.first << ", " << yyy.second << ") ";           \
      }                                                                        \
      std::cerr << "\n";                                                       \
    }                                                                          \
  }
#define SHOWPAIRVECTOR(v)                                                      \
  {                                                                            \
    for (const auto &xxx : v) {                                                \
      std::cerr << '(' << xxx.first << ", " << xxx.second << ") ";             \
    }                                                                          \
    std::cerr << "\n";                                                         \
  }
#define SHOWQUEUE(a)                                                           \
  {                                                                            \
    std::queue<decltype(a.front())> tmp(a);                                    \
    std::cerr << #a << "\t:";                                                  \
    for (int i = 0; i < static_cast<int>(a.size()); ++i) {                     \
      std::cerr << tmp.front() << "\n";                                        \
      tmp.pop();                                                               \
    }                                                                          \
    std::cerr << "\n";                                                         \
  }
template <typename T> inline T CHMAX(T &a, const T b) {
  return a = (a < b) ? b : a;
}
template <typename T> inline T CHMIN(T &a, const T b) {
  return a = (a > b) ? b : a;
}
#define EXCEPTION(msg)                                                         \
  throw std::string("Exception : " msg " [ in ") + __func__ + " : " +          \
      std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg)                                                         \
  try {                                                                        \
    if (cond)                                                                  \
      EXCEPTION(msg);                                                          \
  } catch (std::string s) {                                                    \
    std::cerr << s << std::endl;                                               \
  }
void CHECKTIME(std::function<void()> f) {
  auto start = std::chrono::system_clock::now();
  f();
  auto end = std::chrono::system_clock::now();
  auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start))
                 .count();
  std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n";
}

#define int ll
using ll = long long;
using ull = unsigned long long;
constexpr int INFINT = 1 << 30;                         // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;             // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                         // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62); // 9.22x10^18
constexpr double EPS = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;

#define NO                                                                     \
  {                                                                            \
    OUT("No") BR;                                                              \
    return 0;                                                                  \
  }

signed main() {
  INIT;
  VAR(int, n);
  VEC(int, x, n);
  std::vector<PAIR> pv(n);
  REP(i, n) { pv[i] = PAIR(x[i], i); }
  std::sort(ALL(pv));
  std::vector<int> v(n * n, -1);
  std::vector<int> cnt(n, n);
  int pos = 0;
  REP(i, n) {
    auto p(pv[i]);
    if (v[p.first - 1] != -1)
      NO;
    int rest = p.second;
    while (rest) {
      if (v[pos] == -1) {
        --rest;
        --cnt[p.second];
        v[pos] = p.second + 1;
      }
      ++pos;
    }
    if (pos > p.first - 1)
      NO;
    v[p.first - 1] = p.second + 1;
    --cnt[p.second];
  }
  pos = n * n - 1;
  std::reverse(ALL(pv));
  REP(i, n) {
    auto p(pv[i]);
    while (cnt[p.second]) {
      if (v[pos] == -1) {
        --cnt[p.second];
        v[pos] = p.second + 1;
      }
      --pos;
    }
    if (pos < p.first - 1)
      NO;
  }
  REP(i, n * n) {
    if (v[i] == -1)
      assert(false);
  }
  OUT("Yes") BR;
  REP(i, n * n) { OUT(v[i]) SP; }
  BR;
  return 0;
}