Problem p02737 (C++)

Buggy submission (status: Runtime Error):
#include <bits/stdc++.h>

using namespace std;

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                                           \
  cerr << #v << ":";                                                           \
  for (int i = 0; i < v.size(); i++)                                           \
    cerr << " " << v[i];                                                       \
  cerr << endl;
#define DEBUG_MAT(v)                                                           \
  cerr << #v << endl;                                                          \
  for (int i = 0; i < v.size(); i++) {                                         \
    for (int j = 0; j < v[i].size(); j++) {                                    \
      cerr << v[i][j] << " ";                                                  \
    }                                                                          \
    cerr << endl;                                                              \
  }
typedef long long ll;
#define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
  return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
  return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout << setprecision(25) << fixed << p << endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
#define fio()                                                                  \
  cin.tie(0);                                                                  \
  ios::sync_with_stdio(false);
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
// #define endl '\n'

const int MAXN = 555555;

vl fact(MAXN);
vl rfact(MAXN);

ll mod_pow(ll x, ll p, ll M = MOD) {
  if (p < 0) {
    x = mod_pow(x, M - 2, M);
    p = -p;
  }
  ll a = 1;
  while (p) {
    if (p % 2)
      a = a * x % M;
    x = x * x % M;
    p /= 2;
  }
  return a;
}

ll mod_inverse(ll a, ll M = MOD) { return mod_pow(a, M - 2, M); }

void set_fact(ll n, ll M = MOD) {
  fact[0] = fact[1] = rfact[0] = rfact[1] = 1;
  for (ll i = 2; i <= n; i++) {
    fact[i] = i * fact[i - 1] % M;
    // rfact[i] = mod_inverse(fact[i], M);
  }
}

// http://drken1215.hatenablog.com/entry/2018/06/08/210000
// n���傫��fact���v�Z�ł��Ȃ��Ƃ��̂ق��̌v�Z���@�ɂ��ď����Ă���
ll nCr(ll n, ll r, ll M = MOD) {
  if (r > n)
    return 0;
  assert(fact[2] == 2);
  ll ret = fact[n];
  if (rfact[r] == 0) {
    rfact[r] = mod_inverse(fact[r], M);
  }
  ret = (ret * rfact[r]) % M;
  if (rfact[n - r] == 0) {
    rfact[n - r] = mod_inverse(fact[n - r], M);
  }
  ret = (ret * rfact[n - r]) % M;
  return ret;
}

ll nHr(ll n, ll r) { return nCr(n + r - 1, r); }

int n;
vector<vii> G(3);
vector<vii> num(3, vii(500));

void solve(int idx, vii G) {
  vi g(n);
  rrep(u, n) {
    set<int> st;
    for (int v : G[u]) {
      if (v > u)
        st.insert(g[v]);
    }

    rep(gl, 50000) {
      if (not st.count(gl)) {
        g[u] = gl;
        num[idx][gl].push_back(u);
        break;
      }
    }
  }
}

signed main() {
  cin >> n;
  rep(i, 3) {
    G[i].resize(n);
    int m;
    cin >> m;
    rep(j, m) {
      int u, v;
      cin >> u >> v;
      u--;
      v--;
      G[i][u].push_back(v);
      G[i][v].push_back(u);
    }
  }

  rep(i, 3) {
    solve(i, G[i]);
    // DEBUG(i);
    // rep (j, 3) {
    //     rep (k, num[i][j].size()) {
    //         cout << num[i][j][k] << " ";
    //     }
    //     cout << endl;
    // }
    // cout << endl;
  }

  ll base = mod_pow(10, 18);
  vll sum(3, vl(1000));
  rep(i, 3) {
    rep(j, 1000) {
      for (int u : num[i][j]) {
        (sum[i][j] += mod_pow(base, u + 1)) %= MOD;
      }
    }
  }

  ll ans = 0;
  rep(x, 1000) {
    rep(y, 1000) {
      int z = x ^ y;
      if (z >= 1000)
        continue;
      ll mul2 = sum[2][z];
      ll mul1 = sum[1][y];
      ll mul0 = sum[0][x];
      (ans += mul0 * mul1 % MOD * mul2 % MOD) %= MOD;
      // if (mul0 * mul1 % MOD * mul2 % MOD != 0) {
      //     DEBUG_VEC(vi({z, y, x}));
      //     DEBUG_VEC(vl({mul2, mul1, mul0}));
      // }
    }
  }
  cout << ans << endl;
}

Fixed submission:
#include <bits/stdc++.h>

