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

// {{{ by unolight
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REP1(i, a, b) for (int i = (a); i <= int(b); i++)
#define MP make_pair
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

namespace {
namespace unolight {
// Read Input
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%" PRId64, &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
  _R(head);
  R(tail...);
}
// Write Output
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%" PRId64, x); }
void _W(const double &x) { printf("%.16f\\n", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T> void _W(const vector<T> &x) {
  for (auto i = x.begin(); i != x.end(); _W(*i++))
    if (i != x.cbegin())
      putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\\n');
  W(tail...);
}

#ifdef UNOLIGHT
#include "dump.hpp"
#else
#define dump(...)
#endif

template <class T> inline bool chmax(T &a, const T &b) {
  return b > a ? a = b, true : false;
}
template <class T> inline bool chmin(T &a, const T &b) {
  return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) {
  sort(begin(v), end(v), f);
  v.resize(unique(begin(v), end(v)) - begin(v));
}
// }}}
struct Sieve {
  int n;
  vector<bool> b;
  vector<int> primes;
  Sieve(int n = 1) : n(n), b(n + 1, true) {
    b[0] = b[1] = false;
    for (long long i = 2; i * i <= n; i++) {
      if (!b[i])
        continue;
      primes.push_back(i);
      for (long long j = i * i; j <= n; j += i)
        b[j] = false;
    }
  }

  bool isPrime(int x) { return b[x]; }

  map<int, int> primeFactors(int x) {
    map<int, int> res;
    for (auto i : primes) {
      while (x % i == 0) {
        res[i]++;
        x /= i;
      }
    }
    if (x > 1)
      res[x]++;
    return res;
  }
};
const int N = 1000010;
void main() {
  int n;
  R(n);
  map<int, int> mp;
  Sieve s(N);
  REP(i, n) {
    int a;
    R(a);
    auto m = s.primeFactors(a);
    for (auto &it : m)
      mp[it.first]++;
  }
  int ok1 = 1, ok2 = 1;
  for (auto &it : mp) {
    if (it.second > 1)
      ok1 = 0;
    if (it.second == n)
      ok2 = 0;
  }
  if (ok1) {
    W("pairwise coprime");
  } else if (ok2) {
    W("setwise coprime");
  } else {
    W("not coprime");
  }
}

} // namespace unolight
} // namespace
int main() {
  unolight::main();
  return 0;
}
// }}}


Error: TLE

Fixed submission:

// {{{ by unolight
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#pragma GCC diagnostic ignored "-Wunused-function"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REP1(i, a, b) for (int i = (a); i <= int(b); i++)
#define MP make_pair
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

namespace {
namespace unolight {
// Read Input
template <class T> void _R(T &x) { cin >> x; }
void _R(int &x) { scanf("%d", &x); }
void _R(int64_t &x) { scanf("%" PRId64, &x); }
void _R(double &x) { scanf("%lf", &x); }
void _R(char &x) { scanf(" %c", &x); }
void _R(char *x) { scanf("%s", x); }
void R() {}
template <class T, class... U> void R(T &head, U &...tail) {
  _R(head);
  R(tail...);
}
// Write Output
template <class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const int64_t &x) { printf("%" PRId64, x); }
void _W(const double &x) { printf("%.16f\\n", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template <class T> void _W(const vector<T> &x) {
  for (auto i = x.begin(); i != x.end(); _W(*i++))
    if (i != x.cbegin())
      putchar(' ');
}
void W() {}
template <class T, class... U> void W(const T &head, const U &...tail) {
  _W(head);
  putchar(sizeof...(tail) ? ' ' : '\\n');
  W(tail...);
}

#ifdef UNOLIGHT
#include "dump.hpp"
#else
#define dump(...)
#endif

template <class T> inline bool chmax(T &a, const T &b) {
  return b > a ? a = b, true : false;
}
template <class T> inline bool chmin(T &a, const T &b) {
  return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T, class F = less<T>> void sort_uniq(vector<T> &v, F f = F()) {
  sort(begin(v), end(v), f);
  v.resize(unique(begin(v), end(v)) - begin(v));
}
// }}}
struct Sieve {
  int n;
  long long i, j;
  vector<bool> b;
  vector<int> primes;
  Sieve(int n = 1) : n(n), b(n + 1, true) {
    b[0] = b[1] = false;
    for (i = 2; i * i <= n; i++) {
      if (!b[i])
        continue;
      primes.push_back(i);
      for (j = i * i; j <= n; j += i)
        b[j] = false;
    }
    for (; i <= n; i++)
      if (b[i])
        primes.push_back(i);
  }

  bool isPrime(int x) { return b[x]; }

  map<int, int> primeFactors(int x) {
    map<int, int> res;
    for (auto i : primes) {
      while (x % i == 0) {
        res[i]++;
        x /= i;
      }
    }
    return res;
  }
};
const int N = 1000010;
void main() {
  int n;
  R(n);
  map<int, int> mp;
  Sieve s(N);
  REP(i, n) {
    int a;
    R(a);
    auto m = s.primeFactors(a);
    for (auto &it : m)
      mp[it.first]++;
  }
  int ok1 = 1, ok2 = 1;
  for (auto &it : mp) {
    if (it.second > 1)
      ok1 = 0;
    if (it.second == n)
      ok2 = 0;
  }
  if (ok1) {
    W("pairwise coprime");
  } else if (ok2) {
    W("setwise coprime");
  } else {
    W("not coprime");
  }
}

} // namespace unolight
} // namespace
int main() {
  unolight::main();
  return 0;
}
// }}}