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

////////////////////////////////////////
///  tu3 pro-con template            ///
////////////////////////////////////////
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

//// MACRO ////
#define countof(a) (sizeof(a) / sizeof(a[0]))

#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define pos(c, i) c.being() + (i)
#define allof(c) c.begin(), c.end()
#define aallof(a) a, countof(a)
#define partof(c, i, n) c.begin() + (i), c.begin() + (i) + (n)
#define apartof(a, i, n) a + (i), a + (i) + (n)
#define long long long

#define EPS 1e-9
#define INF (1L << 30)
#define LINF (1LL << 60)

#define PREDICATE(t, a) (const t &a)->bool
#define COMPARISON_T(t) bool (*)(const t &, const t &)
#define COMPARISON(t, a, b) (const t &a, const t &b)->bool
#define CONVERTER(TSrc, t, TDest) (const TSrc &t)->TDest

//// i/o helper ////

struct _Reader {
  template <class T> _Reader operator,(T &rhs) {
    cin >> rhs;
    return *this;
  }
};
struct _Writer {
  bool f;
  _Writer() : f(false) {}
  template <class T> _Writer operator,(const T &rhs) {
    cout << (f ? " " : "") << rhs;
    f = true;
    return *this;
  }
};
#define READ(t, ...)                                                           \\
  t __VA_ARGS__;                                                               \\
  _Reader(), __VA_ARGS__
#define WRITE(...)                                                             \\
  _Writer(), __VA_ARGS__;                                                      \\
  cout << endl
inline int sign(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }

template <class T> struct vevector : public vector<vector<T>> {
  vevector(int n = 0, int m = 0, const T &initial = T())
      : vector<vector<T>>(n, vector<T>(m, initial)) {}
};
template <class T> struct vevevector : public vector<vevector<T>> {
  vevevector(int n = 0, int m = 0, int l = 0, const T &initial = T())
      : vector<vevector<T>>(n, vevector<T>(m, l, initial)) {}
};
template <class T> struct vevevevector : public vector<vevevector<T>> {
  vevevevector(int n = 0, int m = 0, int l = 0, int k = 0,
               const T &initial = T())
      : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) {}
};
template <class T> T read() {
  T t;
  cin >> t;
  return t;
}
template <class T> vector<T> read(int n) {
  vector<T> v;
  REP(i, n) { v.push_back(read<T>()); }
  return v;
}
template <class T> vevector<T> read(int n, int m) {
  vevector<T> v;
  REP(i, n) v.push_back(read<T>(m));
  return v;
}
template <class T> vector<T> readjag() { return read<T>(read<int>()); }
template <class T> vevector<T> readjag(int n) {
  vevector<T> v;
  REP(i, n) v.push_back(readjag<T>());
  return v;
}

template <class T1, class T2>
inline istream &operator>>(istream &in, pair<T1, T2> &p) {
  in >> p.first >> p.second;
  return in;
}
template <class T1, class T2>
inline ostream &operator<<(ostream &out, pair<T1, T2> &p) {
  out << p.first << p.second;
  return out;
}
template <class T> inline ostream &operator<<(ostream &out, vector<T> &v) {
  ostringstream ss;
  for (auto x : v)
    ss << x << ' ';
  auto s = ss.str();
  out << s.substr(0, s.length() - 1) << endl;
  return out;
}

//// start up ////
void solve();
int main() {
  solve();
  return 0;
}

////////////////////
/// template end ///
////////////////////

void solve() {
  int testcases = INF;
  REP(testcase, testcases) {
    READ(int, N);
    if (!N) {
      break;
    }
    auto HP = read<int>(N);

    int maxHP = *max_element(allof(HP));
    vector<int> tableS(
        maxHP + 1, INF); // tableS[x] = 単体魔法でxダメージ与えるのに必要なMP
    vector<int> tableA(
        maxHP + 1, INF); // tableA[x] = 全体魔法でxダメージ与えるのに必要なMP
    tableS[0] = tableA[0] = 0;

    READ(int, M);
    REP(_, M) {
      string name, type;
      int mp, dmg;
      cin >> name >> mp >> type >> dmg;
      vector<int> &tg = type[0] == 'A' ? tableA : tableS;
      FOR(d, 1, maxHP + 1) { tg[d] = min(tg[d], tg[max(0, d - dmg)] + mp); }
    }

    // 全体魔法でd与えてから、単体魔法で倒してみることにしよう。
    long result = LINF;
    REP(d, maxHP + 1) {
      long cost = tableA[d];
      REP(i, HP.size()) { cost += tableS[max(HP[i] - d, 0)]; }
      result = min(result, cost);
      // WRITE("d:", d, " MP:", cost);
    }
    WRITE(result);
  }
}

Error: TLE

Fixed submission:

