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

#include <bits/stdc++.h>
using namespace std;
#define LOCAL
#pragma region Macros
typedef long long ll;
#define ALL(x) (x).begin(), (x).end()
const long long MOD = 1e9 + 7;
// const long long MOD=998244353;
const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};

template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (T &x : v)
    is >> x;
  return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < v.size(); ++i) {
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  }
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  cout << '(' << p.first << ',' << p.second << ')';
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &m) {
  os << '{';
  for (auto itr = m.begin(); itr != m.end(); ++itr) {
    os << '(' << itr->first << ',' << itr->second << ')';
    if (++itr != m.end())
      os << ',';
    --itr;
  }
  os << '}';
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &s) {
  os << '{';
  for (auto itr = s.begin(); itr != s.end(); ++itr) {
    os << *itr;
    if (++itr != s.end())
      os << ',';
    --itr;
  }
  os << '}';
  return os;
}

void debug_out() { cerr << '\\n'; }
template <class Head, class... Tail>
void debug_out(Head &&head, Tail &&...tail) {
  cerr << head;
  if (sizeof...(Tail) > 0)
    cerr << ", ";
  debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                             \\
  cerr << " ";                                                                 \\
  cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]"      \\
       << '\\n';                                                                \\
  cerr << " ";                                                                 \\
  debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2> inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
#pragma endregion

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int N;
  cin >> N;
  vector<ll> X(N), Y(N), P(N);
  for (int i = 0; i < N; ++i)
    cin >> X[i] >> Y[i] >> P[i];
  vector<ll> ans(N + 1, IINF);
  auto dfs = [&](auto self, int v, int cnt, vector<ll> &score) -> void {
    if (v == N) {
      ll sum = 0;
      for (int i = 0; i < N; ++i)
        sum += P[i] * score[i];
      chmin(ans[cnt], sum);
      return;
    }
    vector<ll> nxt = score;
    for (int i = 0; i < N; ++i)
      nxt[i] = min(score[i], abs(X[i] - X[v]));
    self(self, v + 1, cnt + 1, nxt);
    for (int i = 0; i < N; ++i)
      nxt[i] = min(score[i], abs(Y[i] - Y[v]));
    self(self, v + 1, cnt + 1, nxt);
    self(self, v + 1, cnt, score);
  };
  vector<ll> v(N);
  for (int i = 0; i < N; ++i)
    v[i] = min(abs(X[i]), abs(Y[i]));
  dfs(dfs, 0, 0, v);
  for (int i = 0; i <= N; ++i)
    cout << ans[i] << '\\n';
}

Error: TLE

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
#define LOCAL
#pragma region Macros
typedef long long ll;
#define ALL(x) (x).begin(), (x).end()
const long long MOD = 1e9 + 7;
// const long long MOD=998244353;
const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};

template <typename T> istream &operator>>(istream &is, vector<T> &v) {
  for (T &x : v)
    is >> x;
  return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
  for (int i = 0; i < v.size(); ++i) {
    os << v[i] << (i + 1 == v.size() ? "" : " ");
  }
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  cout << '(' << p.first << ',' << p.second << ')';
  return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &m) {
  os << '{';
  for (auto itr = m.begin(); itr != m.end(); ++itr) {
    os << '(' << itr->first << ',' << itr->second << ')';
    if (++itr != m.end())
      os << ',';
    --itr;
  }
  os << '}';
  return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &s) {
  os << '{';
  for (auto itr = s.begin(); itr != s.end(); ++itr) {
    os << *itr;
    if (++itr != s.end())
      os << ',';
    --itr;
  }
  os << '}';
  return os;
}

void debug_out() { cerr << '\\n'; }
template <class Head, class... Tail>
void debug_out(Head &&head, Tail &&...tail) {
  cerr << head;
  if (sizeof...(Tail) > 0)
    cerr << ", ";
  debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                             \\
  cerr << " ";                                                                 \\
  cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]"      \\
       << '\\n';                                                                \\
  cerr << " ";                                                                 \\
  debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2> inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
#pragma endregion

const int MAX_N = 15;

int N;
ll X[MAX_N], Y[MAX_N], P[MAX_N], ans[MAX_N + 1];

vector<int> use;
void dfs(int v) {
  if (v == N) {
    vector<ll> XX, YY;
    XX.emplace_back(0);
    YY.emplace_back(0);
    int cnt = 0;
    ll sum = 0;
    for (int i = 0; i < N; ++i) {
      if (use[i] == 1)
        XX.emplace_back(X[i]);
      if (use[i] == 2)
        YY.emplace_back(Y[i]);
      if (use[i] != 0)
        ++cnt;
    }
    int sx = XX.size(), sy = YY.size(), pos;
    sort(ALL(XX));
    sort(ALL(YY));
    for (int i = 0; i < N; ++i) {
      if (use[i] != 0)
        continue;
      ll Min = IINF;
      pos = lower_bound(ALL(XX), X[i]) - XX.begin();
      if (pos < sx)
        chmin(Min, XX[pos] - X[i]);
      if (pos - 1 >= 0)
        chmin(Min, X[i] - XX[pos - 1]);
      pos = lower_bound(ALL(YY), Y[i]) - YY.begin();
      if (pos < sy)
        chmin(Min, YY[pos] - Y[i]);
      if (pos - 1 >= 0)
        chmin(Min, Y[i] - YY[pos - 1]);
      sum += P[i] * Min;
    }
    chmin(ans[cnt], sum);
    return;
  }
  for (int i = 0; i < 3; ++i) {
    use.emplace_back(i);
    dfs(v + 1);
    use.pop_back();
  }
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> N;
  for (int i = 0; i < N; ++i)
    cin >> X[i] >> Y[i] >> P[i];
  for (int i = 0; i <= N; ++i)
    ans[i] = IINF;
  dfs(0);
  for (int i = 0; i <= N; ++i)
    cout << ans[i] << '\\n';
}