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

#include <bits/stdc++.h>

using namespace std;

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                                           \\
  cerr << #v << ":";                                                           \\
  for (int i = 0; i < v.size(); i++)                                           \\
    cerr << " " << v[i];                                                       \\
  cerr << endl;
#define DEBUG_MAT(v)                                                           \\
  cerr << #v << endl;                                                          \\
  for (int i = 0; i < v.size(); i++) {                                         \\
    for (int j = 0; j < v[i].size(); j++) {                                    \\
      cerr << v[i][j] << " ";                                                  \\
    }                                                                          \\
    cerr << endl;                                                              \\
  }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
  return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
  return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout << setprecision(25) << fixed << p << endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio()                                                                  \\
  cin.tie(0);                                                                  \\
  ios::sync_with_stdio(false);
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
// #define endl '\\n'

signed main() {
  fio();

  int n;
  cin >> n;
  vector<pii> xy(n);
  vector<int> p(n);
  vector<pii> xi(n), yi(n);
  rep(i, n) {
    cin >> xy[i].first >> xy[i].second >> p[i];
    xi[i].first = xy[i].first;
    yi[i].first = xy[i].second;
    xi[i].second = yi[i].second = i;
  }

  sort(all(xi));
  sort(all(yi));

  vl ans(n + 1, INF);
  vl power3(n + 1);
  power3[0] = 1;
  rep(i, n) power3[i + 1] = power3[i] * 3;
  ll num = power3[n];

  vl l(n, INF), r(n, INF), u(n, INF), d(n, INF);
  vi a(n);
  rep(i, num) {
    int mask = i;
    int cnt = 0;
    rep(j, n) {
      a[j] = mask % 3;
      if (a[j] != 0)
        cnt++;
      mask /= 3;
    }

    ll mi = -INF;
    rep(i, xi.size()) {
      int idx = xi[i].second;
      if (a[idx] == 1)
        mi = xi[i].first;
      if (xi[i].first >= 0)
        mi = max(mi, 0LL);
      l[idx] = (xi[i].first - mi);
    }
    ll ma = INF;
    rrep(i, xi.size()) {
      int idx = xi[i].second;
      if (a[idx] == 1)
        ma = xi[i].first;
      if (xi[i].first <= 0)
        ma = min(ma, 0LL);
      r[idx] = (ma - xi[i].first);
    }
    mi = -INF;
    rep(i, yi.size()) {
      int idx = yi[i].second;
      if (a[idx] == 2)
        mi = yi[i].first;
      if (yi[i].first >= 0)
        mi = max(mi, 0LL);
      d[idx] = (yi[i].first - mi);
    }
    ma = INF;
    rrep(i, yi.size()) {
      int idx = yi[i].second;
      if (a[idx] == 2)
        ma = yi[i].first;
      if (yi[i].first <= 0)
        ma = min(ma, 0LL);
      u[idx] = (ma - yi[i].first);
    }

    ll res = 0;
    rep(i, n) {
      ll dist = min({l[i], d[i], u[i], r[i]});
      res += dist * p[i];
    }
    chmin(ans[cnt], res);
  }

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

Error: TLE

Fixed submission:

#include <bits/stdc++.h>

using namespace std;

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v)                                                           \\
  cerr << #v << ":";                                                           \\
  for (int i = 0; i < v.size(); i++)                                           \\
    cerr << " " << v[i];                                                       \\
  cerr << endl;
#define DEBUG_MAT(v)                                                           \\
  cerr << #v << endl;                                                          \\
  for (int i = 0; i < v.size(); i++) {                                         \\
    for (int j = 0; j < v[i].size(); j++) {                                    \\
      cerr << v[i][j] << " ";                                                  \\
    }                                                                          \\
    cerr << endl;                                                              \\
  }
typedef long long ll;
// #define int ll

#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
template <class S, class T>
pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) {
  return pair<S, T>(s.first + t.first, s.second + t.second);
}
template <class S, class T>
pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) {
  return pair<S, T>(s.first - t.first, s.second - t.second);
}
template <class S, class T> ostream &operator<<(ostream &os, pair<S, T> p) {
  os << "(" << p.first << ", " << p.second << ")";
  return os;
}
#define X first
#define Y second
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rrep1(i, n) for (int i = (int)(n); i > 0; i--)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(), c.end()
template <class T> bool chmax(T &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T> bool chmin(T &a, const T &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
#define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end());
const ll inf = 1000000001;
const ll INF = (ll)1e18 + 1;
const long double pi = 3.1415926535897932384626433832795028841971L;
#define Sp(p) cout << setprecision(25) << fixed << p << endl;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
// int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
vi dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
// vi dx2 = { 1,1,0,-1,-1,-1,0,1 }, dy2 = { 0,1,1,1,0,-1,-1,-1 };
#define fio()                                                                  \\
  cin.tie(0);                                                                  \\
  ios::sync_with_stdio(false);
const ll MOD = 1000000007;
// const ll MOD = 998244353;
// #define mp make_pair
// #define endl '\\n'

signed main() {
  fio();

  int n;
  cin >> n;
  vector<pii> xy(n);
  vector<int> p(n);
  vector<pii> xi(n), yi(n);
  rep(i, n) {
    cin >> xy[i].first >> xy[i].second >> p[i];
    xi[i].first = xy[i].first;
    yi[i].first = xy[i].second;
    xi[i].second = yi[i].second = i;
  }

  sort(all(xi));
  sort(all(yi));

  vl ans(n + 1, INF);
  vl power3(n + 1);
  power3[0] = 1;
  rep(i, n) power3[i + 1] = power3[i] * 3;
  ll num = power3[n];

  vl l(n, INF), r(n, INF), u(n, INF), d(n, INF);
  rep(i, num) {
    int mask = i;
    vi a;
    int cnt = 0;
    rep(_, n) {
      a.push_back(mask % 3);
      if (a.back() != 0)
        cnt++;
      mask /= 3;
    }

    ll mi = -INF;
    rep(i, xi.size()) {
      int idx = xi[i].second;
      if (a[idx] == 1)
        mi = xi[i].first;
      if (xi[i].first >= 0)
        mi = max(mi, 0LL);
      l[idx] = (xi[i].first - mi);
    }
    ll ma = INF;
    rrep(i, xi.size()) {
      int idx = xi[i].second;
      if (a[idx] == 1)
        ma = xi[i].first;
      if (xi[i].first <= 0)
        ma = min(ma, 0LL);
      r[idx] = (ma - xi[i].first);
    }
    mi = -INF;
    rep(i, yi.size()) {
      int idx = yi[i].second;
      if (a[idx] == 2)
        mi = yi[i].first;
      if (yi[i].first >= 0)
        mi = max(mi, 0LL);
      d[idx] = (yi[i].first - mi);
    }
    ma = INF;
    rrep(i, yi.size()) {
      int idx = yi[i].second;
      if (a[idx] == 2)
        ma = yi[i].first;
      if (yi[i].first <= 0)
        ma = min(ma, 0LL);
      u[idx] = (ma - yi[i].first);
    }

    ll res = 0;
    rep(i, n) {
      ll dist = min({l[i], d[i], u[i], r[i]});
      res += dist * p[i];
    }
    chmin(ans[cnt], res);
  }

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