////////////////////////////////////////
///  tu3 pro-con template            ///
////////////////////////////////////////
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

//// MACRO ////
#define countof(a) (sizeof(a) / sizeof(a[0]))

#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, s, n) for (int i = (s); i < (n); i++)
#define RFOR(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define pos(c, i) c.being() + (i)
#define allof(c) c.begin(), c.end()
#define aallof(a) a, countof(a)
#define partof(c, i, n) c.begin() + (i), c.begin() + (i) + (n)
#define apartof(a, i, n) a + (i), a + (i) + (n)
#define long long long

#define EPS 1e-9
#define INF (1L << 30)
#define LINF (1LL << 60)

#define PREDICATE(t, a) (const t &a)->bool
#define COMPARISON_T(t) bool (*)(const t &, const t &)
#define COMPARISON(t, a, b) (const t &a, const t &b)->bool
#define CONVERTER(TSrc, t, TDest) (const TSrc &t)->TDest

//// i/o helper ////

struct _Reader {
  template <class T> _Reader operator,(T &rhs) {
    cin >> rhs;
    return *this;
  }
};
struct _Writer {
  bool f;
  _Writer() : f(false) {}
  template <class T> _Writer operator,(const T &rhs) {
    cout << (f ? " " : "") << rhs;
    f = true;
    return *this;
  }
};
#define READ(t, ...)                                                           \\
  t __VA_ARGS__;                                                               \\
  _Reader(), __VA_ARGS__
#define WRITE(...)                                                             \\
  _Writer(), __VA_ARGS__;                                                      \\
  cout << endl
inline int sign(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }

template <class T> struct vevector : public vector<vector<T>> {
  vevector(int n = 0, int m = 0, const T &initial = T())
      : vector<vector<T>>(n, vector<T>(m, initial)) {}
};
template <class T> struct vevevector : public vector<vevector<T>> {
  vevevector(int n = 0, int m = 0, int l = 0, const T &initial = T())
      : vector<vevector<T>>(n, vevector<T>(m, l, initial)) {}
};
template <class T> struct vevevevector : public vector<vevevector<T>> {
  vevevevector(int n = 0, int m = 0, int l = 0, int k = 0,
               const T &initial = T())
      : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) {}
};
template <class T> T read() {
  T t;
  cin >> t;
  return t;
}
template <class T> vector<T> read(int n) {
  vector<T> v;
  REP(i, n) { v.push_back(read<T>()); }
  return v;
}
template <class T> vevector<T> read(int n, int m) {
  vevector<T> v;
  REP(i, n) v.push_back(read<T>(m));
  return v;
}
template <class T> vector<T> readjag() { return read<T>(read<int>()); }
template <class T> vevector<T> readjag(int n) {
  vevector<T> v;
  REP(i, n) v.push_back(readjag<T>());
  return v;
}

template <class T1, class T2>
inline istream &operator>>(istream &in, pair<T1, T2> &p) {
  in >> p.first >> p.second;
  return in;
}
template <class T1, class T2>
inline ostream &operator<<(ostream &out, pair<T1, T2> &p) {
  out << p.first << p.second;
  return out;
}
template <class T> inline ostream &operator<<(ostream &out, vector<T> &v) {
  ostringstream ss;
  for (auto x : v)
    ss << x << ' ';
  auto s = ss.str();
  out << s.substr(0, s.length() - 1) << endl;
  return out;
}

//// start up ////
void solve();
int main() {
  solve();
  return 0;
}

////////////////////
/// template end ///
////////////////////

void solve() {
  int testcases = INF;
  REP(testcase, testcases) {
    READ(int, N);
    if (!N) {
      break;
    }
    auto HP = read<int>(N);

    int maxHP = *max_element(allof(HP));
    vector<int> tableS(
        maxHP + 1, INF); // tableS[x] = 単体魔法でxダメージ与えるのに必要なMP
    vector<int> tableA(
        maxHP + 1, INF); // tableA[x] = 全体魔法でxダメージ与えるのに必要なMP

    READ(int, M);
    REP(_, M) {
      string name, type;
      int mp, dmg;
      cin >> name >> mp >> type >> dmg;
      vector<int> &tg = type[0] == 'A' ? tableA : tableS;
      tg[0] = 0;
      FOR(d, 1, maxHP + 1) { tg[d] = min(tg[d], tg[max(0, d - dmg)] + mp); }
    }

    // 全体魔法でd与えてから、単体魔法で倒してみることにしよう。
    long result = LINF;
    REP(d, maxHP + 1)
    for (int d = 0; d <= maxHP; d++) {
      long cost = tableA[d];
      REP(i, HP.size()) { cost += tableS[max(HP[i] - d, 0)]; }
      result = min(result, cost);
      // WRITE("d:", d, " MP:", cost);
    }
    WRITE(result);
  }
}