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

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
  out << "(" << o.first << "," << o.second << ")";
  return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &V) {
  for (int i = 0; i < V.size(); i++) {
    out << V[i];
    if (i != V.size() - 1)
      out << " ";
  }
  return out;
}
template <class T>
ostream &operator<<(ostream &out, const vector<vector<T>> &Mat) {
  for (int i = 0; i < Mat.size(); i++) {
    if (i != 0)
      out << endl;
    out << Mat[i];
  }
  return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> &mp) {
  out << "{ ";
  for (auto it = mp.begin(); it != mp.end(); it++) {
    out << it->first << ":" << it->second;
    if (mp.size() - 1 != distance(mp.begin(), it))
      out << ", ";
  }
  out << " }";
  return out;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t)
    fill_v(e, v);
}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

/**
 * 与えられる値の上限Nがわかっており、その範囲内で複数の素因数分解を行いたい時
 * 前処理 NloglogN
 * 素因数分解(primefactor) XlogN (Xは与えられる値)
 *
 * 前処理で、事前に値X(1〜N)に対して割るべき最小の素数を計算
 * 前処理で算出した素数で割ることを繰り返すことで、通常の素因数分解時にでる、無駄な除算判定をなくす
 */
struct PrimeFact {
  ll N;
  vector<ll> factor, primes;
  PrimeFact(ll N) : N(N), factor(N + 1) {
    factor[0] = factor[1] = -1;
    for (ll i = 2; i <= N; i++) {
      if (factor[i])
        continue;
      primes.emplace_back(i);
      factor[i] = i;
      for (ll j = i * i; j <= N; j += i) {
        if (!factor[j])
          factor[j] = i;
      }
    }
  }
  bool isPrime(ll x) { return factor[x] == x; }
  vector<ll> factors(ll x) {
    vector<ll> ret;
    while (x != 1) {
      ret.emplace_back(factor[x]);
      x /= factor[x];
    }
    return ret;
  }

  map<ll, ll> primefactor(ll x) {
    map<ll, ll> ret;
    for (auto p : factors(x)) {
      ret[p]++;
    }
    return ret;
  }
  void primefactor(ll x, map<ll, ll> &ret) {
    for (auto p : factors(x)) {
      ret[p]++;
    }
    return;
  }
};
template <class Type> Type solve(Type res = Type()) {
  int N;
  cin >> N;
  vector<ll> A(N);
  for (auto &in : A)
    cin >> in;
  PrimeFact PF(1000000);

  { // check pairwise
    bool prime[1000001] = {false};
    bool ok = true;
    for (int i = N - 1; i >= 0; i--) {
      auto primes = PF.primefactor(A[i]);
      for (auto p : primes) {
        if (prime[p.first]) {
          ok = false;
          break;
        } else {
          prime[p.first] = true;
        }
      }
    }
    if (ok) {
      return "pairwise coprime";
    }
  }
  {
    // check setwise
    ll GCD = 0;
    for (auto a : A)
      GCD = gcd(GCD, a);
    if (GCD == 1) {
      return "setwise coprime";
    }
  }
  return "not coprime";
  return res;
}
int main(void) {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  // solve(0);
  cout << fixed << setprecision(15) << solve<string>() << endl;
  return 0;
}


Error: 0

Fixed submission:

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <class S, class T>
ostream &operator<<(ostream &out, const pair<S, T> &o) {
  out << "(" << o.first << "," << o.second << ")";
  return out;
}
template <class T> ostream &operator<<(ostream &out, const vector<T> &V) {
  for (int i = 0; i < V.size(); i++) {
    out << V[i];
    if (i != V.size() - 1)
      out << " ";
  }
  return out;
}
template <class T>
ostream &operator<<(ostream &out, const vector<vector<T>> &Mat) {
  for (int i = 0; i < Mat.size(); i++) {
    if (i != 0)
      out << endl;
    out << Mat[i];
  }
  return out;
}
template <class S, class T>
ostream &operator<<(ostream &out, const map<S, T> &mp) {
  out << "{ ";
  for (auto it = mp.begin(); it != mp.end(); it++) {
    out << it->first << ":" << it->second;
    if (mp.size() - 1 != distance(mp.begin(), it))
      out << ", ";
  }
  out << " }";
  return out;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
  t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
  for (auto &e : t)
    fill_v(e, v);
}
/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

/**
 * 与えられる値の上限Nがわかっており、その範囲内で複数の素因数分解を行いたい時
 * 前処理 NloglogN
 * 素因数分解(primefactor) XlogN (Xは与えられる値)
 *
 * 前処理で、事前に値X(1〜N)に対して割るべき最小の素数を計算
 * 前処理で算出した素数で割ることを繰り返すことで、通常の素因数分解時にでる、無駄な除算判定をなくす
 */
struct PrimeFact {
  ll N;
  vector<ll> factor, primes;
  PrimeFact(ll N) : N(N), factor(N + 1) {
    factor[0] = factor[1] = -1;
    for (ll i = 2; i * i <= N; i++) {
      if (factor[i])
        continue;
      primes.emplace_back(i);
      factor[i] = i;
      for (ll j = i * i; j <= N; j += i) {
        if (!factor[j])
          factor[j] = i;
      }
    }
  }
  bool isPrime(ll x) { return factor[x] == x; }
  vector<ll> factors(ll x) {
    vector<ll> ret;
    while (x != 1) {
      ret.emplace_back(factor[x]);
      x /= factor[x];
    }
    return ret;
  }

  map<ll, ll> primefactor(ll x) {
    map<ll, ll> ret;
    for (auto p : factors(x)) {
      ret[p]++;
    }
    return ret;
  }
  void primefactor(ll x, map<ll, ll> &ret) {
    for (auto p : factors(x)) {
      ret[p]++;
    }
    return;
  }
};
template <class Type> Type solve(Type res = Type()) {
  int N;
  cin >> N;
  vector<ll> A(N);
  for (auto &in : A)
    cin >> in;
  PrimeFact PF(1000000);

  { // check pairwise
    bool prime[1000000] = {false};
    bool ok = true;
    for (int i = N - 1; i >= 0; i--) {

      auto primes = PF.primefactor(A[i]);
      for (auto p : primes) {
        if (prime[p.first]) {
          ok = false;
          break;
        } else {
          prime[p.first] = true;
        }
      }
    }
    if (ok) {
      return "pairwise coprime";
    }
  }
  {
    // check setwise
    ll GCD = 0;
    for (auto a : A)
      GCD = gcd(GCD, a);
    if (GCD == 1) {
      return "setwise coprime";
    }
  }
  return "not coprime";
  return res;
}
int main(void) {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  // solve(0);
  cout << fixed << setprecision(15) << solve<string>() << endl;
  return 0;
}