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

/*
___ is a raging sadist.
*/
// Destroy all WA at test 2
//  Stay cool
//  Pass the 4th wall..

#include <bits/stdc++.h>
#define fastio()                                                               \\
  ios_base::sync_with_stdio(0);                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0)
#define pb push_back
#define show(x) cout << (#x) << " : " << x << endl;
#define ll long long
#define ld long double
#define pow power
#define mp make_pair
#define ff first
#define ss second
#define pii pair<ll, ll>
#define sq(x) ((x) * (x))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define siz(a) int((a).size())
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define endl "\\n"
#define pi 3.14159265
const ll mod = 1000 * 1000 * 1000 + 7;
const ll mod1 = 998244353;
const ll INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
using namespace std;

ll power(ll x, ll y) {
  ll res = 1;

  while (y > 0) {

    if (y & 1)
      res = (long long)(res * x);

    y = y >> 1;

    if (x <= 100000000)
      x = (long long)(x * x);

    // cout<<x<<'\\n';
  }
  return res;
}

ll x[200005];
ll y[200005];

int main() {

#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif

  fastio();

  ll n, d;
  cin >> n >> d;

  For(i, 0, n) cin >> x[i] >> y[i];

  ll cnt = 0;

  d = d * d;

  For(i, 0, n) {
    ll now = x[i] * x[i] + y[i] * y[i];

    if (now <= d)
      cnt += 1;
  }

  cout << cnt;

  return 0;
}

Error: TLE

Fixed submission:

/*
___ is a raging sadist.
*/
// Destroy all WA at test 2
//  Stay cool
//  Pass the 4th wall..

#include <bits/stdc++.h>
#define fastio()                                                               \\
  ios_base::sync_with_stdio(0);                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0)
#define pb push_back
#define show(x) cout << (#x) << " : " << x << endl;
#define ll long long
#define ld long double
#define pow power
#define mp make_pair
#define ff first
#define ss second
#define pii pair<ll, ll>
#define sq(x) ((x) * (x))
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define siz(a) int((a).size())
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define endl "\\n"
#define pi 3.14159265
const ll mod = 1000 * 1000 * 1000 + 7;
const ll mod1 = 998244353;
const ll INF = 1ll * 1000 * 1000 * 1000 * 1000 * 1000 * 1000 + 7;
using namespace std;

ll power(ll x, ll y) {
  ll res = 1;

  while (y > 0) {

    if (y & 1)
      res = (long long)(res * x);

    y = y >> 1;

    if (x <= 100000000)
      x = (long long)(x * x);

    // cout<<x<<'\\n';
  }
  return res;
}

ll x[100005];
ll y[100005];

int main() {

#ifndef ONLINE_JUDGE
  freopen("input.txt", "r", stdin);
  freopen("output.txt", "w", stdout);
#endif

  fastio();

  ll n, d;
  cin >> n >> d;

  For(i, 0, n) cin >> x[i] >> y[i];

  ll cnt = 0;

  d = d * d;

  For(i, 0, n) {
    ll now = x[i] * x[i] + y[i] * y[i];

    if (now <= d)
      cnt += 1;
  }

  cout << cnt;

  return 0;
}