Problem p03008 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

#define int ll

typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef vector<piii> vpii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define mp(a, b) make_pair(a, (b))
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for (int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cout << (#x) << " = " << x << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr                                                                   \
  if (false)                                                                   \
  cerr
#endif

void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  err(++it, args...);
}

const double PI = 2 * acos(0.0);

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

istream &operator>>(istream &in, pii &a) {
  in >> a.first >> a.second;
  return in;
}

ostream &operator<<(ostream &out, pii &a) {
  out << a.first << ' ' << a.second;
  return out;
}

template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
  return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << ", " << get<3>(a) << "}";
}

template <class T> inline ostream &operator<<(ostream &out, vector<T> &a) {
  out << "[";
  fori(i, a.size()) out << a[i]
                        << vector<string>{", ", "]  "}[i + 1 == a.size()];
  return out;
}

void smain();

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);

#ifdef ART_HOME
  freopen("input.txt", "r", stdin);
  clock_t start = clock();
#endif
  cout << setprecision(0) << fixed;
  smain();
#ifdef ART_HOME
  cout << "\n\n\n\nTOTAL EXECUTION TIME: "
       << float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
}

const int N = 1 << 17, psze = 20, oo = 1e9 + 100, B = 100, M = 1e9 + 6;
const ld pi = 2 * atan2(1, 0), EPS = 1e-9;

int stupid(vi a, vi b, int n) {
  int ans = 0;

  for (int i = 0; i * a[0] <= n; ++i)
    for (int j = 0; i * a[0] + j * a[1] <= n; ++j) {
      int v = (n - (i * a[0] + j * a[1]));
      ans = max(ans, b[0] * i + j * b[1] + (v / a[2]) * b[2] + v % a[2]);
    }

  return ans;
}

int stupid2(vi a, vi b, int n) {
  int ans = 0;

  for (int i = 0; i * a[0] <= n; ++i)
    for (int j = 0; i * a[0] + j * a[1] <= n; ++j) {
      int v = (n - (i * a[0] + j * a[1]));
      ans = max(ans, b[0] * i + j * b[1] + v);
    }

  return ans;
}

int stupid3(vi a, vi b, int n) {
  int ans = 0;

  for (int i = 0; i * a[0] <= n; ++i)
    for (int j = 0; i * a[0] + j * a[1] <= n; ++j) {
      int v = (n - (i * a[0] + j * a[1]));
      int cnt = b[0] * i + j * b[1] + v;
      ans = max(ans, (cnt / b[2]) * a[2] + cnt % b[2]);
    }

  return ans;
}

void smain() {
  int n;
  cin >> n;

  int m = 3;
  vi a(m), b(m), c(m);

  for (int i = 0; i < m; ++i)
    cin >> a[i];

  for (int i = 0; i < m; ++i)
    cin >> b[i];

  if (a[0] == b[0])
    a[0] = 3e7, b[0] = 3e7 + 1;

  if (a[1] == b[1])
    a[1] = 3e7, b[1] = 3e7 + 1;

  if (a[2] == b[2])
    a[2] = 3e7, b[2] = 3e7 + 1;

  if (a[0] > b[0] && a[1] > b[1] && a[2] > b[2])
    cout << stupid(b, a, n);
  else if (a[0] < b[0] && a[1] < b[1] && a[2] < b[2])
    cout << stupid(a, b, n);
  else if (a[0] > b[0] && a[1] < b[1] && a[2] < b[2]) {
    swap(a[0], a[2]);
    swap(b[0], b[2]);
    cout << stupid3(a, b, n);
  } else if (a[0] < b[0] && a[1] > b[1] && a[2] < b[2]) {
    swap(a[1], a[2]);
    swap(b[1], b[2]);
    cout << stupid3(a, b, n);
  } else if (a[0] < b[0] && a[1] < b[1] && a[2] > b[2]) {
    cout << stupid3(a, b, n);
  } else if (a[0] > b[0] && a[1] > b[1] && a[2] < b[2]) {
    int v = (n / a[2]) * b[2] + n % a[2];
    cout << stupid2(b, a, v);
  } else if (a[0] > b[0] && a[1] < b[1] && a[2] > b[2]) {
    int v = (n / a[1]) * b[1] + n % a[1];
    swap(a[1], a[2]);
    swap(b[1], b[2]);
    cout << stupid2(b, a, v);
  } else if (a[0] < b[0] && a[1] > b[1] && a[2] > b[2]) {
    int v = (n / a[0]) * b[0] + n % a[0];
    swap(a[0], a[2]);
    swap(b[0], b[2]);
    cout << stupid2(b, a, v);
  }
}


Fixed submission:
#include <bits/stdc++.h>
#include <random>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;

