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

#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VS = vector<string>;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair<int, int>;
using VPII = vector<pair<int, int>>;
template <typename T = int> using VT = vector<T>;
template <typename T = int> using VVT = vector<vector<T>>;
template <typename T = int> using LIM = numeric_limits<T>;
template <typename T = int> using OSI = ostream_iterator<T>;

template <typename T> inline istream &operator>>(istream &s, vector<T> &v) {
  for (T &t : v) {
    s >> t;
  }
  return s;
}
template <typename T>
inline ostream &operator<<(ostream &s, const vector<T> &v) {
  for (int i = 0; i < int(v.size()); ++i) {
    s << (" " + !i) << v[i];
  }
  return s;
}

void in_impl(){};
template <typename T, typename... TS> void in_impl(T &head, TS &...tail) {
  cin >> head;
  in_impl(tail...);
}
#define IN(T, ...)                                                             \\
  T __VA_ARGS__;                                                               \\
  in_impl(__VA_ARGS__);

template <typename T> inline T fromString(const string &s) {
  T res;
  istringstream iss(s);
  iss >> res;
  return res;
}
template <typename T> inline string toString(const T &a) {
  ostringstream oss;
  oss << a;
  return oss.str();
}

#define NUMBERED(name, number) NUMBERED2(name, number)
#define NUMBERED2(name, number) name##_##number
#define REP1(n) REP2(NUMBERED(REP_COUNTER, __LINE__), n)
#define REP2(i, n) REP3(i, 0, n)
#define REP3(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define GET_REP(a, b, c, F, ...) F
#define REP(...) GET_REP(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__)
#define FOR(e, c) for (auto &&e : c)
#define ALL(c) begin(c), end(c)
#define AALL(a)                                                                \\
  (remove_all_extents<decltype(a)>::type *)a,                                  \\
      (remove_all_extents<decltype(a)>::type *)a +                             \\
          sizeof(a) / sizeof(remove_all_extents<decltype(a)>::type)

#define SZ(v) ((int)(v).size())
#define EXISTS(c, e) ((c).find(e) != (c).end())

template <typename T> inline bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> inline bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP(x) cerr << #x << " = " << (x) << endl

//     Λ   Λ＿_
//  ／(*ﾟーﾟ)／＼
// ／| ￣U U￣|＼／
//   |      |／

// 素因数分解 O( √N )
vector<long long> primeFactorization(long long N) {
  if (N == 1) {
    return vector<long long>();
  }

  vector<long long> result;
  for (long long p = 2; p * p <= N; p++) {
    while (!(N % p)) {
      result.push_back(p);
      N /= p;
    }
  }
  if (N != 1) {
    result.push_back(N);
  }

  return result;
}

bool pairwise_coprime(VVT<LL> pss) {
  set<LL> factors;
  FOR(ps, pss) {
    ps.erase(unique(ALL(ps)), end(ps));
    FOR(p, ps) {
      if (EXISTS(factors, p)) {
        return false;
      }
      factors.EM(p);
    }
  }
  return true;
}

bool setwise_coprime(VVT<LL> pss) {
  int i = 0;
  map<LL, int> factors;
  FOR(ps, pss) {
    ++i;
    bool at_least_one_common = false;
    ps.erase(unique(ALL(ps)), end(ps));
    FOR(p, ps) {
      ++factors[p];
      at_least_one_common |= factors[p] == i;
    }
    if (!at_least_one_common) {
      return true;
    }
  }
  return false;
}

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << setprecision(12) << fixed;

  IN(int, N);
  VI A(N);
  cin >> A;

  VVT<LL> pss;
  for_each(ALL(A), [&](const int a) { pss.PB(primeFactorization(a)); });

  if (pairwise_coprime(pss)) {
    cout << "pairwise coprime" << endl;
  } else if (setwise_coprime(pss)) {
    cout << "setwise coprime" << endl;
  } else {
    cout << "not coprime" << endl;
  }

  return 0;
}

Error: TLE

Fixed submission:

