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

// #define _GLIBCXX_DEBUG
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

#define endl '\\n'
#define lfs cout << fixed << setprecision(10)
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i, n, m) for (ll i = (n); i < (ll)(m); i++)
#define rrep(i, n, m) for (ll i = (ll)(m)-1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9 + 7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template <typename T1, typename T2> bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  } else
    return false;
}
template <typename T1, typename T2> bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  } else
    return false;
}
ll median(ll a, ll b, ll c) {
  return a + b + c - max({a, b, c}) - min({a, b, c});
}
void ans1(bool x) {
  if (x)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
void ans2(bool x) {
  if (x)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
void ans3(bool x) {
  if (x)
    cout << "Yay!" << endl;
  else
    cout << ":(" << endl;
}
template <typename T1, typename T2> void ans(bool x, T1 y, T2 z) {
  if (x)
    cout << y << endl;
  else
    cout << z << endl;
}
template <typename T> void debug(vector<vector<T>> &v, ll h, ll w) {
  for (ll i = 0; i < h; i++) {
    cout << v[i][0];
    for (ll j = 1; j < w; j++)
      cout spa v[i][j];
    cout << endl;
  }
};
void debug(vector<string> &v, ll h, ll w) {
  for (ll i = 0; i < h; i++) {
    for (ll j = 0; j < w; j++)
      cout << v[i][j];
    cout << endl;
  }
};
template <typename T> void debug(vector<T> &v, ll n) {
  if (n != 0)
    cout << v[0];
  for (ll i = 1; i < n; i++)
    cout spa v[i];
  cout << endl;
};
template <typename T> vector<vector<T>> vec(ll x, ll y, T w) {
  vector<vector<T>> v(x, vector<T>(y, w));
  return v;
}
ll gcd(ll x, ll y) {
  ll r;
  while (y != 0 && (r = x % y) != 0) {
    x = y;
    y = r;
  }
  return y == 0 ? x : y;
}
vector<ll> dx = {1, -1, 0, 0, 1, 1, -1, -1};
vector<ll> dy = {0, 0, 1, -1, 1, -1, 1, -1};
template <typename T> vector<T> make_v(size_t a, T b) {
  return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  return os << p.first << " " << p.second;
}
// mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res = 0, buf = 0;
  bool judge = true;
  ll n;
  cin >> n;
  vector<ll> x(n), y(n), p(n);
  rep(i, 0, n) cin >> x[i] >> y[i] >> p[i];
  vector<ll> ret(n + 1, INF);
  auto dx = vec(1 << n, n, 0LL);
  auto dy = vec(1 << n, n, 0LL);
  rep(i, 0, 1 << n) {
    rep(j, 0, n) {
      dx[i][j] = abs(x[j]);
      dy[i][j] = abs(y[j]);
      rep(o, 0, n) {
        if (i & 1 << o) {
          // cout<<i spa j spa o spa abs(x[o]-x[j]) spa abs(y[o]-y[j])<<endl;
          chmin(dx[i][j], abs(x[o] - x[j]));
          chmin(dy[i][j], abs(y[o] - y[j]));
        }
      }
    }
  }
  // debug(dx,1<<n,n);
  // debug(dy,1<<n,n);
  auto dfs = [&](auto &&f, ll d, ll cnt, ll xl, ll xr) -> void {
    if (d == n) {
      ll now = 0;
      // cout<<cnt spa xl spa xr<<endl;
      rep(j, 0, n) { now += min(dx[xl][j], dy[xr][j]) * p[j]; }
      chmin(ret[cnt], now);
    } else {
      f(f, d + 1, cnt, xl, xr);
      f(f, d + 1, cnt + 1, xl | 1 << d, xr);
      f(f, d + 1, cnt + 1, xl, xr | 1 << d);
    }
  };
  dfs(dfs, 0, 0, 0, 0);
  rep(i, 0, n + 1) cout << ret[i] << endl;
  return 0;
}

Error: TLE

Fixed submission:

// #define _GLIBCXX_DEBUG

#include <bits/stdc++.h>
using namespace std;

#define endl '\\n'
#define lfs cout << fixed << setprecision(10)
#define ALL(a) (a).begin(), (a).end()
#define ALLR(a) (a).rbegin(), (a).rend()
#define spa << " " <<
#define fi first
#define se second
#define MP make_pair
#define MT make_tuple
#define PB push_back
#define EB emplace_back
#define rep(i, n, m) for (ll i = (n); i < (ll)(m); i++)
#define rrep(i, n, m) for (ll i = (ll)(m)-1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD1 = 1e9 + 7;
const ll MOD9 = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template <typename T1, typename T2> bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  } else
    return false;
}
template <typename T1, typename T2> bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  } else
    return false;
}
ll median(ll a, ll b, ll c) {
  return a + b + c - max({a, b, c}) - min({a, b, c});
}
void ans1(bool x) {
  if (x)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
}
void ans2(bool x) {
  if (x)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}
