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

/// Bismillahir Rahmanir Rahim
// Author: Tanvir Hussain
// ICE,NSTU
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
const long long MOD = 1000000007;
#define SET(x) memset(x, 0, sizeof(x))
#define SET2d(x, m, n) memset(x, 0, sizeof(x[0][0]) * m * n)
#define SETBOOL(x) memset(x, false, sizeof(x))
#define CLR(x) memset(x, -1, sizeof(x))
#define CLR2d(x, m, n) memset(x, -1, sizeof(x[0][0]) * m * n)
#define mp make_pair
#define PII pair<int, int>
#define pf printf
#define sf scanf
#define ALL(x) x.begin(), x.end()
#define pb push_back
#define IOS                                                                    \\
  ios::sync_with_stdio(false);                                                 \\
  cin.tie(0);
#define np std::string::npos
#define highest(x) numeric_limits<x>::max()
#define lowest(x) numeric_limits<x>::min()
#define Inf INFINITY
#define minv(v) *min_element(v.begin(), v.end())
#define maxv(v) *max_element(v.begin(), v.end())
#define cases(cs, t) for (int cs = 1; cs <= t; cs++)
#define PI acos(-1)
#define no1 __builtin_popcount
#define BOUNDARY(i, j) ((i >= 0 && i < row) && (j >= 0 && j < column))
#define uniq(vec)                                                              \\
  vec.resize(distance(vec.begin(), unique(vec.begin(), vec.end())))
#define ordered_set                                                            \\
  tree<int, null_type, less<int>, rb_tree_tag,                                 \\
       tree_order_statistics_node_update>
#define sz(a) int(a.size())
#define ff first
#define ss second
#define endl "\\n"
#define forch(it, s) for (auto it : s)
#define each(it, s) for (auto it = s.begin(); it != s.end(); ++it)
#define rep(i, a) for (int i = 0; i < a; i++)
#define rep1(i, a, b) for (int i = (a); i <= (b); ++i)
#define irep(i, b, a) for (int i = (b); i >= (a); --i)
#define bits(n) __builtin_popcount(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int>>

int gcd(int a, int b) {
  if (a == 0)
    return b;
  return gcd(b % a, a);
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_multiset;
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
const int maxx = 100005;

// this fuction sorts vector pair according to first element in descending
// order.
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
  return a.first > b.first;
}

template <typename T> inline T Bigmod(T base, T power, T MOD) {
  T ret = 1;
  while (power) {
    if (power & 1)
      ret = (ret * base) % MOD;
    base = (base * base) % MOD;
    power >>= 1;
  }
  return ret;
}
ll sq(ll x) { return x * x; }
ll po(ll b, ll p) {
  ll res = 1;
  while (p) {
    res *= b;
    p--;
  }
  return res;
}
ll lg2(ll x) {
  ll res = 0;
  while (x > 1) {
    res++;
    x /= 2ll;
  }
  return res;
}
void solve() {
  int n;
  cin >> n;
  vi ans(1000006);
  rep1(x, 1, 100) {
    rep1(y, 1, 100) {
      rep1(z, 1, 100) {
        ans[(sq(x) + sq(y) + sq(z) + (x * y) + (y * z) + (z * x))]++;
      }
    }
  }
  rep1(i, 1, n) cout << ans[i] << endl;
}

signed main()

{
  IOS;
  /*#ifndef ONLINE_JUDGE
      freopen ("input.txt","r",stdin);
      freopen ("output.txt","w",stdout);
  #endif*/
  int t;
  t = 1;
  while (t--) {
    solve();
  }

  return 0;
}
/// Alhamdulillah


Error: TLE

Fixed submission:

