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

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define SZ(x) (int)(x).size()
#define endl '\\n'
#define FOR(a, b, c) for (auto a = (b); (a) < (c); ++(a))
#define F0R(a, b) FOR(a, 0, (b))
#define CEIL(a, b) ((a) + (b)-1) / (b)
template <class T> bool ckmin(T &a, const T &b) {
  return a > b ? a = b, true : false;
}
template <class T> bool ckmax(T &a, const T &b) {
  return a < b ? a = b, true : false;
}
#ifndef DEBUG
#define DEBUG 0
#endif
#define dout                                                                   \\
  if (DEBUG)                                                                   \\
  std::cerr
#define dvar(...) " [" << #__VA_ARGS__ ": " << mt(__VA_ARGS__) << "] "
template <typename T> struct IsC {
  template <typename C> static char test(typename C::const_iterator *);
  template <typename C> static int test(...);
  static const bool value = sizeof(test<T>(0)) == sizeof(char);
};
template <> struct IsC<string> {
  static const bool value = false;
};
template <typename C>
typename enable_if<IsC<C>::value, ostream &>::type operator<<(ostream &,
                                                              const C &);
template <typename T1, typename T2>
ostream &operator<<(ostream &, const pair<T1, T2> &);
template <typename... T> using TS = tuple_size<tuple<T...>>;
template <size_t idx, typename... T>
typename enable_if<TS<T...>::value == idx + 1, ostream &>::type
operator<<(ostream &o, const tuple<T...> &t) {
  return o << ", " << get<idx>(t) << ')';
}
template <size_t idx, typename... T>
typename enable_if<0 < idx && idx + 1 < TS<T...>::value, ostream &>::type
operator<<(ostream &o, const tuple<T...> &t) {
  return operator<< <idx + 1>(o << ", " << get<idx>(t), t);
}
template <size_t idx = 0, typename... T>
typename enable_if<1 < TS<T...>::value && !idx, ostream &>::type
operator<<(ostream &o, const tuple<T...> &t) {
  return operator<< <idx + 1>(o << '(' << get<idx>(t), t);
}
template <typename T> ostream &operator<<(ostream &o, const tuple<T> &t) {
  return o << get<0>(t);
}
template <typename T1, typename T2>
ostream &operator<<(ostream &o, const pair<T1, T2> &p) {
  return o << mt(p.fi, p.se);
}
template <typename C>
typename enable_if<IsC<C>::value, ostream &>::type operator<<(ostream &o,
                                                              const C &c) {
  o << '[';
  for (auto it = c.cbegin(); it != c.cend(); ++it)
    o << *it << (next(it) != c.cend() ? ", " : "");
  return o << ']';
}
template <typename T>
void tprint(vector<vector<T>> &v, size_t width = 0, ostream &o = cerr) {
  if (!DEBUG)
    return;
  for (const auto &vv : v) {
    for (const auto &i : vv)
      o << setw(width) << i;
    o << endl;
  }
}

int n;
vector<array<ll, 3>> a;
int curr, flip, cnt;

ll calc() {
  ll res = 0;
  F0R(i, n) {
    if (curr & (1 << i))
      continue;

    ll mn = min(abs(a[i][0]), abs(a[i][1]));

    for (int j = 0, bitNr = 0; bitNr < cnt; ++j) {
      if (!(curr & (1 << j)))
        continue;

      bool flag = flip & (1 << bitNr);
      ckmin(mn, abs(a[i][!flag] - a[j][!flag]));
      bitNr++;
    }

    res += mn * a[i][2];
  }
  return res;
}

void solve() {
  cin >> n;
  a = vector<array<ll, 3>>(n);
  F0R(i, n)
  F0R(j, 3)
  cin >> a[i][j];

  vector<ll> res(n + 1, 1e18);
  for (curr = 0; curr < (1 << n); ++curr) {

    cnt = __builtin_popcount(curr);

    for (flip = 0; flip < (1 << cnt); ++flip)
      ckmin(res[cnt], calc());
  }

  for (ll i : res)
    cout << i << endl;
}

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);

  int tc = 1;
  FOR(i, 1, tc + 1) {
    // cout << "Case #" << i << ": ";
    solve();
  }
}


Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define fi first
#define se second
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define eb emplace_back
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define SZ(x) (int)(x).size()
#define endl '\\n'
#define FOR(a, b, c) for (auto a = (b); (a) < (c); ++(a))
#define F0R(a, b) FOR(a, 0, (b))
#define CEIL(a, b) ((a) + (b)-1) / (b)
template <class T> bool ckmin(T &a, const T &b) {
  return a > b ? a = b, true : false;
}
template <class T> bool ckmax(T &a, const T &b) {
  return a < b ? a = b, true : false;
}
#ifndef DEBUG
#define DEBUG 0
#endif
#define dout                                                                   \\
  if (DEBUG)                                                                   \\
  std::cerr