using namespace std;

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                                           \
  cerr << #v << ":";                                                           \
  for (int i = 0; i < v.size(); i++)                                           \
    cerr << " " << v[i];                                                       \
  cerr << endl;
#define DEBUG_MAT(v)                                                           \
  cerr << #v << endl;                                                          \
  for (int i = 0; i < v.size(); i++) {                                         \
    for (int j = 0; j < v[i].size(); j++) {                                    \
      cerr << v[i][j] << " ";                                                  \
    }                                                                          \
    cerr << endl;                                                              \
  }
typedef long long ll;
#define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
  return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
  return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout << setprecision(25) << fixed << p << endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
vi dx2 = {1, 1, 0, -1, -1, -1, 0, 1}, dy2 = {0, 1, 1, 1, 0, -1, -1, -1};
#define fio()                                                                  \
  cin.tie(0);                                                                  \
  ios::sync_with_stdio(false);
// const ll MOD = 1000000007;
const ll MOD = 998244353;
// #define mp make_pair
// #define endl '\n'

const int MAXN = 555555;

vl fact(MAXN);
vl rfact(MAXN);

ll mod_pow(ll x, ll p, ll M = MOD) {
  if (p < 0) {
    x = mod_pow(x, M - 2, M);
    p = -p;
  }
  ll a = 1;
  while (p) {
    if (p % 2)
      a = a * x % M;
    x = x * x % M;
    p /= 2;
  }
  return a;
}

ll mod_inverse(ll a, ll M = MOD) { return mod_pow(a, M - 2, M); }

void set_fact(ll n, ll M = MOD) {
  fact[0] = fact[1] = rfact[0] = rfact[1] = 1;
  for (ll i = 2; i <= n; i++) {
    fact[i] = i * fact[i - 1] % M;
    // rfact[i] = mod_inverse(fact[i], M);
  }
}

// http://drken1215.hatenablog.com/entry/2018/06/08/210000
// n���傫��fact���v�Z�ł��Ȃ��Ƃ��̂ق��̌v�Z���@�ɂ��ď����Ă���
ll nCr(ll n, ll r, ll M = MOD) {
  if (r > n)
    return 0;
  assert(fact[2] == 2);
  ll ret = fact[n];
  if (rfact[r] == 0) {
    rfact[r] = mod_inverse(fact[r], M);
  }
  ret = (ret * rfact[r]) % M;
  if (rfact[n - r] == 0) {
    rfact[n - r] = mod_inverse(fact[n - r], M);
  }
  ret = (ret * rfact[n - r]) % M;
  return ret;
}

ll nHr(ll n, ll r) { return nCr(n + r - 1, r); }

int n;
vector<vii> G(3);
vector<vii> num(3, vii(1000));

void solve(int idx, vii G) {
  vi g(n);
  rrep(u, n) {
    set<int> st;
    for (int v : G[u]) {
      if (v > u)
        st.insert(g[v]);
    }

    rep(gl, 50000) {
      if (not st.count(gl)) {
        g[u] = gl;
        num[idx][gl].push_back(u);
        break;
      }
    }
  }
}

signed main() {
  cin >> n;
  rep(i, 3) {
    G[i].resize(n);
    int m;
    cin >> m;
    rep(j, m) {
      int u, v;
      cin >> u >> v;
      u--;
      v--;
      G[i][u].push_back(v);
      G[i][v].push_back(u);
    }
  }

  rep(i, 3) {
    solve(i, G[i]);
    // DEBUG(i);
    // rep (j, 3) {
    //     rep (k, num[i][j].size()) {
    //         cout << num[i][j][k] << " ";
    //     }
    //     cout << endl;
    // }
    // cout << endl;
  }

  ll base = mod_pow(10, 18);
  vll sum(3, vl(1000));
  rep(i, 3) {
    rep(j, 1000) {
      for (int u : num[i][j]) {
        (sum[i][j] += mod_pow(base, u + 1)) %= MOD;
      }
    }
  }

  ll ans = 0;
  rep(x, 1000) {
    rep(y, 1000) {
      int z = x ^ y;
      if (z >= 1000)
        continue;
      ll mul2 = sum[2][z];
      ll mul1 = sum[1][y];
      ll mul0 = sum[0][x];
      (ans += mul0 * mul1 % MOD * mul2 % MOD) %= MOD;
      // if (mul0 * mul1 % MOD * mul2 % MOD != 0) {
      //     DEBUG_VEC(vi({z, y, x}));
      //     DEBUG_VEC(vl({mul2, mul1, mul0}));
      // }
    }
  }
  cout << ans << endl;
}