Problem p02574 (C++) — buggy submission, verdict: Time Limit Exceeded

#include <bits/stdc++.h>
using namespace std;
// #pragma GCC target("arch=skylake-avx512")

#pragma region template

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll)(n)-1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second
#define uniq(x) (sort(all(x)), (x).erase(unique(all(x)), (x).end()))
#define bis(x, y) ((ll)(lower_bound(all(x), y) - (x).begin()))

using graph = vector<vector<ll>>;
template <class T> using wgraph = vector<vector<pair<ll, T>>>;
bool __DIRECTED__ = true;
bool __ZERO_INDEXED__ = false;
istream &operator>>(istream &is, graph &g) {
  ll a, b;
  is >> a >> b;
  if (__ZERO_INDEXED__ == false)
    a--, b--;
  g[a].pb(b);
  if (__DIRECTED__ == false)
    g[b].pb(a);
  return is;
}
template <class T> istream &operator>>(istream &is, wgraph<T> &g) {
  ll a, b;
  T c;
  is >> a >> b >> c;
  if (__ZERO_INDEXED__ == false)
    a--, b--;
  g[a].pb({b, c});
  if (__DIRECTED__ == false)
    g[b].pb({a, c});
  return is;
}

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;
}

// Debug
#define debug(...)                                                             \\
  {                                                                            \\
    cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                         \\
    for (auto &&__i : {__VA_ARGS__})                                           \\
      cerr << "[" << __i << "] ";                                              \\
    cerr << rt;                                                                \\
  }

#define dump(a, h, w)                                                          \\
  {                                                                            \\
    cerr << __LINE__ << ": " << #a << " = [" << rt;                            \\
    rep(__i, h) {                                                              \\
      rep(__j, w) {                                                            \\
        if (abs(a[__i][__j]) >= INF / 2 and a[__i][__j] <= -INF / 2)           \\
          cerr << '-';                                                         \\
        if (abs(a[__i][__j]) >= INF / 2)                                       \\
          cerr << "∞" << sp;                                                   \\
        else                                                                   \\
          cerr << a[__i][__j] << sp;                                           \\
      }                                                                        \\
      cerr << rt;                                                              \\
    }                                                                          \\
    cerr << "]" << rt;                                                         \\
  }

#define vdump(a, n)                                                            \\
  {                                                                            \\
    cerr << __LINE__ << ": " << #a << " = [";                                  \\
    rep(__i, n) {                                                              \\
      if (__i)                                                                 \\
        cerr << sp;                                                            \\
      if (abs(a[__i]) >= INF / 2 and a[__i] <= -INF / 2)                       \\
        cerr << '-';                                                           \\
      if (abs(a[__i]) >= INF / 2)                                              \\
        cerr << "∞" << sp;                                                     \\
      else                                                                     \\
        cerr << a[__i];                                                        \\
    }                                                                          \\
    cerr << "]" << rt;                                                         \\
  }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
  io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC target(                                                            \\
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("Ofast,unroll-loops")

// Math
inline constexpr ll gcd(const ll a, const ll b) {
  return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
  ll k = n % m;
  return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
  n %= m;
  return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
  ll r = 1;
  rep(i, 64) {
    if (n & (1LL << i))
      r *= a;
    chmod(r, m);
    a *= a;
    chmod(a, m);
  }
  return r;
}
inline ll inv(const ll n, const ll m = MOD) {
  ll a = n, b = m, x = 1, y = 0;
  while (b) {
    ll t = a / b;
    a -= t * b;
    swap(a, b);
    x -= t * y;
    swap(x, y);
  }
  return modulo(x, m);
}

#pragma endregion
#define Yes(x) (cout << ((x) ? "Yes" : "No") << rt)

struct fact {
  ll N;
  vector<ll> A, B, C;
  fact(ll n = 1 << 20) : N(n), A(n + 1, 1), B(n + 1, 1), C(n + 1, 1) {
    A[0] = A[1] = C[0] = C[1] = 0;
    inc(i, 2, N) {
      if (A[i] == 1) {
        for (ll k = 2 * i; k <= N; k += i) {
          A[k] = 0;
          B[k] = i;
        }
      } else {
        C[i] = C[i / B[i]] + 1;
      }
    }
  }
  bool p(ll n) { return A[n]; }
  ll mf(ll n) { return B[n]; }
  ll sf(ll n) { return C[n]; }
} f(1000000);

signed main() {
  ll N, M;
  cin >> N;
  vector<ll> A(N);
  map<ll, ll> Z;
  rep(i, N) {
    cin >> A[i];
    M = A[i];
    vector<ll> F;
    while (!f.p(M) and M != 1)
      F.pb(f.mf(M)), M /= f.mf(M);
    if (M != 1)
      F.pb(M);
    uniq(F);
    each(i, F) Z[i]++;
  }
  each(i, Z) {
    if (i.se >= 2) {
      ll g = 0;
      rep(i, N) g = gcd(g, A[i]);
      cout << (g == 1 ? "setwise coprime" : "not coprime") << rt;
      return 0;
    }
  }
  cout << "pairwise coprime" << rt;
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
// #pragma GCC target("arch=skylake-avx512")

#pragma region template

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll)(n)-1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second
#define uniq(x) (sort(all(x)), (x).erase(unique(all(x)), (x).end()))
#define bis(x, y) ((ll)(lower_bound(all(x), y) - (x).begin()))

using graph = vector<vector<ll>>;
template <class T> using wgraph = vector<vector<pair<ll, T>>>;
bool __DIRECTED__ = true;
bool __ZERO_INDEXED__ = false;
istream &operator>>(istream &is, graph &g) {
  ll a, b;
  is >> a >> b;
  if (__ZERO_INDEXED__ == false)
    a--, b--;
  g[a].pb(b);
  if (__DIRECTED__ == false)
    g[b].pb(a);
  return is;
}
template <class T> istream &operator>>(istream &is, wgraph<T> &g) {
  ll a, b;
  T c;
  is >> a >> b >> c;
  if (__ZERO_INDEXED__ == false)
    a--, b--;
  g[a].pb({b, c});
  if (__DIRECTED__ == false)
    g[b].pb({a, c});
  return is;
}

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;
}