#define dvar(...) " [" << #__VA_ARGS__ ": " << mt(__VA_ARGS__) << "] "
template <typename T> struct IsC {
  template <typename C> static char test(typename C::const_iterator *);
  template <typename C> static int test(...);
  static const bool value = sizeof(test<T>(0)) == sizeof(char);
};
template <> struct IsC<string> {
  static const bool value = false;
};
template <typename C>
typename enable_if<IsC<C>::value, ostream &>::type operator<<(ostream &,
                                                              const C &);
template <typename T1, typename T2>
ostream &operator<<(ostream &, const pair<T1, T2> &);
template <typename... T> using TS = tuple_size<tuple<T...>>;
template <size_t idx, typename... T>
typename enable_if<TS<T...>::value == idx + 1, ostream &>::type
operator<<(ostream &o, const tuple<T...> &t) {
  return o << ", " << get<idx>(t) << ')';
}
template <size_t idx, typename... T>
typename enable_if<0 < idx && idx + 1 < TS<T...>::value, ostream &>::type
operator<<(ostream &o, const tuple<T...> &t) {
  return operator<< <idx + 1>(o << ", " << get<idx>(t), t);
}
template <size_t idx = 0, typename... T>
typename enable_if<1 < TS<T...>::value && !idx, ostream &>::type
operator<<(ostream &o, const tuple<T...> &t) {
  return operator<< <idx + 1>(o << '(' << get<idx>(t), t);
}
template <typename T> ostream &operator<<(ostream &o, const tuple<T> &t) {
  return o << get<0>(t);
}
template <typename T1, typename T2>
ostream &operator<<(ostream &o, const pair<T1, T2> &p) {
  return o << mt(p.fi, p.se);
}
template <typename C>
typename enable_if<IsC<C>::value, ostream &>::type operator<<(ostream &o,
                                                              const C &c) {
  o << '[';
  for (auto it = c.cbegin(); it != c.cend(); ++it)
    o << *it << (next(it) != c.cend() ? ", " : "");
  return o << ']';
}
template <typename T>
void tprint(vector<vector<T>> &v, size_t width = 0, ostream &o = cerr) {
  if (!DEBUG)
    return;
  for (const auto &vv : v) {
    for (const auto &i : vv)
      o << setw(width) << i;
    o << endl;
  }
}

int n;
vector<array<ll, 3>> a;
int curr, flip, cnt;

ll calc() {
  ll res = 0;
  F0R(i, n) {
    if (curr & (1 << i))
      continue;

    ll mn = min(abs(a[i][0]), abs(a[i][1]));

    int bitNr = 0;
    F0R(j, n) {
      if (curr & (1 << j)) {
        if (flip & (1 << bitNr))
          ckmin(mn, abs(a[i][0] - a[j][0]));
        else
          ckmin(mn, abs(a[i][1] - a[j][1]));

        bitNr++;
      }
    }
    assert(mn >= 0);

    res += mn * a[i][2];
  }
  return res;
}

void solve() {
  cin >> n;
  a = vector<array<ll, 3>>(n);
  F0R(i, n)
  F0R(j, 3)
  cin >> a[i][j];

  vector<ll> res(n + 1, 1e18);
  for (curr = 0; curr < (1 << n); ++curr) {

    cnt = 0;
    F0R(j, n)
    if (curr & (1 << j))
      cnt++;

    for (flip = 0; flip < (1 << cnt); ++flip)
      ckmin(res[cnt], calc());
  }

  for (ll i : res)
    cout << i << endl;
}

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(0);

  int tc = 1;
  FOR(i, 1, tc + 1) {
    // cout << "Case #" << i << ": ";
    solve();
  }
}