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

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <vector>

const double TL = 3; // seconds
inline bool isTimeLimit() {
  static int is = 0, cnt = 0;
  if (++cnt == 1000) { // каждый раз вызывать clock() - слишком долго
    cnt = 0;
    is |= clock() >
          (TL - 0.1) * CLOCKS_PER_SEC; // время работы с запуска программы
  }
  return is;
}

#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define M_PI 3.14159265358979323846

using namespace std;
using ll = int64_t;
using ld = long double;
using ull = uint64_t;
using pi = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define n_l '\\n'
#define dbg(...)                                                               \\
  cout << "[" << #__VA_ARGS__ << "]: ";                                        \\
  cout << to_string(__VA_ARGS__) << endl

template <typename T, size_t N> int SIZE(const T (&t)[N]) { return N; }

template <typename T> int SIZE(const T &t) { return t.size(); }

string to_string(const string s, int x1 = 0, int x2 = 1e9) {
  return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}

string to_string(const char *s) { return to_string((string)s); }

string to_string(const bool b) { return (b ? "true" : "false"); }

string to_string(const char c) { return string({c}); }

template <size_t N>
string to_string(const bitset<N> &b, int x1 = 0, int x2 = 1e9) {
  string t = "";
  for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);
       __iii__ <= __jjj__; ++__iii__) {
    t += b[__iii__] + '0';
  }
  return '"' + t + '"';
}

template <typename A, typename... C>
string to_string(const A(&v), int x1 = 0, int x2 = 1e9, C... coords);

int l_v_l_v_l = 0, t_a_b_s = 0;

template <typename A, typename B> string to_string(const pair<A, B> &p) {
  l_v_l_v_l++;
  string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
  l_v_l_v_l--;
  return res;
}

template <typename A, typename... C>
string to_string(const A(&v), int x1, int x2, C... coords) {
  int rnk = rank<A>::value;
  string tab(t_a_b_s, ' ');
  string res = "";
  bool first = true;
  if (l_v_l_v_l == 0)
    res += n_l;
  res += tab + "[";
  x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));
  auto l = begin(v);
  advance(l, x1);
  auto r = l;
  advance(r, (x2 - x1) + (x2 < SIZE(v)));
  for (auto e = l; e != r; e = next(e)) {
    if (!first) {
      res += ", ";
    }
    first = false;
    l_v_l_v_l++;
    if (e != l) {
      if (rnk > 1) {
        res += n_l;
        t_a_b_s = l_v_l_v_l;
      };
    } else {
      t_a_b_s = 0;
    }
    res += to_string(*e, coords...);
    l_v_l_v_l--;
  }
  res += "]";
  if (l_v_l_v_l == 0)
    res += n_l;
  return res;
}

void dbgm() { ; }

template <typename Heads, typename... Tails> void dbgm(Heads H, Tails... T) {
  cout << to_string(H) << " | ";
  dbgm(T...);
}

#define dbgm(...)                                                              \\
  cout << "[" << #__VA_ARGS__ << "]: ";                                        \\
  dbgm(__VA_ARGS__);                                                           \\
  cout << endl

ll n, steps, dir = 0;

int goes[180];

bool zero() {
  for (int i = 0; i < 180; i++) {
    if (goes[i])
      return false;
  }
  return true;
}

int solve(ll n) { return 360 / gcd(n, 360); }

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);

  cin >> n;
  cout << solve(n) << endl;
}


Error: TLE

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <vector>

const double TL = 3; // seconds
inline bool isTimeLimit() {
  static int is = 0, cnt = 0;
  if (++cnt == 1000) { // каждый раз вызывать clock() - слишком долго
    cnt = 0;
    is |= clock() >
          (TL - 0.1) * CLOCKS_PER_SEC; // время работы с запуска программы
  }
  return is;
}

#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fi first
#define se second
#define M_PI 3.14159265358979323846

using namespace std;
using ll = int64_t;
using ld = long double;
using ull = uint64_t;
using pi = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define n_l '\\n'
#define dbg(...)                                                               \\
  cout << "[" << #__VA_ARGS__ << "]: ";                                        \\
  cout << to_string(__VA_ARGS__) << endl

template <typename T, size_t N> int SIZE(const T (&t)[N]) { return N; }

template <typename T> int SIZE(const T &t) { return t.size(); }

string to_string(const string s, int x1 = 0, int x2 = 1e9) {
  return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}

string to_string(const char *s) { return to_string((string)s); }

string to_string(const bool b) { return (b ? "true" : "false"); }

string to_string(const char c) { return string({c}); }

template <size_t N>
string to_string(const bitset<N> &b, int x1 = 0, int x2 = 1e9) {
  string t = "";
  for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);
       __iii__ <= __jjj__; ++__iii__) {
    t += b[__iii__] + '0';
  }
  return '"' + t + '"';
}

template <typename A, typename... C>
string to_string(const A(&v), int x1 = 0, int x2 = 1e9, C... coords);

int l_v_l_v_l = 0, t_a_b_s = 0;

template <typename A, typename B> string to_string(const pair<A, B> &p) {
  l_v_l_v_l++;
  string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
  l_v_l_v_l--;
  return res;
}

template <typename A, typename... C>
string to_string(const A(&v), int x1, int x2, C... coords) {
  int rnk = rank<A>::value;
  string tab(t_a_b_s, ' ');
  string res = "";
  bool first = true;
  if (l_v_l_v_l == 0)
    res += n_l;
  res += tab + "[";
  x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));
  auto l = begin(v);
  advance(l, x1);
  auto r = l;
  advance(r, (x2 - x1) + (x2 < SIZE(v)));
  for (auto e = l; e != r; e = next(e)) {
    if (!first) {
      res += ", ";
    }
    first = false;
    l_v_l_v_l++;
    if (e != l) {
      if (rnk > 1) {
        res += n_l;
        t_a_b_s = l_v_l_v_l;
      };
    } else {
      t_a_b_s = 0;
    }
    res += to_string(*e, coords...);
    l_v_l_v_l--;
  }
  res += "]";
  if (l_v_l_v_l == 0)
    res += n_l;
  return res;
}

void dbgm() { ; }

template <typename Heads, typename... Tails> void dbgm(Heads H, Tails... T) {
  cout << to_string(H) << " | ";
  dbgm(T...);
}

#define dbgm(...)                                                              \\
  cout << "[" << #__VA_ARGS__ << "]: ";                                        \\
  dbgm(__VA_ARGS__);                                                           \\
  cout << endl

ll n, steps, dir = 0;

int goes[180];

bool zero() {
  for (int i = 0; i < 180; i++) {
    if (goes[i])
      return false;
  }
  return true;
}

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);

  cin >> n;

  goes[0]++;
  steps++;

  while (!zero()) {
    dir = (dir + n) % 360;
    if (dir < 180) {
      goes[dir]++;
    } else {
      goes[dir - 180]--;
    }
    steps++;
  }

  cout << steps << endl;
}