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

#include <bits/stdc++.h>
using namespace std;

#define li long long int
#define uli unsigned long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1

#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\\t" << b << endl
#define p3(a, b, c) idp cout << a << "\\t" << b << "\\t" << c << endl
#define p4(a, b, c, d)                                                         \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << endl
#define p5(a, b, c, d, e)                                                      \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << endl
#define p6(a, b, c, d, e, f)                                                   \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << endl
#define p7(a, b, c, d, e, f, g)                                                \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << endl
#define p8(a, b, c, d, e, f, g, h)                                             \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << "\\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i)                                          \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << "\\t" << h << "\\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j)                                      \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << "\\t" << h << "\\t" << i << "\\t" << j << endl
#define foreach(it, v)                                                         \\
  for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n)                                                             \\
  idp {                                                                        \\
    rep(i, n) { cout << x[i] << " "; }                                         \\
    puts("");                                                                  \\
  }
#define dump2(x, n)                                                            \\
  idp {                                                                        \\
    rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; }            \\
    puts("");                                                                  \\
  }
#define dumpi(x)                                                               \\
  idp {                                                                        \\
    foreach (it, x) {                                                          \\
      cout << (*it) << " ";                                                    \\
    }                                                                          \\
    puts("");                                                                  \\
  }
#define dumpi2(x)                                                              \\
  idp {                                                                        \\
    foreach (it, x) {                                                          \\
      cout << "[" << (it)->F << " , " << (it)->S << "] ";                      \\
    }                                                                          \\
    puts("");                                                                  \\
  }

#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h)                                                        \\
  rep(i, h) {                                                                  \\
    rep(j, w) cout << a[i][j] << " ";                                          \\
    puts("");                                                                  \\
  }

typedef pair<li, li> PI;

#define PRIME_MAX 1010
bool isp[PRIME_MAX] = {false};
vector<li> primes;

inline void prime_init() {
  repp(i, 2, PRIME_MAX) isp[i] = true;
  repp(i, 2, sqrt(PRIME_MAX) + 2) {
    if (isp[i]) {
      for (li j = 2; i * j < PRIME_MAX; j++) {
        isp[i * j] = false;
      }
    }
  }
  rep(i, 1000) if (isp[i]) primes.pb(i);
}

unordered_set<li> st;

int main() {
  prime_init();
  bool pcop = true;
  li mac = 0;
  li n;
  cin >> n;
  li gg = INF;
  rin {
    li a;
    cin >> a;
    if (gg == INF) {
      gg = a;
    } else {
      gg = __gcd(gg, a);
    }
    if (pcop) {
      unordered_set<li> now;
      for (auto p : primes) {
        while (a % p == 0) {
          now.insert(p);
          a /= p;
        }
      }
      if (a > 1)
        now.insert(a);
      for (auto &&v : now) {
        if (st.count(v) > 0) {
          pcop = false;
        }
        st.insert(v);
      }
    }
  }
  if (pcop) {
    puts("pairwise coprime");
  } else if (gg == 1) {
    puts("setwise coprime");
  } else {
    puts("not coprime");
  }
  return 0;
}


Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;

#define li long long int
#define uli unsigned long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1

#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\\t" << b << endl
#define p3(a, b, c) idp cout << a << "\\t" << b << "\\t" << c << endl
#define p4(a, b, c, d)                                                         \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << endl
#define p5(a, b, c, d, e)                                                      \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << endl
#define p6(a, b, c, d, e, f)                                                   \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << endl
#define p7(a, b, c, d, e, f, g)                                                \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << endl
#define p8(a, b, c, d, e, f, g, h)                                             \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << "\\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i)                                          \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << "\\t" << h << "\\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j)                                      \\
  idp cout << a << "\\t" << b << "\\t" << c << "\\t" << d << "\\t" << e << "\\t"    \\
           << f << "\\t" << g << "\\t" << h << "\\t" << i << "\\t" << j << endl
#define foreach(it, v)                                                         \\
  for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n)                                                             \\
  idp {                                                                        \\
    rep(i, n) { cout << x[i] << " "; }                                         \\
    puts("");                                                                  \\
  }
#define dump2(x, n)                                                            \\
  idp {                                                                        \\
    rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; }            \\
    puts("");                                                                  \\
  }
#define dumpi(x)                                                               \\
  idp {                                                                        \\
    foreach (it, x) {                                                          \\
      cout << (*it) << " ";                                                    \\
    }                                                                          \\
    puts("");                                                                  \\
  }
#define dumpi2(x)                                                              \\
  idp {                                                                        \\
    foreach (it, x) {                                                          \\
      cout << "[" << (it)->F << " , " << (it)->S << "] ";                      \\
    }                                                                          \\
    puts("");                                                                  \\
  }

#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h)                                                        \\
  rep(i, h) {                                                                  \\
    rep(j, w) cout << a[i][j] << " ";                                          \\
    puts("");                                                                  \\
  }

typedef pair<li, li> PI;

#define PRIME_MAX 1010
bool isp[PRIME_MAX] = {false};
vector<li> primes;

inline void prime_init() {
  repp(i, 2, PRIME_MAX) isp[i] = true;
  repp(i, 2, sqrt(PRIME_MAX) + 2) {
    if (isp[i]) {
      for (li j = 2; i * j < PRIME_MAX; j++) {
        isp[i * j] = false;
      }
    }
  }
  rep(i, 1000) if (isp[i]) primes.pb(i);
}

unordered_set<li> st;

int main() {
  prime_init();
  bool pcop = true;
  li mac = 0;
  li n;
  cin >> n;
  li gg = INF;
  rin {
    li a;
    cin >> a;
    if (gg == INF) {
      gg = a;
    } else {
      gg = __gcd(gg, a);
    }
    unordered_set<li> now;
    for (auto p : primes) {
      while (a % p == 0) {
        now.insert(p);
        a /= p;
      }
    }
    if (a > 1)
      now.insert(a);
    for (auto &&v : now) {
      if (st.count(v) > 0) {
        pcop = false;
      }
      st.insert(v);
    }
  }
  if (pcop) {
    puts("pairwise coprime");
  } else if (gg == 1) {
    puts("setwise coprime");
  } else {
    puts("not coprime");
  }
  return 0;
}