Problem p03008 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...)                                                                \
  cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2,            \
                    pr1)(__VA_ARGS__)                                          \
       << endl
#define pr1(a) (#a) << "=" << (a) << " "
#define pr2(a, b) pr1(a) << pr1(b)
#define pr3(a, b, c) pr1(a) << pr2(b, c)
#define pr4(a, b, c, d) pr1(a) << pr3(b, c, d)
#define pr5(a, b, c, d, e) pr1(a) << pr4(b, c, d, e)
#define pr6(a, b, c, d, e, f) pr1(a) << pr5(b, c, d, e, f)
#define pr7(a, b, c, d, e, f, g) pr1(a) << pr6(b, c, d, e, f, g)
#define pr8(a, b, c, d, e, f, g, h) pr1(a) << pr7(b, c, d, e, f, g, h)
#define prArr(a)                                                               \
  {                                                                            \
    cerr << (#a) << "={";                                                      \
    int i = 0;                                                                 \
    for (auto t : (a))                                                         \
      cerr << (i++ ? ", " : "") << t;                                          \
    cerr << "}" << endl;                                                       \
  }
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL << 60) + 1e9; // ~ 1.15 * 1e18
const Int mod = (1e9) + 7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int, Int>;
template <class T> T Max(T &a, T b) { return a = max(a, b); }
template <class T> T Min(T &a, T b) { return a = min(a, b); }
template <class T1, class T2> ostream &operator<<(ostream &o, pair<T1, T2> p) {
  return o << "(" << p.first << "," << p.second << ")";
}
template <class T1, class T2, class T3>
ostream &operator<<(ostream &o, tuple<T1, T2, T3> t) {
  return o << "(" << get<0>(t) << "," << get<1>(t) << "," << get<2>(t) << ")";
}
template <class T1, class T2> istream &operator>>(istream &i, pair<T1, T2> &p) {
  return i >> p.first >> p.second;
}
template <class T> ostream &operator<<(ostream &o, vector<T> a) {
  Int i = 0;
  for (T t : a)
    o << (i++ ? " " : "") << t;
  return o;
}
template <class T> istream &operator>>(istream &i, vector<T> &a) {
  for (T &t : a)
    i >> t;
  return i;
}
// INSERT ABOVE HERE

vector<Int> A(3), B(3);

Int secondB(Int N) {

  Int res = N;
  for (int k = 0; k < 3; k++) {
    swap(A[0], A[2]), swap(A[0], A[1]);
    swap(B[0], B[2]), swap(B[0], B[1]);

    for (Int i = 0; i <= 10001; i++) {
      for (Int j = 0; j <= 10001; j++) {
        Int a = i;
        Int b = j;
        Int r = (N - (a * B[0] + b * B[1]));
        if (r < 0)
          break;
        Int c = r / B[2];
        Int t = r % B[2];
        Int M = a * A[0] + b * A[1] + max(c * A[2] + t, r);
        Max(res, M);
      }
    }
  }
  return res;
}

Int firstA(Int N) {
  for (Int i = 0; i < 3; i++)
    for (Int j = 2; j > 0; j--)
      if (A[j - 1] < A[j])
        swap(B[j], B[j - 1]), swap(A[j], A[j - 1]);

  Int res = N;
  for (Int i = 0; i <= N; i++) {
    for (Int j = 0; j <= N; j++) {
      Int a = i;
      Int b = j;
      Int r = (N - (a * A[0] + b * A[1]));
      Int c = r / A[2];
      Int t = r % A[2];
      if (r < 0)
        break;
      // assert(r >= 0);
      Int M = a * B[0] + b * B[1] + max(c * B[2] + t, r);
      Max(res, M);
    }
  }
  return secondB(res);
}

signed main() {
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);
  Int N;
  cin >> N;
  cin >> A >> B;

  Int ans = firstA(N);
  cout << ans << endl;
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...)                                                                \
  cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2,            \
                    pr1)(__VA_ARGS__)                                          \
       << endl