/// Bismillahir Rahmanir Rahim
// Author: Tanvir Hussain
// ICE,NSTU
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
const long long MOD = 1000000007;
#define SET(x) memset(x, 0, sizeof(x))
#define SET2d(x, m, n) memset(x, 0, sizeof(x[0][0]) * m * n)
#define SETBOOL(x) memset(x, false, sizeof(x))
#define CLR(x) memset(x, -1, sizeof(x))
#define CLR2d(x, m, n) memset(x, -1, sizeof(x[0][0]) * m * n)
#define mp make_pair
#define PII pair<int, int>
#define pf printf
#define sf scanf
#define ALL(x) x.begin(), x.end()
#define pb push_back
#define IOS                                                                    \\
  ios::sync_with_stdio(false);                                                 \\
  cin.tie(0);
#define np std::string::npos
#define highest(x) numeric_limits<x>::max()
#define lowest(x) numeric_limits<x>::min()
#define Inf INFINITY
#define minv(v) *min_element(v.begin(), v.end())
#define maxv(v) *max_element(v.begin(), v.end())
#define cases(cs, t) for (int cs = 1; cs <= t; cs++)
#define PI acos(-1)
#define no1 __builtin_popcount
#define BOUNDARY(i, j) ((i >= 0 && i < row) && (j >= 0 && j < column))
#define uniq(vec)                                                              \\
  vec.resize(distance(vec.begin(), unique(vec.begin(), vec.end())))
#define ordered_set                                                            \\
  tree<int, null_type, less<int>, rb_tree_tag,                                 \\
       tree_order_statistics_node_update>
#define sz(a) int(a.size())
#define ff first
#define ss second
#define endl "\\n"
#define forch(it, s) for (auto it : s)
#define each(it, s) for (auto it = s.begin(); it != s.end(); ++it)
#define rep(i, a) for (int i = 0; i < a; i++)
#define rep1(i, a, b) for (int i = (a); i <= (b); ++i)
#define irep(i, b, a) for (int i = (b); i >= (a); --i)
#define bits(n) __builtin_popcount(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int>>

int gcd(int a, int b) {
  if (a == 0)
    return b;
  return gcd(b % a, a);
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpii;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_multiset;
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, 1, -1, 0, 0, -1, 1};
int dx4[] = {0, 0, 1, -1};
int dy4[] = {1, -1, 0, 0};
const int maxx = 100005;

// this fuction sorts vector pair according to first element in descending
// order.
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
  return a.first > b.first;
}

template <typename T> inline T Bigmod(T base, T power, T MOD) {
  T ret = 1;
  while (power) {
    if (power & 1)
      ret = (ret * base) % MOD;
    base = (base * base) % MOD;
    power >>= 1;
  }
  return ret;
}
ll sq(ll x) { return x * x; }
ll po(ll b, ll p) {
  ll res = 1;
  while (p) {
    res *= b;
    p--;
  }
  return res;
}
ll lg2(ll x) {
  ll res = 0;
  while (x > 1) {
    res++;
    x /= 2ll;
  }
  return res;
}
void solve() {
  int n;
  cin >> n;
  vi ans(n + 1);
  rep1(i, 1, n) {
    int cnt = 0;
    int lim = 50;
    rep1(x, 1, lim) {
      rep1(y, 1, lim) {
        int lo = 1, high = lim;
        while (lo <= high) {
          int z = (lo + (high - lo) / 2);
          if ((sq(x) + sq(y) + sq(z) + (x * y) + (y * z) + (z * x)) == i) {
            cnt++;
            break;
          } else if ((sq(x) + sq(y) + sq(z) + (x * y) + (y * z) + (z * x)) <
                     i) {
            lo++;
          } else
            high--;
          // cout<<lo<<" "<<high<<endl;
        }
      }
    }
    ans[i] = cnt;
  }
  rep1(i, 1, n) cout << ans[i] << endl;
}

signed main()

{
  IOS;
  /*#ifndef ONLINE_JUDGE
      freopen ("input.txt","r",stdin);
      freopen ("output.txt","w",stdout);
  #endif*/
  int t;
  t = 1;
  while (t--) {
    solve();
  }

  return 0;
}
/// Alhamdulillah