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

#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define _start                                                                 \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(NULL);                                                               \\
  cout.tie(NULL);
#define pb push_back
#define ss second
#define ff first
#define ll long long
#define int long long
#define mk make_pair
#define ld long double
#define vi vector<int>
#define pi pair<int, int>
#define mod 1000000007
#define pqg priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define forn(n) for (int i = 0; i < n; i++)
#define w(t)                                                                   \\
  int t;                                                                       \\
  cin >> t;                                                                    \\
  while (t--)
#define kick(t)                                                                \\
  int t;                                                                       \\
  cin >> t;                                                                    \\
  for (int p = 0; p < t; p++)
// typedef tree<ll, null_type, less<ll>, rb_tree_tag,
// tree_order_statistics_node_update> oset;
ll powmod(ll base, ll exp, ll MOD = mod) {
  ll res = 1;
  while (exp > 0) {
    if (exp % 2 == 1)
      res = (res * base) % MOD;
    base = (base * base) % MOD;
    exp /= 2;
  }
  return (res % MOD);
}
ll mul_inv(ll a, ll b = mod) {
  ll t1 = a, t2 = b, t3, v1 = 1, v2 = 0, v3;
  while (t2 != 1) {
    ll x = t1 / t2;
    t3 = t1 - x * t2;
    v3 = v1 - x * v2;
    t1 = t2, t2 = t3;
    v1 = v2, v2 = v3;
  }
  return (v2 + b) % b;
}

int32_t main() {
  _start

      int x,
      k, d;
  cin >> x >> k >> d;

  x = abs(x);
  int temp = x / d;
  if (temp >= k) {
    x -= (k * d);
    k = 0;
  } else {
    x -= (temp * d);
    k -= temp;
  }
  if (!k)
    cout << x << endl;
  else {
    if (k % 2 == 0) {
      cout << x << endl;
    } else {
      cout << min(x + d, abs(x - d)) << endl;
    }
  }
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
#define _start                                                                 \\
  ios_base::sync_with_stdio(false);                                            \\
  cin.tie(NULL);                                                               \\
  cout.tie(NULL);
#define pb push_back
#define ss second
#define ff first
#define ll long long
#define int long long
#define mk make_pair
#define ld long double
#define vi vector<int>
#define pi pair<int, int>
#define mod 1000000007
#define pqg priority_queue<int>
#define pqs priority_queue<int, vi, greater<int>>
#define forn(n) for (int i = 0; i < n; i++)
#define w(t)                                                                   \\
  int t;                                                                       \\
  cin >> t;                                                                    \\
  while (t--)
#define kick(t)                                                                \\
  int t;                                                                       \\
  cin >> t;                                                                    \\
  for (int p = 0; p < t; p++)
// typedef tree<ll, null_type, less<ll>, rb_tree_tag,
// tree_order_statistics_node_update> oset;
ll powmod(ll base, ll exp, ll MOD = mod) {
  ll res = 1;
  while (exp > 0) {
    if (exp % 2 == 1)
      res = (res * base) % MOD;
    base = (base * base) % MOD;
    exp /= 2;
  }
  return (res % MOD);
}
ll mul_inv(ll a, ll b = mod) {
  ll t1 = a, t2 = b, t3, v1 = 1, v2 = 0, v3;
  while (t2 != 1) {
    ll x = t1 / t2;
    t3 = t1 - x * t2;
    v3 = v1 - x * v2;
    t1 = t2, t2 = t3;
    v1 = v2, v2 = v3;
  }
  return (v2 + b) % b;
}

int32_t main() {
  _start

      int x,
      k, d;
  cin >> x >> k >> d;

  x = abs(x);

  while (x - d >= 0 && k) {
    x -= d;
    k--;
  }
  if (!k)
    cout << x << endl;
  else {
    if (k % 2 == 0) {
      cout << x << endl;
    } else {
      cout << min(x + d, abs(x - d)) << endl;
    }
  }
}