#define pr1(a) (#a) << "=" << (a) << " "
#define pr2(a, b) pr1(a) << pr1(b)
#define pr3(a, b, c) pr1(a) << pr2(b, c)
#define pr4(a, b, c, d) pr1(a) << pr3(b, c, d)
#define pr5(a, b, c, d, e) pr1(a) << pr4(b, c, d, e)
#define pr6(a, b, c, d, e, f) pr1(a) << pr5(b, c, d, e, f)
#define pr7(a, b, c, d, e, f, g) pr1(a) << pr6(b, c, d, e, f, g)
#define pr8(a, b, c, d, e, f, g, h) pr1(a) << pr7(b, c, d, e, f, g, h)
#define prArr(a)                                                               \
  {                                                                            \
    cerr << (#a) << "={";                                                      \
    int i = 0;                                                                 \
    for (auto t : (a))                                                         \
      cerr << (i++ ? ", " : "") << t;                                          \
    cerr << "}" << endl;                                                       \
  }
using namespace std;
using Int = long long;
using _int = int;
using ll = long long;
using Double = long double;
const Int INF = (1LL << 60) + 1e9; // ~ 1.15 * 1e18
const Int mod = (1e9) + 7;
const Double EPS = 1e-8;
const Double PI = 6.0 * asin((Double)0.5);
using P = pair<Int, Int>;
template <class T> T Max(T &a, T b) { return a = max(a, b); }
template <class T> T Min(T &a, T b) { return a = min(a, b); }
template <class T1, class T2> ostream &operator<<(ostream &o, pair<T1, T2> p) {
  return o << "(" << p.first << "," << p.second << ")";
}
template <class T1, class T2, class T3>
ostream &operator<<(ostream &o, tuple<T1, T2, T3> t) {
  return o << "(" << get<0>(t) << "," << get<1>(t) << "," << get<2>(t) << ")";
}
template <class T1, class T2> istream &operator>>(istream &i, pair<T1, T2> &p) {
  return i >> p.first >> p.second;
}
template <class T> ostream &operator<<(ostream &o, vector<T> a) {
  Int i = 0;
  for (T t : a)
    o << (i++ ? " " : "") << t;
  return o;
}
template <class T> istream &operator>>(istream &i, vector<T> &a) {
  for (T &t : a)
    i >> t;
  return i;
}
// INSERT ABOVE HERE

vector<Int> A(3), B(3);

Int secondB(Int N) {

  Int res = N;
  for (int k = 0; k < 3; k++) {
    swap(A[0], A[2]), swap(A[0], A[1]);
    swap(B[0], B[2]), swap(B[0], B[1]);

    for (Int i = 0; i <= 8001; i++) {
      for (Int j = 0; j <= 8001; j++) {
        Int a = i;
        Int b = j;
        Int r = (N - (a * B[0] + b * B[1]));
        if (r < 0)
          break;
        Int c = r / B[2];
        Int t = r % B[2];
        Int M = a * A[0] + b * A[1] + max(c * A[2] + t, r);
        Max(res, M);
      }
    }
  }
  return res;
}

Int firstA(Int N) {
  for (Int i = 0; i < 3; i++)
    for (Int j = 2; j > 0; j--)
      if (A[j - 1] < A[j])
        swap(B[j], B[j - 1]), swap(A[j], A[j - 1]);

  Int res = N;
  for (Int i = 0; i <= N; i++) {
    for (Int j = 0; j <= N; j++) {
      Int a = i;
      Int b = j;
      Int r = (N - (a * A[0] + b * A[1]));
      Int c = r / A[2];
      Int t = r % A[2];
      if (r < 0)
        break;
      // assert(r >= 0);
      Int M = a * B[0] + b * B[1] + max(c * B[2] + t, r);
      Max(res, M);
    }
  }
  return secondB(res);
}

signed main() {
  srand((unsigned)time(NULL));
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  cout << fixed << setprecision(12);
  Int N;
  cin >> N;
  cin >> A >> B;

  Int ans = firstA(N);
  cout << ans << endl;
  return 0;
}