Problem p04022 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("popcnt")
#pragma GCC target("avx2")

#ifdef LOCAL
#define dbg(x) cout << #x << " : " << x << endl;
#else
#define dbg(x)
#endif

#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto &x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

template <typename T1, typename T2> inline void mine(T1 &x, T2 y) {
  if (x > y)
    x = y;
}
template <typename T1, typename T2> inline void maxe(T1 &x, T2 y) {
  if (x < y)
    x = y;
}

ostream &operator<<(ostream &a, const vector<int> &b) {
  for (auto k : b)
    cout << k << ' ';
  return a;
}

typedef long long ll;
typedef unsigned long long ull;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;

const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 100010;
const double EPS = 1e-9;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

map<vpii, int> cnt;
int ld[MX];

vpii pr(const vpii &a) {
  vpii res = a;
  fi(0, siz(a)) res[i].second = (3 - a[i].second) % 3;
  return res;
}

void print(const vpii &a) {
  cout << "a: ";
  fx(x, a) cout << x.first << ' ' << x.second << ",  ";
  cout << endl;
}

int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);

  memset(ld, -1, sizeof(ld));
  vi ps;
  ps.reserve(10000);
  fi(2, MX) {
    if (ld[i] == -1) {
      ld[i] = i;
      ps.pb(i);
    }
    fx(x, ps) {
      if (x > ld[i] || x * i >= MX)
        break;
      ld[x * i] = x;
    }
  }
  int n;
  cin >> n;
  int ans = 0;
  fi(0, n) {
    vpii fact;
    ll x;
    cin >> x;
    fx(d, ps) {
      if (d * d > x)
        break;
      if (x % d == 0) {
        fact.pb({d, 0});
        while (x % d == 0) {
          fact.back().second++;
          x /= d;
        }
        fact.back().second %= 3;
        if (!fact.back().second)
          fact.ppb;
      }
    }
    if (x != 1) {
      if (x <= MX)
        fact.pb({x, 1});
      else {
        ++ans;
        continue;
      }
    }
    ++cnt[fact];
  }
  fx(x, cnt) {
    vpii op = pr(x.first);
    // print(x.first);
    // print(op);
    // dbg(x.second);
    if (op == x.first)
      ++ans;
    else {
      int sz1 = x.second;
      auto it = cnt.find(op);
      if (it == cnt.end())
        ans += sz1;
      else {
        int sz2 = it->second;
        if (sz1 > sz2)
          ans += sz1;
        else if (sz1 == sz2 && x.first < op)
          ans += sz1;
      }
    }
    // dbg(ans);
  }
  cout << ans << '\n';
}

Fixed submission:
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("popcnt")
#pragma GCC target("avx2")

#ifdef LOCAL
#define dbg(x) cout << #x << " : " << x << endl;
#else
#define dbg(x)
#endif
#define int long long
#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto &x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

using namespace std;

template <typename T1, typename T2> inline void mine(T1 &x, T2 y) {
  if (x > y)
    x = y;
}
template <typename T1, typename T2> inline void maxe(T1 &x, T2 y) {
  if (x < y)
    x = y;
}

ostream &operator<<(ostream &a, const vector<int> &b) {
  for (auto k : b)
    cout << k << ' ';
  return a;
}

typedef long long ll;
typedef unsigned long long ull;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;

const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 100010;
const double EPS = 1e-9;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

map<vpii, int> cnt;
int ld[MX];

vpii pr(const vpii &a) {
  vpii res = a;
  fi(0, siz(a)) res[i].second = (3 - a[i].second) % 3;
  return res;
}

void print(const vpii &a) {
  cout << "a: ";
  fx(x, a) cout << x.first << ' ' << x.second << ",  ";
  cout << endl;
}

int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);

  memset(ld, -1, sizeof(ld));
  vi ps;
  ps.reserve(10000);
  fi(2, MX) {
    if (ld[i] == -1) {
      ld[i] = i;
      ps.pb(i);
    }
    fx(x, ps) {
      if (x > ld[i] || x * i >= MX)
        break;
      ld[x * i] = x;
    }
  }
  int n;
  cin >> n;
  int ans = 0;
  fi(0, n) {
    vpii fact;
    ll x;
    cin >> x;
    fx(d, ps) {
      if (d * d > x)
        break;
      if (x % d == 0) {
        fact.pb({d, 0});
        while (x % d == 0) {
          fact.back().second++;
          x /= d;
        }
        fact.back().second %= 3;
        if (!fact.back().second)
          fact.ppb;
      }
    }
    if (x != 1) {
      if (x <= MX)
        fact.pb({x, 1});
      else {
        ++ans;
        continue;
      }
    }
    ++cnt[fact];
  }
  fx(x, cnt) {
    vpii op = pr(x.first);
    // print(x.first);
    // print(op);
    // dbg(x.second);
    if (op == x.first)
      ++ans;
    else {
      int sz1 = x.second;
      auto it = cnt.find(op);
      if (it == cnt.end())
        ans += sz1;
      else {
        int sz2 = it->second;
        if (sz1 > sz2)
          ans += sz1;
        else if (sz1 == sz2 && x.first < op)
          ans += sz1;
      }
    }
    // dbg(ans);
  }
  cout << ans << '\n';
}