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

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define FILL(a, n, x)                                                          \\
  ;                                                                            \\
  REP(i, (n)) { (a)[i] = (x); }
#define CINA(a, n)                                                             \\
  ;                                                                            \\
  REP(i, (n)) { cin >> (a)[i]; }
#define FILL2(a, n, m, x)                                                      \\
  ;                                                                            \\
  REP(i, (n)) {                                                                \\
    REP(j, (m)) { (a)[i][j] = (x); }                                           \\
  }
#define CINA2(a, n, m)                                                         \\
  ;                                                                            \\
  REP(i, (n)) {                                                                \\
    REP(j, (m)) { cin >> (a)[i][j]; }                                          \\
  }
#define Liny "Yes\\n"
#define Linn "No\\n"
#define LINY "YES\\n"
#define LINN "NO\\n"

// cout << setfill('0') << right << setw(4) << 12; // "0012"
int keta(ll x) {
  if (x < 10) {
    return 1;
  } else {
    return keta(x / 10) + 1;
  }
}
int keta_wa(ll x) {
  if (x < 10) {
    return x;
  } else {
    return keta_wa(x / 10) + x % 10;
  }
}
int ctoi(char c) { return ((c >= '0' && c <= '9') ? c - '0' : 0); }
int __stoi(string s) { return atoi(s.c_str()); }
ll sum(ll a[], ll N) { return accumulate(a, a + N, 0LL); }
ll gcd(ll a, ll b) {
  if (a < b)
    swap(a, b);
  return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
  if (a < b) {
    swap(a, b);
  }
  return a / gcd(a, b) * b;
}
template <class T> void chmax(T &a, T b) {
  if (a < b) {
    a = b;
  }
}
template <class T> void chmin(T &a, T b) {
  if (a > b) {
    a = b;
  }
}
template <class T> bool isIn(T a, vector<T> v) {
  for (T x : v) {
    if (a == x) {
      return true;
    }
  }
  return false;
}
string strReplace(string s, string target, string replacement) {
  if (!target.empty()) {
    std::string::size_type pos = 0;
    while ((pos = s.find(target, pos)) != std::string::npos) {
      s.replace(pos, target.length(), replacement);
      pos += replacement.length();
    }
  }
  return s;
}
const ll MOD = 1e9 + 7;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define MP make_pair

bool DEBUG = 0;
template <class T> void dprint(T s) {
  if (DEBUG) {
    cout << s << "\\n";
  }
}

const ll MAX = MOD;

ll N;
ll a[1000005];

bool isNotCoprime() {
  ll temp = a[0];
  REP(i, N) { temp = gcd(temp, a[i]); }
  return temp > 1;
}

void solve() {
  cin >> N;
  CINA(a, N);
  if (isNotCoprime()) {
    cout << "not coprime\\n";
    return;
  }
  map<ll, int> mp;
  REP(i, N) {
    vector<ll> v;
    map<ll, int> mp_temp;
    ll temp = a[i];
    while (temp > 1) {
      dprint(temp);
      bool did = false;
      for (ll x = 2; x <= (ll)sqrt(temp + 1) + 1; ++x) {
        while (temp % x == 0) {
          temp /= x;
          did = true;
        }
        if (did) {
          ++mp_temp[x];
          v.push_back(x);
          break;
        }
      }
      if (!did) {
        ++mp_temp[temp];
        if (mp_temp[temp] == 1) {
          v.push_back(temp);
        }
        break;
      }
    }
    for (ll x : v) {
      ++mp[x];
      if (mp[x] > 1) {
        cout << "setwise coprime\\n";
        return;
      }
    }
  }
  cout << "pairwise coprime\\n";
  return;
}

