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

// #define NDEBUG
#include "bits/stdc++.h"
#include <array>
#include <iostream>
#include <random>
#include <string>
#include <unordered_map>
#include <unordered_set>
#ifdef _MSC_VER
#include <ppl.h>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// #include <boost/rational.hpp>
// #include <opencv2/core.hpp>
// #include <opencv2/imgproc.hpp>
// #include <opencv2/highgui.hpp>
// #else
// #include <omp.h>
#endif

using namespace std;

#define DUMPOUT cerr
#define dump(...)                                                              \\
  DUMPOUT << "  ";                                                             \\
  DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]"   \\
          << endl;                                                             \\
  DUMPOUT << "    ";                                                           \\
  dump_func(__VA_ARGS__)

using uint = unsigned;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using pss = pair<string, string>;
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const pair<_KTy, _Ty> &m) {
  o << "{" << m.first << ", " << m.second << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const unordered_map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const vector<_Ty> &v) {
  if (v.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << v.front();
  for (auto itr = ++v.begin(); itr != v.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const deque<_Ty> &v) {
  if (v.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << v.front();
  for (auto itr = ++v.begin(); itr != v.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty>
ostream &operator<<(ostream &o, const unordered_set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const stack<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  stack<_Ty> t(s);
  o << "{" << t.top();
  t.pop();
  while (!t.empty()) {
    o << ", " << t.top();
    t.pop();
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const list<_Ty> &l) {
  if (l.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << l.front();
  for (auto itr = ++l.begin(); itr != l.end(); ++itr) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
istream &operator>>(istream &is, pair<_KTy, _Ty> &m) {
  is >> m.first >> m.second;
  return is;
}
template <typename _Ty> istream &operator>>(istream &is, vector<_Ty> &v) {
  for (size_t t = 0; t < v.size(); t++)
    is >> v[t];
  return is;
}
template <typename _Ty> istream &operator>>(istream &is, deque<_Ty> &v) {
  for (size_t t = 0; t < v.size(); t++)
    is >> v[t];
  return is;
}
namespace aux { // print tuple
template <typename Ty, unsigned N, unsigned L> struct tp {
  static void print(ostream &os, const Ty &v) {
    os << get<N>(v) << ", ";
    tp<Ty, N + 1, L>::print(os, v);
  }
};
template <typename Ty, unsigned N> struct tp<Ty, N, N> {
  static void print(ostream &os, const Ty &v) { os << get<N>(v); }
};
} // namespace aux

template <typename... Tys>
ostream &operator<<(ostream &os, const tuple<Tys...> &t) {
  os << "{";
  aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t);
  os << "}";
  return os;
}

template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) == 0) {
    DUMPOUT << " ";
  } else {
    DUMPOUT << ", ";
  }
  dump_func(move(tail)...);
}

#define PI 3.14159265358979323846
#define EPS 1e-8
#define rep(t, n) for (int t = 0; t < (n); ++t)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false

class Timer {
public:
  double t = 0;
  Timer() {}
  static double time() {
#ifdef _MSC_VER
    return __rdtsc() / 2.8e9;
#else
    unsigned long long a, d;
    __asm__ volatile("rdtsc" : "=a"(a), "=d"(d));
    return (d << 32 | a) / 2.8e9;
#endif
  }
  void measure() { t = time() - t; }
  double elapsedMs() { return (time() - t) * 1000.0; }
} timer;

struct Xorshift {
  uint64_t x = 88172645463325252LL;
  unsigned next_int() {
    x = x ^ (x << 7);
    return x = x ^ (x >> 9);
  }
  unsigned next_int(unsigned mod) {
    x = x ^ (x << 7);
    x = x ^ (x >> 9);
    return x % mod;
  }
  unsigned next_int(unsigned l, unsigned r) {
    x = x ^ (x << 7);
    x = x ^ (x >> 9);
    return x % (r - l + 1) + l;
  }
  double next_double() { return double(next_int()) / UINT_MAX; }
} rnd;

template <typename T> void shuffle_vector(vector<T> &v, Xorshift &rnd) {
  int n = v.size();
  for (int i = n - 1; i >= 1; i--) {
    int r = rnd.next_int(i);
    swap(v[i], v[r]);
  }
}

template <typename T = int> T ipow(T x, T n) {
  T ret = 1;
  for (T i = 0; i < n; i++)
    ret *= x;
  return ret;
}

template <typename T> T BinarySearch(T ng, T ok, T t) {
  while (abs(ok - ng) > 1) {
    T mid = (ng + ok) / 2;
    (ipow(mid, 5LL) >= t ? ok : ng) = mid;
  }
  return ok;
}

int main() {
  timer.measure();

  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  ll X;
  cin >> X;

  map<ll, pll> mp;
  for (ll a = 1; a * a * a * a <= 1000000000LL; a++) {
    for (ll b = 1; b < a && a * a * a * a + a * a * a * b + a * a * b * b +
                                    a * b * b * b + b * b * b * b <=
                                1000000000LL;
         b++) {
      ll x = a * a * a * a + a * a * a * b + a * a * b * b + a * b * b * b +
             b * b * b * b;
      mp[x] = {a, b};
    }
  }

  // A>0, B<0
  ll A5, B5;
  for (ll A = 0; (A5 = A * A * A * A * A) <= X; A++) {
    for (ll B = 0; A5 + (B5 = B * B * B * B * B) <= X; B++) {
      if (A5 + B5 == X) {
        cout << A << " " << -B << endl;
        return 0;
      }
    }
  }

  for (const auto &e : mp) {
    ll d = e.first;
    const auto &ab = e.second;
    if ((ab.first - ab.second) * d == X) {
      cout << ab.first << " " << ab.second << endl;
    }
  }

  return 0;
}


Error: TLE

Fixed submission:

// #define NDEBUG
#include "bits/stdc++.h"
#include <array>
#include <iostream>
#include <random>
#include <string>
#include <unordered_map>
#include <unordered_set>
#ifdef _MSC_VER
#include <ppl.h>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// #include <boost/rational.hpp>
// #include <opencv2/core.hpp>
// #include <opencv2/imgproc.hpp>
// #include <opencv2/highgui.hpp>
// #else
// #include <omp.h>
#endif

using namespace std;

#define DUMPOUT cerr
#define dump(...)                                                              \\
  DUMPOUT << "  ";                                                             \\
  DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]"   \\
          << endl;                                                             \\
  DUMPOUT << "    ";                                                           \\
  dump_func(__VA_ARGS__)

using uint = unsigned;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using pss = pair<string, string>;
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const pair<_KTy, _Ty> &m) {
  o << "{" << m.first << ", " << m.second << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
ostream &operator<<(ostream &o, const unordered_map<_KTy, _Ty> &m) {
  if (m.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const vector<_Ty> &v) {
  if (v.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << v.front();
  for (auto itr = ++v.begin(); itr != v.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const deque<_Ty> &v) {
  if (v.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << v.front();
  for (auto itr = ++v.begin(); itr != v.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty>
ostream &operator<<(ostream &o, const unordered_set<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const stack<_Ty> &s) {
  if (s.empty()) {
    o << "{ }";
    return o;
  }
  stack<_Ty> t(s);
  o << "{" << t.top();
  t.pop();
  while (!t.empty()) {
    o << ", " << t.top();
    t.pop();
  }
  o << "}";
  return o;
}
template <typename _Ty> ostream &operator<<(ostream &o, const list<_Ty> &l) {
  if (l.empty()) {
    o << "{ }";
    return o;
  }
  o << "{" << l.front();
  for (auto itr = ++l.begin(); itr != l.end(); ++itr) {
    o << ", " << *itr;
  }
  o << "}";
  return o;
}
template <typename _KTy, typename _Ty>
istream &operator>>(istream &is, pair<_KTy, _Ty> &m) {
  is >> m.first >> m.second;
  return is;
}
template <typename _Ty> istream &operator>>(istream &is, vector<_Ty> &v) {
  for (size_t t = 0; t < v.size(); t++)
    is >> v[t];
  return is;
}
template <typename _Ty> istream &operator>>(istream &is, deque<_Ty> &v) {
  for (size_t t = 0; t < v.size(); t++)
    is >> v[t];
  return is;
}
namespace aux { // print tuple
template <typename Ty, unsigned N, unsigned L> struct tp {
  static void print(ostream &os, const Ty &v) {
    os << get<N>(v) << ", ";
    tp<Ty, N + 1, L>::print(os, v);
  }
};
template <typename Ty, unsigned N> struct tp<Ty, N, N> {
  static void print(ostream &os, const Ty &v) { os << get<N>(v); }
};
} // namespace aux

template <typename... Tys>
ostream &operator<<(ostream &os, const tuple<Tys...> &t) {
  os << "{";
  aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t);
  os << "}";
  return os;
}

template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T &val) {
  fill((T *)array, (T *)(array + N), val);
}

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
  DUMPOUT << head;
  if (sizeof...(Tail) == 0) {
    DUMPOUT << " ";
  } else {
    DUMPOUT << ", ";
  }
  dump_func(move(tail)...);
}

#define PI 3.14159265358979323846
#define EPS 1e-8
#define rep(t, n) for (int t = 0; t < (n); ++t)
#define all(j) (j).begin(), (j).end()
#define SZ(j) ((int)(j).size())
#define fake false

class Timer {
public:
  double t = 0;
  Timer() {}
  static double time() {
#ifdef _MSC_VER
    return __rdtsc() / 2.8e9;
#else
    unsigned long long a, d;
    __asm__ volatile("rdtsc" : "=a"(a), "=d"(d));
    return (d << 32 | a) / 2.8e9;
#endif
  }
  void measure() { t = time() - t; }
  double elapsedMs() { return (time() - t) * 1000.0; }
} timer;

struct Xorshift {
  uint64_t x = 88172645463325252LL;
  unsigned next_int() {
    x = x ^ (x << 7);
    return x = x ^ (x >> 9);
  }
  unsigned next_int(unsigned mod) {
    x = x ^ (x << 7);
    x = x ^ (x >> 9);
    return x % mod;
  }
  unsigned next_int(unsigned l, unsigned r) {
    x = x ^ (x << 7);
    x = x ^ (x >> 9);
    return x % (r - l + 1) + l;
  }
  double next_double() { return double(next_int()) / UINT_MAX; }
} rnd;

template <typename T> void shuffle_vector(vector<T> &v, Xorshift &rnd) {
  int n = v.size();
  for (int i = n - 1; i >= 1; i--) {
    int r = rnd.next_int(i);
    swap(v[i], v[r]);
  }
}

template <typename T = int> T ipow(T x, T n) {
  T ret = 1;
  for (T i = 0; i < n; i++)
    ret *= x;
  return ret;
}

template <typename T> T BinarySearch(T ng, T ok, T t) {
  while (abs(ok - ng) > 1) {
    T mid = (ng + ok) / 2;
    (ipow(mid, 5LL) >= t ? ok : ng) = mid;
  }
  return ok;
}

int main() {
  timer.measure();

  std::ios::sync_with_stdio(false);
  std::cin.tie(0);

  ll x;
  for (x = 0;; x++) {
    ll k = x * x * x * x * 5 + x * x * x * 10 + x * x * 10 + x * 5 + 1;
    if (k > 1000000000LL)
      break;
  }
  dump(x);

  ll X;
  cin >> X;

  // A>0, B<0
  ll A5;
  for (ll A = 0; (A5 = A * A * A * A * A) <= X; A++) {
    ll T = X - A5, B5;
    for (ll B = 0; (B5 = B * B * B * B * B) <= T; B++) {
      if (B == T) {
        cout << A << " " << -B << endl;
        return 0;
      }
    }
  }

  for (ll B = 0;; B++) {
    ll B5 = B * B * B * B * B;
    for (ll A = B + 1; A * A * A * A * A - B5 <= X; A++) {
      ll A5 = A * A * A * A * A;
      if (A5 - B5 == X) {
        cout << A << " " << B << endl;
        return 0;
      }
    }
  }

  return 0;
}