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

#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;

typedef tree<ll, null_type, less<ll>, rb_tree_tag,
             tree_order_statistics_node_update>
    orderedSet;

#define pb push_back
#define F first
#define S second
#define all(a) (a).begin(), (a).end()

#define for1(i0, l0, r0) for (int i0 = l0; i0 < r0; ++i0)
#define for2(i0, l0, r0) for (int i0 = l0; i0 <= r0; ++i0)
#define forn(i0, n0) for (int i0 = 0; i0 < n0; ++i0)
#define forn1(i0, n0) for (int i0 = 1; i0 < n0; ++i0)
#define forr(i0, n0) for (int i0 = n0; i0 >= 0; --i0)
#define forr1(i0, r0, l0) for (int i0 = r0; i0 > l0; --i0)
#define forr2(i0, r0, l0) for (int i0 = r0; i0 >= l0; --i0)

#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define relaxMax(a, b) a = max(a, b)
#define relaxMin(a, b) a = min(a, b)

typedef long double ld;
#define ui unsigned int
#define ull unsigned long long

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<ld> vld;
typedef vector<bool> vb;
typedef vector<string> vs;

typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pdd> vpdd;

typedef vector<vi> vvi;
typedef vector<vd> vvd;
typedef vector<vll> vvll;
typedef vector<vb> vvb;

#define vpss vector<pss>
#define vvs vector<vs>
#define vvpii vector<vpii>
#define vvpll vector<vpll>
#define vpt vector<pt>
#define vvvi vector<vvi>
#define vsi vector<set<int>>
#define ss second
#define ff first

#define printvi(arr)                                                           \\
  for (int x0 : arr)                                                           \\
    cout << x0 << ' ';                                                         \\
  cout << '\\n';
#define printvll(arr)                                                          \\
  for (ll x0 : arr)                                                            \\
    cout << x0 << ' ';                                                         \\
  cout << '\\n';
#define printpair(pair0) cout << pair0.F << ' ' << pair0.S << '\\n';
#define printvp(arr)                                                           \\
  for (auto pair0 : arr)                                                       \\
    printpair(pair0);
#define initArray(arr, N0, X0) memset(arr, X0, N0 * sizeof(int))
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void init() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // cout.precision(16);
  // freopen("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
}

void solve() {
  int n;
  cin >> n;
  vvll a(n, vll(3));
  forn(i, n) { forn(j, 3) cin >> a[i][j]; }
  int N = 1 << n;
  vvll fx(n, vll(N)), fy(n, vll(N));
  forn(mask, N) {
    vll x, y;
    forn(i, n) {
      if (mask & (1 << i)) {
        x.pb(a[i][0]);
        y.pb(a[i][1]);
      }
    }
    forn(i, n) {
      ll dx = abs(a[i][0]), dy = abs(a[i][1]);
      for (ll X : x)
        dx = min(dx, abs(X - a[i][0]));
      for (ll Y : y)
        dy = min(dy, abs(Y - a[i][1]));
      fx[i][mask] = dx, fy[i][mask] = dy;
    }
  }
  int x = 1;
  forn(i, n) x *= 3;
  vll ans(n + 1, 1e18);
  forn(mask, x) {
    int y = mask;
    int maskx = 0, masky = 0, cnt = 0;
    forn(i, n) {
      int m = y % 3;
      y /= 3;
      if (m > 0)
        cnt++;
      if (m == 1)
        maskx += (1 << i);
      if (m == 2)
        masky += (1 << i);
    }
    ll f = 0;
    forn(i, n) f += min(fx[i][maskx], fy[i][masky]) * a[i][2];
    ans[cnt] = min(ans[cnt], f);
  }
  for (ll x : ans)
    cout << x << '\\n';
}

bool multitest = false;

int main() {
  init();
  int t = 1;
  if (multitest)
    cin >> t;
  forn(i, t) solve();
}

Error: TLE

Fixed submission:

#pragma GCC optimize("Ofast")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;

typedef tree<ll, null_type, less<ll>, rb_tree_tag,
             tree_order_statistics_node_update>
    orderedSet;

#define pb push_back
#define F first
#define S second
#define all(a) (a).begin(), (a).end()

#define for1(i0, l0, r0) for (int i0 = l0; i0 < r0; ++i0)
#define for2(i0, l0, r0) for (int i0 = l0; i0 <= r0; ++i0)
#define forn(i0, n0) for (int i0 = 0; i0 < n0; ++i0)
#define forn1(i0, n0) for (int i0 = 1; i0 < n0; ++i0)
#define forr(i0, n0) for (int i0 = n0; i0 >= 0; --i0)
#define forr1(i0, r0, l0) for (int i0 = r0; i0 > l0; --i0)
#define forr2(i0, r0, l0) for (int i0 = r0; i0 >= l0; --i0)

#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define relaxMax(a, b) a = max(a, b)
#define relaxMin(a, b) a = min(a, b)

typedef long double ld;
#define ui unsigned int
#define ull unsigned long long

typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
typedef pair<string, string> pss;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<ld> vld;
typedef vector<bool> vb;
typedef vector<string> vs;

typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<pdd> vpdd;

typedef vector<vi> vvi;
typedef vector<vd> vvd;
typedef vector<vll> vvll;
typedef vector<vb> vvb;

#define vpss vector<pss>
#define vvs vector<vs>
#define vvpii vector<vpii>
#define vvpll vector<vpll>
#define vpt vector<pt>
#define vvvi vector<vvi>
#define vsi vector<set<int>>
#define ss second
#define ff first

#define printvi(arr)                                                           \\
  for (int x0 : arr)                                                           \\
    cout << x0 << ' ';                                                         \\
  cout << '\\n';
#define printvll(arr)                                                          \\
  for (ll x0 : arr)                                                            \\
    cout << x0 << ' ';                                                         \\
  cout << '\\n';
#define printpair(pair0) cout << pair0.F << ' ' << pair0.S << '\\n';
#define printvp(arr)                                                           \\
  for (auto pair0 : arr)                                                       \\
    printpair(pair0);
#define initArray(arr, N0, X0) memset(arr, X0, N0 * sizeof(int))
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void init() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  // cout.precision(16);
  // freopen("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
}

void solve() {
  int n;
  cin >> n;
  vvll a(n, vll(3));
  forn(i, n) { forn(j, 3) cin >> a[i][j]; }
  int x = 1;
  forn(i, n) x *= 3;
  vll ans(n + 1, 2e15);
  forn(mask, x) {
    int y = mask;
    vi h, v;
    int cnt = 0;
    forn(i, n) {
      int m = y % 3;
      y /= 3;
      if (m > 0)
        cnt++;
      if (m == 1)
        h.pb(a[i][1]);
      if (m == 2)
        v.pb(a[i][0]);
    }
    ll f = 0;
    forn(i, n) {
      ll dh = abs(a[i][1]), dv = abs(a[i][0]);
      for (int X : v)
        dv = min(dv, abs(X - a[i][0]));
      for (int Y : h)
        dh = min(dh, abs(Y - a[i][1]));
      f += min(dh, dv) * a[i][2];
    }
    ans[cnt] = min(ans[cnt], f);
  }
  for (ll x : ans)
    cout << x << '\\n';
}

bool multitest = false;

int main() {
  init();
  int t = 1;
  if (multitest)
    cin >> t;
  forn(i, t) solve();
}