// Debug
#define debug(...)                                                             \\
  {                                                                            \\
    cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                         \\
    for (auto &&__i : {__VA_ARGS__})                                           \\
      cerr << "[" << __i << "] ";                                              \\
    cerr << rt;                                                                \\
  }

#define dump(a, h, w)                                                          \\
  {                                                                            \\
    cerr << __LINE__ << ": " << #a << " = [" << rt;                            \\
    rep(__i, h) {                                                              \\
      rep(__j, w) {                                                            \\
        if (abs(a[__i][__j]) >= INF / 2 and a[__i][__j] <= -INF / 2)           \\
          cerr << '-';                                                         \\
        if (abs(a[__i][__j]) >= INF / 2)                                       \\
          cerr << "∞" << sp;                                                   \\
        else                                                                   \\
          cerr << a[__i][__j] << sp;                                           \\
      }                                                                        \\
      cerr << rt;                                                              \\
    }                                                                          \\
    cerr << "]" << rt;                                                         \\
  }

#define vdump(a, n)                                                            \\
  {                                                                            \\
    cerr << __LINE__ << ": " << #a << " = [";                                  \\
    rep(__i, n) {                                                              \\
      if (__i)                                                                 \\
        cerr << sp;                                                            \\
      if (abs(a[__i]) >= INF / 2 and a[__i] <= -INF / 2)                       \\
        cerr << '-';                                                           \\
      if (abs(a[__i]) >= INF / 2)                                              \\
        cerr << "∞" << sp;                                                     \\
      else                                                                     \\
        cerr << a[__i];                                                        \\
    }                                                                          \\
    cerr << "]" << rt;                                                         \\
  }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
  io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC target(                                                            \\
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("Ofast,unroll-loops")

// Math
inline constexpr ll gcd(const ll a, const ll b) {
  return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
  ll k = n % m;
  return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
  n %= m;
  return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
  ll r = 1;
  rep(i, 64) {
    if (n & (1LL << i))
      r *= a;
    chmod(r, m);
    a *= a;
    chmod(a, m);
  }
  return r;
}
inline ll inv(const ll n, const ll m = MOD) {
  ll a = n, b = m, x = 1, y = 0;
  while (b) {
    ll t = a / b;
    a -= t * b;
    swap(a, b);
    x -= t * y;
    swap(x, y);
  }
  return modulo(x, m);
}

#pragma endregion
#define Yes(x) (cout << ((x) ? "Yes" : "No") << rt)

struct fact {
  ll N;
  vector<ll> A, B, C;
  fact(ll n = 1 << 20) : N(n), A(n + 1, 1), B(n + 1, 1), C(n + 1, 1) {
    A[0] = A[1] = C[0] = C[1] = 0;
    inc(i, 2, N) {
      if (A[i] == 1) {
        for (ll k = 2 * i; k <= N; k += i) {
          A[k] = 0;
          B[k] = i;
        }
      } else {
        C[i] = C[i / B[i]] + 1;
      }
    }
  }
  bool p(ll n) { return A[n]; }
  ll mf(ll n) { return B[n]; }
  ll sf(ll n) { return C[n]; }
} f(1000000);

signed main() {
  ll N, M;
  cin >> N;
  vector<ll> A(N), Z;
  rep(i, N) {
    cin >> A[i];
    M = A[i];
    while (!f.p(M))
      Z.pb(f.mf(M)), M /= f.mf(M);
    if (M != 1)
      Z.pb(M);
  }
  uniq(Z);
  each(i, Z) {
    ll cnt = 0;
    rep(j, N) if (A[j] % i == 0) cnt++;
    if (cnt >= 2) {
      ll g = 0;
      rep(i, N) g = gcd(g, A[i]);
      cout << (g == 1 ? "setwise coprime" : "not coprime") << rt;
      return 0;
    }
  }
  cout << "pairwise coprime" << rt;
}