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

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;

#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i, n) for (auto &i : n)

template <class T> inline bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
void init() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
}

#ifdef DEBUG
template <class T, class N> void verr(const T &a, const N &n) {
  rep(i, n) cerr << a[i] << " ";
  cerr << "\\n" << flush;
}
ll dbgt = 1;
void err() { cerr << "passed " << dbgt++ << "\\n" << flush; }
template <class H, class... T> void err(H &&h, T &&...t) {
  cerr << h << (sizeof...(t) ? " " : "\\n") << flush;
  if (sizeof...(t) > 0)
    err(forward<T>(t)...);
}
#endif

const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
//--------------------------------------------------------------------------------//
using arr = array<ll, 3>;

int main() {
  init();
  ll N;
  cin >> N;
  vc<arr> A(N);
  vl ans(N + 1, INF);

  rep(i, N) cin >> A[i][0] >> A[i][1] >> A[i][2];

  vl tmp(N);
  rep(i, N) tmp[i] = min(abs(A[i][0]), abs(A[i][1])) * A[i][2];

  auto dfs = [&](auto &&dfs, string s, vl C) -> void {
    if (s.size() == N) {
      ll cnt = 0;
      rep(i, N) cnt += (s[i] != '0');
      chmin(ans[cnt], accumulate(all(C), 0ll));
      return;
    }

    dfs(dfs, s + '0', C);

    ll n = s.size();
    vl D = C;
    rep(i, N) chmin(D[i], abs(A[i][0] - A[n][0]) * A[i][2]);
    dfs(dfs, s + '1', D);

    rep(i, N) chmin(C[i], abs(A[i][1] - A[n][1]) * A[i][2]);
    dfs(dfs, s + '2', C);
    return;
  };

  dfs(dfs, "", tmp);

  rep(i, N + 1) cout << ans[i] << endl;
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;

#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
#define repa(i, n) for (auto &i : n)

template <class T> inline bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
void init() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(15);
}

#ifdef DEBUG
template <class T, class N> void verr(const T &a, const N &n) {
  rep(i, n) cerr << a[i] << " ";
  cerr << "\\n" << flush;
}
ll dbgt = 1;
void err() { cerr << "passed " << dbgt++ << "\\n" << flush; }
template <class H, class... T> void err(H &&h, T &&...t) {
  cerr << h << (sizeof...(t) ? " " : "\\n") << flush;
  if (sizeof...(t) > 0)
    err(forward<T>(t)...);
}
#endif

const ll INF = 4e18;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
//--------------------------------------------------------------------------------//
using arr = array<ll, 3>;

int main() {
  init();
  ll N;
  cin >> N;
  vc<arr> A(N);
  vl ans(N + 1, INF);

  rep(i, N) cin >> A[i][0] >> A[i][1] >> A[i][2];

  vl tmp(N);
  rep(i, N) tmp[i] = min(abs(A[i][0]), abs(A[i][1])) * A[i][2];
  queue<pair<string, vl>> q;

  // n1
  q.emplace("", tmp);
  while (!q.empty()) {
    string s;
    vl C;
    tie(s, C) = q.front();
    q.pop();
    if (s.size() == N) {
      ll cnt = 0;
      rep(i, N) if (s[i] != '0') cnt++;
      chmin(ans[cnt], accumulate(all(C), 0ll));
      continue;
    }

    ll n = s.size();
    auto [x, y, c] = A[n];
    q.emplace(s + "0", C);

    vl D = C;
    rep(i, N) chmin(D[i], abs(A[i][0] - x) * A[i][2]);
    q.emplace(s + "1", D);

    rep(i, N) chmin(C[i], abs(A[i][1] - y) * A[i][2]);
    q.emplace(s + "2", C);
  }

  rep(i, N + 1) cout << ans[i] << endl;
}