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

// {{{ by unolight
#pragma region
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REP1(i, a, b) for (int i = (a); i <= int(b); i++)
#define MP make_pair
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

namespace {
namespace unolight {
// Read Input
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%" PRId64, &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
  _R(head);
  R(tail...);
}
// Write Output
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%" PRId64, x); }
void _W(const double &x) { printf("%.16f\\n", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T> void _W(const vector<T> &x) {
  for (auto i = x.begin(); i != x.end(); _W(*i++))
    if (i != x.cbegin())
      putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\\n');
  W(tail...);
}

#ifdef UNOLIGHT
#include "dump.hpp"
#else
#define dump(...)
#endif

template <class T> inline bool chmax(T &a, const T &b) {
  return b > a ? a = b, true : false;
}
template <class T> inline bool chmin(T &a, const T &b) {
  return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) {
  sort(begin(v), end(v), f);
  v.resize(unique(begin(v), end(v)) - begin(v));
}
#pragma endregion
// }}}

void main() {
  int n;
  R(n);
  VI A(n), B(n);
  VI ca(n + 1), cb(n + 1);
  REP(i, n) R(A[i]);
  REP(i, n) R(B[i]);
  REP(i, n) ca[A[i]]++;
  REP(i, n) cb[B[i]]++;
  REP1(i, 1, n) if (ca[i] + cb[i] > n) {
    W("No");
    return;
  }
  REP1(i, 1, n) ca[i] += ca[i - 1];
  REP1(i, 1, n) cb[i] += cb[i - 1];
  int x = 0;
  REP1(i, 1, n) chmax(x, ca[i] - cb[i - 1]);
  W("Yes");
  VI ans(n);
  REP(i, n) ans[(i + x) % n] = B[i];
  W(ans);
}

} // namespace unolight
} // namespace
int main() {
  unolight::main();
  return 0;
}
// }}}


Error: WA

Fixed submission:

// {{{ by unolight
#pragma region
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REP1(i, a, b) for (int i = (a); i <= int(b); i++)
#define MP make_pair
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

namespace {
namespace unolight {
// Read Input
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%" PRId64, &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
  _R(head);
  R(tail...);
}
// Write Output
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%" PRId64, x); }
void _W(const double &x) { printf("%.16f\\n", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T> void _W(const vector<T> &x) {
  for (auto i = x.begin(); i != x.end(); _W(*i++))
    if (i != x.cbegin())
      putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\\n');
  W(tail...);
}

#ifdef UNOLIGHT
#include "dump.hpp"
#else
#define dump(...)
#endif

template <class T> inline bool chmax(T &a, const T &b) {
  return b > a ? a = b, true : false;
}
template <class T> inline bool chmin(T &a, const T &b) {
  return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) {
  sort(begin(v), end(v), f);
  v.resize(unique(begin(v), end(v)) - begin(v));
}
#pragma endregion
// }}}

void main() {
  int n;
  R(n);
  VI A(n), B(n + 1);
  REP(i, n) R(A[i]);
  REP(i, n) {
    int b;
    R(b);
    B[b]++;
  }
  priority_queue<PII> bs;
  REP1(i, 1, n) if (B[i]) bs.push({B[i], i});
  VI ans(n);
  int remain = n;
  for (int i = 0, j; i < n; i = j) {
    for (j = i; A[i] == A[j] && j < n; j++)
      ;
    int need = j - i;
    auto t = bs.top();
    bs.pop();
    if (t.second == A[i]) {
      if (remain - t.first < need) {
        W("NO");
        return;
      }
      int k = i;
      while (k < j) {
        auto tt = bs.top();
        bs.pop();
        int cnt = tt.first, v = tt.second;
        for (; k < j; k++) {
          if (cnt == 0)
            break;
          ans[k] = v;
          cnt--;
        }
        if (cnt)
          bs.push({cnt, v});
      }
      bs.push(t);
    } else {
      int k = i;
      bs.push(t);
      while (k < j) {
        auto tt = bs.top();
        bs.pop();
        int cnt = tt.first, v = tt.second;
        for (; k < j; k++) {
          if (cnt == 0)
            break;
          ans[k] = v;
          cnt--;
        }
        if (cnt)
          bs.push({cnt, v});
      }
    }
  }

  W("YES");
  W(ans);
}

} // namespace unolight
} // namespace
int main() {
  unolight::main();
  return 0;
}
// }}}