Problem p02690 (C++) — buggy submission, verdict: Runtime Error

#include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>

#define INF 1000000007 // 1000000000000000003
#define MOD 1000000007
#define MAX 2000005

#define ll long long

// printf("%.10f", );
// cout << fixed << setprecision(10) << heikin << endl;
// vector<vector<int>> data(3, vector<int>(4, -1));
// left + 1 < top

using namespace std;
using P = pair<int, int>;
using Pc = pair<double, int>;
using T = tuple<int, int, int>;
using edge = struct {
  int to;
  long long dist;
};
const double PI = 3.1415;
long long fact[MAX], inv[MAX];
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};

//////////////////////////////////

vector<vector<int>> bingo(3, vector<int>(3));
vector<vector<int>> tree(100005);
int color[100005];
map<P, int> colorMap;
int m = 0;

struct BridgeInfo {
  int town1;
  int town2;
  int year;
  BridgeInfo(int t1, int t2, int y) {
    town1 = t1;
    town2 = t2;
    year = y;
  }
};

bool compare_by_second(pair<int, int> a, pair<int, int> b) {
  if (a.second != b.second) {
    return a.second < b.second;
  } else {
    return a.first < b.first;
  }
}

struct UnionFind {
  vector<int> uf;

  UnionFind(int size) : uf(size, -1){};

  int root(int target) {
    if (uf[target] < 0)
      return target;
    else
      return uf[target] = root(uf[target]);
  }

  void merge(int a, int b) {
    a = root(a);
    b = root(b);
    if (a == b)
      return;
    if (uf[b] < uf[a])
      swap(a, b);
    uf[a] += uf[b];
    uf[b] = a;
  }
};

ll CalcPow(ll num, ll power) {
  if (power == 0)
    return 1;
  if (power % 2 == 0) {
    ll half = CalcPow(num, power / 2);
    return (half * half) % MOD;
  } else
    return (num * CalcPow(num, power - 1)) % MOD;
}

ll combination(ll all, ll select) {
  if (all < select)
    return 0;
  if (all < 0 || select < 0)
    return 0;
  return fact[all] * (inv[select] * inv[all - select] % MOD) % MOD;
}

void initCombination(int max) {
  fact[0] = fact[1] = 1;
  for (int i = 2; i <= max; ++i) {
    fact[i] = fact[i - 1] * i % MOD;
  }

  inv[max] = CalcPow(fact[max], MOD - 2);
  for (int i = max - 1; 0 <= i; --i) {
    inv[i] = (inv[i + 1] * (i + 1)) % MOD;
  }
}

ll getGcd(ll a, ll b) {
  if (a < b) {
    ll temp = b;
    b = a;
    a = temp;
  }

  ll r;
  while ((r = a % b) != 0) {
    a = b;
    b = r;
  }
  return b;
}

ll line[155];

int getNum(ll target) {

  int bottom = 0;
  int top = 151;
  while (1 < top - bottom) {
    int middle = (top + bottom) / 2;
    if (target < line[middle])
      top = middle;
    else
      bottom = middle;
  }
  return bottom;
}

int main() {

  for (ll i = 0; i <= 150; ++i) {
    line[i] = i * i * i * i * i;
  }

  ll X;
  cin >> X;
  for (ll i = 0; i <= 150; ++i) {
    bool isMinus = false;
    ll nokori = X - line[i];
    if (nokori < 0) {
      isMinus = true;
      nokori *= (-1);
    }
    int num = getNum(nokori);
    if (line[num] == nokori) {
      // 成功
      if (isMinus) {
        cout << i << " " << ((ll)num) << endl;
      } else {
        cout << i << " " << -((ll)num) << endl;
      }
      return 0;
    }
  }
}


Error: 0

Fixed submission:

#include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>

#define INF 1000000007 // 1000000000000000003
#define MOD 1000000007
#define MAX 2000005

#define ll long long

// printf("%.10f", );
// cout << fixed << setprecision(10) << heikin << endl;
// vector<vector<int>> data(3, vector<int>(4, -1));
// left + 1 < top

using namespace std;
using P = pair<int, int>;
using Pc = pair<double, int>;
using T = tuple<int, int, int>;
using edge = struct {
  int to;
  long long dist;
};
const double PI = 3.1415;
long long fact[MAX], inv[MAX];
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};

//////////////////////////////////

vector<vector<int>> bingo(3, vector<int>(3));
vector<vector<int>> tree(100005);
int color[100005];
map<P, int> colorMap;
int m = 0;

struct BridgeInfo {
  int town1;
  int town2;
  int year;
  BridgeInfo(int t1, int t2, int y) {
    town1 = t1;
    town2 = t2;
    year = y;
  }
};

bool compare_by_second(pair<int, int> a, pair<int, int> b) {
  if (a.second != b.second) {
    return a.second < b.second;
  } else {
    return a.first < b.first;
  }
}

struct UnionFind {
  vector<int> uf;

  UnionFind(int size) : uf(size, -1){};

  int root(int target) {
    if (uf[target] < 0)
      return target;
    else
      return uf[target] = root(uf[target]);
  }

  void merge(int a, int b) {
    a = root(a);
    b = root(b);
    if (a == b)
      return;
    if (uf[b] < uf[a])
      swap(a, b);
    uf[a] += uf[b];
    uf[b] = a;
  }
};

ll CalcPow(ll num, ll power) {
  if (power == 0)
    return 1;
  if (power % 2 == 0) {
    ll half = CalcPow(num, power / 2);
    return (half * half) % MOD;
  } else
    return (num * CalcPow(num, power - 1)) % MOD;
}

ll combination(ll all, ll select) {
  if (all < select)
    return 0;
  if (all < 0 || select < 0)
    return 0;
  return fact[all] * (inv[select] * inv[all - select] % MOD) % MOD;
}

void initCombination(int max) {
  fact[0] = fact[1] = 1;
  for (int i = 2; i <= max; ++i) {
    fact[i] = fact[i - 1] * i % MOD;
  }

  inv[max] = CalcPow(fact[max], MOD - 2);
  for (int i = max - 1; 0 <= i; --i) {
    inv[i] = (inv[i + 1] * (i + 1)) % MOD;
  }
}

ll getGcd(ll a, ll b) {
  if (a < b) {
    ll temp = b;
    b = a;
    a = temp;
  }

  ll r;
  while ((r = a % b) != 0) {
    a = b;
    b = r;
  }
  return b;
}

ll line[1005];

ll getNum(ll target) {

  int bottom = 0;
  int top = 1001;
  while (1 < top - bottom) {
    int middle = (top + bottom) / 2;
    if (target < line[middle])
      top = middle;
    else
      bottom = middle;
  }
  return line[bottom];
}

int main() {

  for (ll i = 0; i <= 1000; ++i) {
    line[i] = i * i * i * i * i;
  }

  ll X;
  cin >> X;
  for (ll i = 0; i <= 1000; ++i) {
    bool isMinus = false;
    ll nokori = X - line[i];
    if (nokori < 0) {
      isMinus = true;
      nokori *= (-1);
    }
    ll num = getNum(nokori);
    if (line[num] == nokori) {
      // 成功
      if (isMinus) {
        cout << i << " " << ((ll)num) << endl;
      } else {
        cout << i << " " << -((ll)num) << endl;
      }
      return 0;
    }
  }
}