#define int ll

typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef vector<piii> vpii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;

#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define mp(a, b) make_pair(a, (b))
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for (int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cout << (#x) << " = " << x << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr                                                                   \
  if (false)                                                                   \
  cerr
#endif

void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  err(++it, args...);
}

const double PI = 2 * acos(0.0);

const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());

istream &operator>>(istream &in, pii &a) {
  in >> a.first >> a.second;
  return in;
}

ostream &operator<<(ostream &out, pii &a) {
  out << a.first << ' ' << a.second;
  return out;
}

template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
  return out << "{" << a.first << ", " << a.second << "}";
}

template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << "}";
}

template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << ", " << get<3>(a) << "}";
}

template <class T> inline ostream &operator<<(ostream &out, vector<T> &a) {
  out << "[";
  fori(i, a.size()) out << a[i]
                        << vector<string>{", ", "]  "}[i + 1 == a.size()];
  return out;
}

void smain();

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);

#ifdef ART_HOME
  freopen("input.txt", "r", stdin);
  clock_t start = clock();
#endif
  cout << setprecision(0) << fixed;
  smain();
#ifdef ART_HOME
  cout << "\n\n\n\nTOTAL EXECUTION TIME: "
       << float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
}

const int N = 1 << 17, psze = 20, oo = 1e9 + 100, B = 100, M = 1e9 + 6;
const ld pi = 2 * atan2(1, 0), EPS = 1e-9;

int stupid(vi a, vi b, int n) {
  int ans = 0;

  for (int i = 0; i * a[0] <= n; ++i)
    for (int j = 0; i * a[0] + j * a[1] <= n; ++j) {
      int v = (n - (i * a[0] + j * a[1]));
      ans = max(ans, b[0] * i + j * b[1] + (v / a[2]) * b[2] + v % a[2]);
    }

  return ans;
}

int stupid2(vi a, vi b, int n) {
  int ans = 0;

  for (int i = 0; i * a[0] <= n; ++i) {
    int v = (n - (i * a[0]));
    ans = max(ans, b[0] * i + (v / a[1]) * b[1] + v % a[1]);
  }

  return ans;
}

int stupid3(vi a, vi b, int n) {
  int ans = 0;

  for (int i = 0; i * a[0] <= n; ++i)
    for (int j = 0; i * a[0] + j * a[1] <= n; ++j) {
      int v = (n - (i * a[0] + j * a[1]));
      int cnt = b[0] * i + j * b[1] + v;
      ans = max(ans, (cnt / b[2]) * a[2] + cnt % b[2]);
    }

  return ans;
}

void smain() {
  int n;
  cin >> n;

  int m = 3;
  vi a(m), b(m), c(m);

  for (int i = 0; i < m; ++i)
    cin >> a[i];

  for (int i = 0; i < m; ++i)
    cin >> b[i];

  if (a[0] == b[0])
    a[0] = 3e7, b[0] = 3e7 + 1;

  if (a[1] == b[1])
    a[1] = 3e7, b[1] = 3e7 + 1;

  if (a[2] == b[2])
    a[2] = 3e7, b[2] = 3e7 + 1;

  if (a[0] > b[0] && a[1] > b[1] && a[2] > b[2])
    cout << stupid(b, a, n);
  else if (a[0] < b[0] && a[1] < b[1] && a[2] < b[2])
    cout << stupid(a, b, n);
  else if (a[0] > b[0] && a[1] < b[1] && a[2] < b[2]) {
    swap(a[0], a[2]);
    swap(b[0], b[2]);
    cout << stupid3(a, b, n);
  } else if (a[0] < b[0] && a[1] > b[1] && a[2] < b[2]) {
    swap(a[1], a[2]);
    swap(b[1], b[2]);
    cout << stupid3(a, b, n);
  } else if (a[0] < b[0] && a[1] < b[1] && a[2] > b[2]) {
    cout << stupid3(a, b, n);
  } else if (a[0] > b[0] && a[1] > b[1] && a[2] < b[2]) {
    int v = (n / a[2]) * b[2] + n % a[2];
    cout << stupid2(b, a, v);
  } else if (a[0] > b[0] && a[1] < b[1] && a[2] > b[2]) {
    int v = (n / a[1]) * b[1] + n % a[1];
    swap(a[1], a[2]);
    swap(b[1], b[2]);
    cout << stupid2(b, a, v);
  } else if (a[0] < b[0] && a[1] > b[1] && a[2] > b[2]) {
    int v = (n / a[0]) * b[0] + n % a[0];
    swap(a[0], a[2]);
    swap(b[0], b[2]);
    cout << stupid2(b, a, v);
  }
}