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

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

// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>

#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)

#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair

#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)

ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }

int main() {
  ll n;
  cin >> n;
  if (n == 1) {
    cout << 0 << endl;
    return 0;
  }
  map<ll, int> mp;
  ll t = n;
  for (int i = 2; i <= sqrtl(t); ++i) {
    while (t % i == 0) {
      t /= i;
      mp[i]++;
    }
    if (t == 1)
      break;
  }
  if (t > 1)
    mp[t]++;
  priority_queue<ll, vll, greater<ll>> q;
  for (auto p : mp) {
    ll a = 1;
    rep(i, p.second) {
      a *= p.first;
      q.emplace(a);
    }
  }
  ll ans = 0;
  while (n > 1) {
    ll p = q.top();
    q.pop();
    if (p > n)
      break;
    if (n % p != 0)
      continue;
    n /= p;
    ++ans;
  }
  cout << ans << endl;
  return 0;
}


Error: TLE

Fixed submission:

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

// 総数を1000000007（素数）で割った余り
const long long mod = 1e9 + 7;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>

#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)

#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()

#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair

#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)

ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }

int main() {
  ll n;
  cin >> n;
  if (n == 1) {
    cout << 0 << endl;
    return 0;
  }
  map<int, int> mp;
  ll t = n;
  for (int i = 2; i <= sqrtl(t); ++i) {
    while (t % i == 0) {
      t /= i;
      mp[i]++;
    }
    if (t == 1)
      break;
  }
  if (t > 1)
    mp[t]++;
  priority_queue<ll, vll, greater<ll>> q;
  for (auto p : mp) {
    ll a = 1;
    rep(i, p.second) {
      a *= p.first;
      q.emplace(a);
    }
  }
  ll ans = 0;
  while (n > 1) {
    ll p = q.top();
    q.pop();
    if (p > n)
      break;
    if (n % p != 0)
      continue;
    n /= p;
    ++ans;
  }
  cout << ans << endl;
  return 0;
}