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

/*input
8
2 2 286017
3 1 262355
2 -2 213815
1 -3 224435
-2 -2 136860
-3 -1 239338
-2 2 217647
-1 3 141903
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag,
             tree_order_statistics_node_update>
    indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
// order_of_key #of elements less than x
//  find_by_order kth element
#define ld double
#define pii pair<int, int>
#define f first
#define s second
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define FILL(n, x) memset(n, x, sizeof(n))
#define ALL(_a) _a.begin(), _a.end()
#define sz(x) (int)x.size()
const ll maxn = 15 + 5;
const ll maxlg = __lg(maxn) + 2;
const ll INF64 = 4e16;
const int INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld eps = 1e-9;
#define lowb(x) x & (-x)
#define MNTO(x, y) x = min(x, (__typeof__(x))y)
#define MXTO(x, y) x = max(x, (__typeof__(x))y)
#define SORT_UNIQUE(c)                                                         \\
  (sort(c.begin(), c.end()),                                                   \\
   c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
ll mult(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll mypow(ll a, ll b) {
  if (b <= 0)
    return 1;
  ll res = 1LL;
  while (b) {
    if (b & 1)
      res = mult(res, a);
    a = mult(a, a);
    b >>= 1;
  }
  return res;
}
ll ans[maxn], n;
pii arr[maxn];
ll p[maxn];
int x[maxn], die[maxn], y[maxn];
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0);
  cin >> n;
  REP(i, n) ans[i] = INF64;
  REP(i, n) { cin >> arr[i].f >> arr[i].s >> p[i]; }
  REP(i, mypow(3, n)) {
    int z = i;
    int dd = 0, dx = 0, dy = 0;
    REP(j, n) {
      if (z % 3 == 0)
        die[dd++] = j;
      else if (z % 3 == 1)
        x[dx++] = arr[j].f;
      else
        y[dy++] = arr[j].s;
      z /= 3;
    }
    ll cst = 0;
    REP(j, dd) {
      ll dst = min(abs(arr[die[j]].f), abs(arr[die[j]].s));
      REP(z, dx) MNTO(dst, abs(arr[die[j]].f - x[z]));
      REP(z, dy) MNTO(dst, abs(arr[die[j]].s - y[z]));
      cst += dst * p[die[j]];
    }
    MNTO(ans[n - dd], cst);
  }
  REP(i, n + 1) cout << ans[i] << '\\n';
}


Error: TLE

Fixed submission:

/*input
8
2 2 286017
3 1 262355
2 -2 213815
1 -3 224435
-2 -2 136860
-3 -1 239338
-2 2 217647
-1 3 141903
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
typedef tree<ll, null_type, less_equal<ll>, rb_tree_tag,
             tree_order_statistics_node_update>
    indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
// order_of_key #of elements less than x
//  find_by_order kth element
#define ld double
#define pii pair<int, int>
#define f first
#define s second
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define FILL(n, x) memset(n, x, sizeof(n))
#define ALL(_a) _a.begin(), _a.end()
#define sz(x) (int)x.size()
const ll maxn = 15 + 5;
const ll maxlg = __lg(maxn) + 2;
const ll INF64 = 4e16;
const int INF = 0x3f3f3f3f;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld eps = 1e-9;
#define lowb(x) x & (-x)
#define MNTO(x, y) x = min(x, (__typeof__(x))y)
#define MXTO(x, y) x = max(x, (__typeof__(x))y)
#define SORT_UNIQUE(c)                                                         \\
  (sort(c.begin(), c.end()),                                                   \\
   c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
ll mult(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll mypow(ll a, ll b) {
  if (b <= 0)
    return 1;
  ll res = 1LL;
  while (b) {
    if (b & 1)
      res = mult(res, a);
    a = mult(a, a);
    b >>= 1;
  }
  return res;
}
ll ans[maxn], n;
pii arr[maxn];
ll p[maxn];
int32_t main() {
  ios::sync_with_stdio(false), cin.tie(0);
  cin >> n;
  REP(i, n) ans[i] = INF64;
  REP(i, n) { cin >> arr[i].f >> arr[i].s >> p[i]; }
  REP(i, mypow(3, n)) {
    int z = i;
    vector<int> die, x, y;
    REP(j, n) {
      if (z % 3 == 0)
        die.pb(j);
      else if (z % 3 == 1)
        x.pb(arr[j].f);
      else
        y.pb(arr[j].s);
      z /= 3;
    }
    if (sz(die) == 0)
      continue;
    ll cst = 0;
    REP(j, sz(die)) {
      ll dst = min(abs(arr[die[j]].f), abs(arr[die[j]].s));
      for (int z : x)
        MNTO(dst, abs(arr[die[j]].f - z));
      for (int z : y)
        MNTO(dst, abs(arr[die[j]].s - z));
      cst += dst * p[die[j]];
    }
    MNTO(ans[n - sz(die)], cst);
  }
  REP(i, n + 1) cout << ans[i] << '\\n';
}