Language: C++

CE
#pragma region kyopro_template
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define mem(a, val) memset(a, val, sizeof(a))
#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define inc(...)    \
  char __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
using namespace std;
void solve();
using ll = long long;
template <class T = ll>
using V = vector<T>;
using vi = vector<int>;
using vl = vector<long long>;
using vvi = vector<vector<int>>;
using vd = V<double>;
using vs = V<string>;
using vvl = vector<vector<long long>>;
using P = pair<long long, long long>;
using vp = vector<P>;
using pii = pair<int, int>;
using vpi = vector<pair<int, int>>;
constexpr int inf = 1001001001;
constexpr long long infLL = (1LL << 61) - 1;
template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}
template <typename T, typename U>
ll ceil(T a, U b) {
  return (a + b - 1) / b;
}
constexpr ll TEN(int n) {
  ll ret = 1, x = 10;
  while (n) {
    if (n & 1) ret *= x;
    x *= x;
    n >>= 1;
  }
  return ret;
}

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  int s = (int)v.size();
  for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &... u) {
  cin >> t;
  in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U>
void out(const T &t, const U &... u) {
  cout << t;
  if (sizeof...(u)) cout << " ";
  out(u...);
}
template <typename T>
void die(T x) {
  out(x);
  exit(0);
}

#ifdef NyaanDebug
#include "NyaanDebug.h"
#define trc(...)                   \
  do {                             \
    cerr << #__VA_ARGS__ << " = "; \
    dbg_out(__VA_ARGS__);          \
  } while (0)
#define trca(v, N)       \
  do {                   \
    cerr << #v << " = "; \
    array_out(v, N);     \
  } while (0)
#define trcc(v)                             \
  do {                                      \
    cerr << #v << " = {";                   \
    each(x, v) { cerr << " " << x << ","; } \
    cerr << "}" << endl;                    \
  } while (0)
#else
#define trc(...)
#define trca(...)
#define trcc(...)
int main() { solve(); }
#endif

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

inline int popcount(unsigned long long a) { return __builtin_popcountll(a); }
inline int lsb(unsigned long long a) { return __builtin_ctzll(a); }
inline int msb(unsigned long long a) { return 63 - __builtin_clzll(a); }
template <typename T>
inline int getbit(T a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void setbit(T &a, int i) {
  a |= (1LL << i);
}
template <typename T>
inline void delbit(T &a, int i) {
  a &= ~(1LL << i);
}
template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
vector<T> mkrui(const vector<T> &v) {
  vector<T> ret(v.size() + 1);
  for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  return ret;
};

template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}

template <typename T>
vector<int> mkord(int N, function<bool(int, int)> f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}

#pragma endregion

constexpr long long MOD = /** 1000000007;  //*/ 998244353;

int ans[64][512][512];
uint64_t bns[512][512];
void solve() {
  using ull = uint64_t;
  ini(N);
  vi S(N), T(N);
  V<ull> U(N), V(N);
  in(S, T, U, V);

  auto rand_time = chrono::duration_cast<chrono::nanoseconds>(
                       chrono::high_resolution_clock::now().time_since_epoch())
                       .count();
  mt19937_64 rng(rand_time);
#ifdef NyaanDebug
  while (1) {
    N = 2;
    
    rep(i, N) {
      S[i] = rng() % 2;
      T[i] = rng() % 2;
      U[i] = rng() % 2;
      V[i] = rng() % 2;
    }
    
#endif
    if (N == 1) {
      if (U[0] == V[0])
        out(U[0]);
      else
        out(-1);
    }

    // 下のビットから
    rep(b, 64) {
      rep(i, N) rep(j, N) ans[b][i][j] = -1;
      //
      int is1 = 0, iw0 = 0, js1 = 0, jw0 = 0;
      int ifr = 0, jfr = 0;
      rep(i, N) {
        int bit = getbit(U[i], b);
        if (S[i] != bit) {
          rep(j, N) ans[b][i][j] = bit;
          (bit ? is1 : iw0) += 1;
        } else
          ifr += 1;
      }
      rep(j, N) {
        int bit = getbit(V[j], b);
        if (T[j] != bit) {
          rep(i, N) ans[b][i][j] = bit;
          (bit ? js1 : jw0) += 1;
        } else
          jfr += 1;
      }
      if(b==0) trc(is1, iw0, js1, jw0, ifr, jfr);
      if (is1 > 0 && jw0 > 0) die(-1);
      if (iw0 > 0 && js1 > 0) die(-1);
      if (is1 + iw0 == N && jw0 + js1 == N) continue;
      else if(is1 + iw0 == N || jw0 + js1 == N) die(-1);

      // 残りは全部の列が異なるように置く

      // 横だけ
      if (is1 > 0 && iw0 > 0) {
        rep(i, N) {
          if (ans[b][i][0] != -1) continue;
          rep(j, N) ans[b][i][j] = (j & 1);
        }
      }
      // 縦だけ
      else if (js1 > 0 && jw0 > 0) {
        rep(j, N) {
          if (ans[b][0][j] != -1) continue;
          rep(i, N) ans[b][i][j] = (i & 1);
        }
      }
      // 横縦
      else if (is1 + iw0 > 0 && js1 + jw0 > 0) {
        int nxt = is1 > 0 ? 0 : 1;
        vi is, js;
        rep(i, N) if (ans[b][i][0] == -1) is.push_back(i);
        rep(j, N) if (ans[b][0][j] == -1) js.push_back(j);
        trc(is,js);
        rep(i, sz(is)) rep(j, sz(js)) { ans[b][is[i]][js[j]] = nxt; }
      }
      // 横だけか縦だけ
      else if (is1 + iw0 + js1 + jw0 >= N - 1) {
        if (is1 > 0 || iw0 > 0) {
          // 1列だけ
          int ii = 0;
          int i0 = 0, i1 = 1;
          rep(i, N) if (ans[b][i][0] == -1) ii = i;
          rep(j, N) {
            int bit = getbit(V[j], b);
            ans[b][ii][j] = bit;
            (bit ? i1 : i0) += 1;
          }
          int bit = getbit(U[ii], b);
          if ((bit ? i1 : i0) == 0) die(-1);
        } else {
          // 1列だけ
          int jj = 0;
          int j0 = 0, j1 = 1;
          rep(j, N) if (ans[b][0][j] == -1) jj = j;
          rep(i, N) {
            int bit = getbit(U[i], b);
            ans[b][i][jj] = bit;
            (bit ? j1 : j0) += 1;
          }
          int bit = getbit(V[jj], b);
          if ((bit ? j1 : j0) == 0) die(-1);
        }
      } else {
        vi is, js;
        rep(i, N) if (ans[b][i][0] == -1) is.push_back(i);
        rep(j, N) if (ans[b][0][j] == -1) js.push_back(j);
        
        trc(is,js,"a");
        rep(i, sz(is)) rep(j, sz(js)) { ans[b][is[i]][js[j]] = (i + j) & 1; }
      }
    }

    rep(b, 64) rep(i, N) rep(j, N) bns[i][j] |= ans[b][i][j] << b;

    

    rep(i, N) {
      ull cur = (S[i]==0 ? 0xFFFFFFFFull : 0);
      if (S[i] == 0)
        rep(j, N) cur &= bns[i][j];
      else
        rep(j, N) cur |= bns[i][j];
      if (cur != U[i]) {
        trc(S,T,U,V);
        rep(i,N)trca(bns[i],N);
        trc(i, S[i], U[i], cur);
        exit(1);
      }
    }
    rep(j, N) {
      ull cur = (T[j]==0 ? 0xFFFFFFFFull : 0);
      if (T[j] == 0)
        rep(i, N) cur &= bns[i][j];
      else
        rep(i, N) cur |= bns[i][j];
      if (cur != V[j]) {
        trc(S,T,U,V);
        rep(i,N)trca(bns[i],N);
        trc(j, T[j], V[j], cur);
        exit(1);
      }
    }

    rep(i, N) {
      rep(j, N) {
        if (j) cout << " ";
        cout << bns[i][j];
      }
      cout << "\n";
    }

#ifdef NyaanDebug
  }
#endif
}

Compiler output:
a.cc:1:1: error: 'CE' does not name a type
    1 | CE
      | ^~