#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector<int>;
using VVI = vector<vector<int>>;
using VS = vector<string>;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair<int, int>;
using VPII = vector<pair<int, int>>;
template <typename T = int> using VT = vector<T>;
template <typename T = int> using VVT = vector<vector<T>>;
template <typename T = int> using LIM = numeric_limits<T>;
template <typename T = int> using OSI = ostream_iterator<T>;

template <typename T> inline istream &operator>>(istream &s, vector<T> &v) {
  for (T &t : v) {
    s >> t;
  }
  return s;
}
template <typename T>
inline ostream &operator<<(ostream &s, const vector<T> &v) {
  for (int i = 0; i < int(v.size()); ++i) {
    s << (" " + !i) << v[i];
  }
  return s;
}

void in_impl(){};
template <typename T, typename... TS> void in_impl(T &head, TS &...tail) {
  cin >> head;
  in_impl(tail...);
}
#define IN(T, ...)                                                             \\
  T __VA_ARGS__;                                                               \\
  in_impl(__VA_ARGS__);

template <typename T> inline T fromString(const string &s) {
  T res;
  istringstream iss(s);
  iss >> res;
  return res;
}
template <typename T> inline string toString(const T &a) {
  ostringstream oss;
  oss << a;
  return oss.str();
}

#define NUMBERED(name, number) NUMBERED2(name, number)
#define NUMBERED2(name, number) name##_##number
#define REP1(n) REP2(NUMBERED(REP_COUNTER, __LINE__), n)
#define REP2(i, n) REP3(i, 0, n)
#define REP3(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define GET_REP(a, b, c, F, ...) F
#define REP(...) GET_REP(__VA_ARGS__, REP3, REP2, REP1)(__VA_ARGS__)
#define FOR(e, c) for (auto &&e : c)
#define ALL(c) begin(c), end(c)
#define AALL(a)                                                                \\
  (remove_all_extents<decltype(a)>::type *)a,                                  \\
      (remove_all_extents<decltype(a)>::type *)a +                             \\
          sizeof(a) / sizeof(remove_all_extents<decltype(a)>::type)

#define SZ(v) ((int)(v).size())
#define EXISTS(c, e) ((c).find(e) != (c).end())

template <typename T> inline bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
template <typename T> inline bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP(x) cerr << #x << " = " << (x) << endl

//     Λ   Λ＿_
//  ／(*ﾟーﾟ)／＼
// ／| ￣U U￣|＼／
//   |      |／

// 素因数分解 O( √N )
vector<long long> primeFactorization(long long N) {
  if (N == 1) {
    return vector<long long>();
  }

  vector<long long> result;
  for (long long p = 2; p * p <= N; p++) {
    while (!(N % p)) {
      result.push_back(p);
      N /= p;
    }
  }
  if (N != 1) {
    result.push_back(N);
  }

  return result;
}

bool pairwise_coprime(VVT<LL> pss) {
  set<LL> factors;
  FOR(ps, pss) {
    ps.erase(unique(ALL(ps)), end(ps));
    FOR(p, ps) {
      if (EXISTS(factors, p)) {
        return false;
      }
      factors.EM(p);
    }
  }
  return true;
}

bool setwise_coprime(VVT<LL> pss) {
  const auto N = SZ(pss);

  map<LL, int> factors;
  FOR(ps, pss) {
    ps.erase(unique(ALL(ps)), end(ps));
    FOR(p, ps) { ++factors[p]; }
  }
  FOR(p, factors) {
    if (p.snd == N) {
      return false;
    }
  }
  return true;
}

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  cout << setprecision(12) << fixed;

  IN(int, N);
  VI A(N);
  cin >> A;

  VVT<LL> pss;
  for_each(ALL(A), [&](const int a) { pss.PB(primeFactorization(a)); });

  if (pairwise_coprime(pss)) {
    cout << "pairwise coprime" << endl;
  } else if (setwise_coprime(pss)) {
    cout << "setwise coprime" << endl;
  } else {
    cout << "not coprime" << endl;
  }

  return 0;
}