void ans3(bool x) {
  if (x)
    cout << "Yay!" << endl;
  else
    cout << ":(" << endl;
}
template <typename T1, typename T2> void ans(bool x, T1 y, T2 z) {
  if (x)
    cout << y << endl;
  else
    cout << z << endl;
}
template <typename T> void debug(vector<vector<T>> &v, ll h, ll w) {
  for (ll i = 0; i < h; i++) {
    cout << v[i][0];
    for (ll j = 1; j < w; j++)
      cout spa v[i][j];
    cout << endl;
  }
};
void debug(vector<string> &v, ll h, ll w) {
  for (ll i = 0; i < h; i++) {
    for (ll j = 0; j < w; j++)
      cout << v[i][j];
    cout << endl;
  }
};
template <typename T> void debug(vector<T> &v, ll n) {
  if (n != 0)
    cout << v[0];
  for (ll i = 1; i < n; i++)
    cout spa v[i];
  cout << endl;
};
template <typename T> vector<vector<T>> vec(ll x, ll y, T w) {
  vector<vector<T>> v(x, vector<T>(y, w));
  return v;
}
ll gcd(ll x, ll y) {
  ll r;
  while (y != 0 && (r = x % y) != 0) {
    x = y;
    y = r;
  }
  return y == 0 ? x : y;
}
vector<ll> dx = {1, -1, 0, 0, 1, 1, -1, -1};
vector<ll> dy = {0, 0, 1, -1, 1, -1, 1, -1};
template <typename T> vector<T> make_v(size_t a, T b) {
  return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
  return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  return os << p.first << " " << p.second;
}
// mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
template <ll base, ll sz> struct Bits {
  vector<ll> data;
  ll value;
  Bits() { data.assign(sz, 0); };
  Bits(ll k) : value(k) {
    data.assign(sz, 0);
    build(k);
  }
  void build(ll k) {
    for (ll i = 0; i < sz; i++) {
      data[i] = k % base;
      k /= base;
    }
  }
  Bits &operator=(const ll k) {
    fill(ALL(this->data), 0);
    this->build(k);
  }
  ll &operator[](const ll k) { return this->data.at(k); }
  static ll pow(ll k) {
    ll ret = 1;
    while (k--)
      ret *= base;
    return ret;
  }
  void print() {
    for (ll i = sz - 1; i >= 0; i--) {
      if (i != sz - 1)
        cout << " ";
      cout << data[i];
    }
    cout << endl;
  }
};
using bits = Bits<3, 15>;
int main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll res = 0, buf = 0;
  bool judge = true;
  ll n;
  cin >> n;
  vector<ll> x(n), y(n), p(n);
  rep(i, 0, n) cin >> x[i] >> y[i] >> p[i];
  ll lim = bits::pow(n);
  vector<ll> ret(n + 1, INF);
  rep(i, 0, lim) {
    auto v = bits(i);
    vector<ll> xl(1, 0), yl(1, 0);
    ll cnt = n;
    rep(j, 0, n) {
      if (v[j] == 1)
        xl.PB(x[j]);
      else if (v[j] == 2)
        yl.PB(y[j]);
      else
        cnt--;
    }
    sort(ALL(xl));
    sort(ALL(yl));
    ll now = 0;
    rep(j, 0, n) {
      ll md = INF;
      auto ix = lower_bound(ALL(xl), x[j]) - xl.begin();
      auto iy = lower_bound(ALL(yl), y[j]) - yl.begin();
      if (ix < xl.size())
        chmin(md, xl[ix] - x[j]);
      if (iy < yl.size())
        chmin(md, yl[iy] - y[j]);
      if (ix > 0)
        chmin(md, x[j] - xl[ix - 1]);
      if (iy > 0)
        chmin(md, y[j] - yl[iy - 1]);
      now += md * p[j];
    }
    // cout<<v.value spa now<<endl;
    chmin(ret[cnt], now);
  }
  rep(i, 0, n + 1) cout << ret[i] << endl;
  return 0;
}