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


#include "bits/stdc++.h"

using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                 \\
  sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(    \\
            c i) {
sim > struct rge {
  c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
  ~debug() { cerr << endl; }
  eni(!=) cerr << boolalpha << i;
  ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
  sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define cool                                                                   \\
  ios_base::sync_with_stdio(0);                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
#define int long long int
#define pb push_back
#define fe first
#define ld long double
#define lb lower_bound
#define ub upper_bound
#define pii pair<pair<int, int>, pair<int, int>>
#define se second
#define endl "\\n"
#define pi pair<int, int>
#define mi map<int, int>
#define mii map<pi, int>
#define vi vector<int>
#define vvi vector<vi>
#define bs binary_search
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rep1(i, a, b) for (int i = a; i <= b; i++)
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)x.size()
#define PI 3.14159265358979323846

const int N = 3e5 + 5;
const int lg = 20;

int mod = 1e9 + 7;
int dx[4] = {0, 0, +1, -1};
int dy[4] = {+1, -1, 0, 0};

int po(int a, int b) {
  a %= mod;
  int res = 1;
  while (b > 0) {
    if (b & 1)
      res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}

mi mp;

void solve() {
  int n;
  cin >> n;

  int cnt = 0;
  int n1 = n;
  for (int i = 2; i * i <= n; i++) {
    while (n1 % i == 0) {
      n1 /= i;
      mp[i]++;
    }
  }

  if (n1 != 1)
    mp[n]++;
  vi a(1e6);
  rep(i, 0, 1e6 + 1) a[i] = (i * (i + 1)) / 2;

  for (auto to : mp) {
    int ind = ub(all(a), to.se) - a.begin() - 1;
    cnt += ind;
  }

  cout << cnt << endl;
}

int32_t main() {
  cool;
  int t = 1;
  //~ cin>>t;
  while (t--)
    solve();

  return 0;
}


Error: TLE

Fixed submission:


#include "bits/stdc++.h"

using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                 \\
  sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(    \\
            c i) {
sim > struct rge {
  c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
  ~debug() { cerr << endl; }
  eni(!=) cerr << boolalpha << i;
  ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
  sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define cool                                                                   \\
  ios_base::sync_with_stdio(0);                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
#define int long long int
#define pb push_back
#define fe first
#define ld long double
#define lb lower_bound
#define ub upper_bound
#define pii pair<pair<int, int>, pair<int, int>>
#define se second
#define endl "\\n"
#define pi pair<int, int>
#define mi map<int, int>
#define mii map<pi, int>
#define vi vector<int>
#define vvi vector<vi>
#define bs binary_search
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rep1(i, a, b) for (int i = a; i <= b; i++)
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)x.size()
#define PI 3.14159265358979323846

const int N = 3e5 + 5;
const int lg = 20;

int mod = 1e9 + 7;
int dx[4] = {0, 0, +1, -1};
int dy[4] = {+1, -1, 0, 0};

int po(int a, int b) {
  a %= mod;
  int res = 1;
  while (b > 0) {
    if (b & 1)
      res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}

mi mp;

int is_prime(int n) {
  if (n == 1)
    return 0;
  if (n != 2 && n % 2 == 0)
    return 0;
  for (int i = 3; i * i <= n; i += 2) {
    if (n % i == 0)
      return 0;
  }
  return 1;
}

void solve() {
  int n;
  cin >> n;
  if (is_prime(n)) {
    cout << 1 << endl;
    return;
  }
  int cnt = 0;
  for (int i = 2;; i++) {
    if (is_prime(n)) {
      if (mp[n] == 0)
        cnt++;
      break;
    }
    if (n <= 1)
      break;
    if (is_prime(i)) {
      //~ cout<<i<<" "<<n<<endl;
      int j = i;
      while (n > 1 && n % j == 0) {
        cnt++;
        mp[j] = 1;
        n /= j;
        j *= i;
        //~ cout<<n<<endl;
      }
    }
    //~ cout<<n<<endl;
  }
  //~ cout<<n<<endl;
  cout << cnt << endl;
}

int32_t main() {
  cool;
  int t = 1;
  //~ cin>>t;
  while (t--)
    solve();

  return 0;
}