int main(int argc, char *argv[]) {
  if (argc > 1 && argv[1][0] == 'D') {
    DEBUG = 1;
  }
  solve();
  return 0;
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define FILL(a, n, x)                                                          \\
  ;                                                                            \\
  REP(i, (n)) { (a)[i] = (x); }
#define CINA(a, n)                                                             \\
  ;                                                                            \\
  REP(i, (n)) { cin >> (a)[i]; }
#define FILL2(a, n, m, x)                                                      \\
  ;                                                                            \\
  REP(i, (n)) {                                                                \\
    REP(j, (m)) { (a)[i][j] = (x); }                                           \\
  }
#define CINA2(a, n, m)                                                         \\
  ;                                                                            \\
  REP(i, (n)) {                                                                \\
    REP(j, (m)) { cin >> (a)[i][j]; }                                          \\
  }
#define Liny "Yes\\n"
#define Linn "No\\n"
#define LINY "YES\\n"
#define LINN "NO\\n"

// cout << setfill('0') << right << setw(4) << 12; // "0012"
int keta(ll x) {
  if (x < 10) {
    return 1;
  } else {
    return keta(x / 10) + 1;
  }
}
int keta_wa(ll x) {
  if (x < 10) {
    return x;
  } else {
    return keta_wa(x / 10) + x % 10;
  }
}
int ctoi(char c) { return ((c >= '0' && c <= '9') ? c - '0' : 0); }
int __stoi(string s) { return atoi(s.c_str()); }
ll sum(ll a[], ll N) { return accumulate(a, a + N, 0LL); }
ll gcd(ll a, ll b) {
  if (a < b)
    swap(a, b);
  return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
  if (a < b) {
    swap(a, b);
  }
  return a / gcd(a, b) * b;
}
template <class T> void chmax(T &a, T b) {
  if (a < b) {
    a = b;
  }
}
template <class T> void chmin(T &a, T b) {
  if (a > b) {
    a = b;
  }
}
template <class T> bool isIn(T a, vector<T> v) {
  for (T x : v) {
    if (a == x) {
      return true;
    }
  }
  return false;
}
string strReplace(string s, string target, string replacement) {
  if (!target.empty()) {
    std::string::size_type pos = 0;
    while ((pos = s.find(target, pos)) != std::string::npos) {
      s.replace(pos, target.length(), replacement);
      pos += replacement.length();
    }
  }
  return s;
}
const ll MOD = 1e9 + 7;
#define pii pair<int, int>
#define pll pair<ll, ll>
#define MP make_pair

bool DEBUG = 0;
template <class T> void dprint(T s) {
  if (DEBUG) {
    cout << s << "\\n";
  }
}

const ll MAX = MOD;

ll N;
ll a[1000005];

bool isNotCoprime() {
  ll temp = a[0];
  REP(i, N) { temp = gcd(temp, a[i]); }
  return temp > 1;
}

void solve() {
  cin >> N;
  CINA(a, N);
  if (isNotCoprime()) {
    cout << "not coprime\\n";
    return;
  }
  map<ll, int> mp;
  REP(i, N) {
    vector<ll> v;
    map<ll, int> mp_temp;
    ll temp = a[i];
    while (temp > 1) {
      dprint(temp);
      bool did = false;
      for (ll x = 2; x <= (ll)sqrt(temp + 1) + 1; ++x) {
        if (temp % x == 0) {
          temp /= x;
          ++mp_temp[x];
          if (mp_temp[x] == 1) {
            v.push_back(x);
          }
          did = true;
          break;
        }
      }
      if (!did) {
        ++mp_temp[temp];
        if (mp_temp[temp] == 1) {
          v.push_back(temp);
        }
        break;
      }
    }
    for (ll x : v) {
      ++mp[x];
    }
  }
  for (ll x = 2; x <= 1000000; ++x) {
    if (mp[x] > 1) {
      cout << "setwise coprime\\n";
      return;
    }
  }
  cout << "pairwise coprime\\n";
  return;
}

int main(int argc, char *argv[]) {
  if (argc > 1 && argv[1][0] == 'D') {
    DEBUG = 1;
  }
  solve();
  return 0;
}