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

// is there any case of -1 or any special corner cases ?
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int>
#define pi pair<int, int>
#define all(v) v.begin(), v.end()
#define zeros(arr) memset(arr, 0, sizeof(arr));
#define precise(num)                                                           \\
  cout << fixed;                                                               \\
  cout << std::setprecision(num)
#define nl cout << "\\n";
#define test                                                                   \\
  int t;                                                                       \\
  cin >> t;                                                                    \\
  wahile(t--)
const int maxx = 3 * 1e5, limit = 1e17, MOD = 1e9 + 7;
string binary(int n) {
  bitset<32> b(n);
  string p = b.to_string();
  return p;
}
int decimal(string s) {
  int res = 0;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '1')
      res = res + pow(2, s.size() - i - 1);
  }
  return res;
}
bool isPrime(int n) {
  if (n <= 1)
    return false;
  if (n <= 3)
    return true;
  if (n % 2 == 0 || n % 3 == 0)
    return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0)
      return false;
  return true;
}
int pow(int x, int n, int mod) {
  if (n == 0)
    return 1;
  int res = pow(x, n / 2, mod);
  res = (res * res) % mod;
  if (n % 2)
    res = (res * x) % mod;
  return res;
}
#define boost                                                                  \\
  ios_base::sync_with_stdio(0);                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
int32_t main() {
  boost;
  int ta, tb;
  int sa, sb;
  cin >> ta >> tb >> sa >> sb;
  int i = 0;
  while (ta > 0 && sa > 0) {

    i++;
    if (i % 2) {
      sa = sa - tb;
    } else {
      ta = ta - sb;
    }
  }
  if (ta > 0) {
    cout << "Yes\\n";
  } else
    cout << "No\\n";
}

Error: TLE

Fixed submission:

// is there any case of -1 or any special corner cases ?
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int>
#define pi pair<int, int>
#define all(v) v.begin(), v.end()
#define zeros(arr) memset(arr, 0, sizeof(arr));
#define precise(num)                                                           \\
  cout << fixed;                                                               \\
  cout << std::setprecision(num)
#define nl cout << "\\n";
#define test                                                                   \\
  int t;                                                                       \\
  cin >> t;                                                                    \\
  wahile(t--)
const int maxx = 3 * 1e5, limit = 1e17, MOD = 1e9 + 7;
string binary(int n) {
  bitset<32> b(n);
  string p = b.to_string();
  return p;
}
int decimal(string s) {
  int res = 0;
  for (int i = 0; i < s.size(); i++) {
    if (s[i] == '1')
      res = res + pow(2, s.size() - i - 1);
  }
  return res;
}
bool isPrime(int n) {
  if (n <= 1)
    return false;
  if (n <= 3)
    return true;
  if (n % 2 == 0 || n % 3 == 0)
    return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0)
      return false;
  return true;
}
int pow(int x, int n, int mod) {
  if (n == 0)
    return 1;
  int res = pow(x, n / 2, mod);
  res = (res * res) % mod;
  if (n % 2)
    res = (res * x) % mod;
  return res;
}
#define boost                                                                  \\
  ios_base::sync_with_stdio(0);                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0);
int32_t main() {
  boost;
  int ta, tb;
  int sa, sb;
  cin >> ta >> tb >> sa >> sb;
  int i = 0;
  while (ta && sa) {

    i++;
    if (i % 2) {
      sa = sa - tb;
    } else {
      ta = ta - sb;
    }
  }
  if (ta) {
    cout << "Yes\\n";
  } else
    cout << "No\\n";
}