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

#include <bits/stdc++.h>
using namespace std;
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
////
//    #pragma GCC optimize("unroll-loops")
//    #pragma GCC optimize("Ofast")
//    #pragma GCC optimize("-O3")
//    #pragma GCC optimize("no-stack-protector")
//    #pragma GCC optimize("fast-math")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
// #define LOCAL
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x)                                                                 \\
  sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<(    \\
            c i) {
sim > struct rge {
  c b, e;
};
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifndef LOCAL
  ~debug() { cerr << endl; }
  eni(!=) cerr << boolalpha << i;
  ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
  ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
  *this << "[";
  for (auto it = d.b; it != d.e; ++it)
    *this << ", " + 2 * (it == d.b) << *it;
  ris << "]";
}
#else
  sim dor(const c &) { ris; }
#endif
}
;
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define fi first
#define f first
#define se second
#define s second
#define vi_a vector<int> a;
#define p_b push_back
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
#define ll long long
typedef unsigned long long ull;
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define m_p make_pair
#define fast_io                                                                \\
  cin.tie(0);                                                                  \\
  cout.tie(0);                                                                 \\
  ios_base::sync_with_stdio(0);
#define all(x) x.begin(), x.end()
#define getfiles                                                               \\
  ifstream cin("input.txt");                                                   \\
  ofstream cout("output.txt");
#define pw(x) (1ll << x)
#define sz(x) (int)x.size()
#define endl "\\n"
#define rall(x) x.rbegin(), x.rend()
#define len(a) (ll) a.size()
#define rep(x, l, r) for (ll x = l; x < r; x++)

// using namespace __gnu_pbds;
ld eps = (ld)1 / 1e6;
const ld pi = 3.14159265359;
ll inf = 1e18, mod1 = 1e9 + 7;
ll sqr(ll a) { return a * a; }
ll qb(ll a) { return a * a * a; }
ll gcd(ll a, ll b) { return !a ? b : gcd(b % a, a); }
ll binpow(ll a, ll b, ll mod) {
  return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod
                    : sqr(binpow(a, b / 2, mod)) % mod)
           : 1;
}
ll binmult(ll a, ll b, ll mod) {
  return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod
                    : (2 * binmult(a, b / 2, mod)) % mod)
           : 0;
}
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
const ll R = 1e4;
const ll tx[4] = {0, 0, -1, 1};
const ll ty[4] = {-1, 1, 0, 0};
const char rev_to[4] = {'E', 'W', 'N', 'S'};
const int N = 16 + 1;
const int M = 1e9 + 7;
const int Y = 1;
const int X = 0;
// typedef
// tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update> st;
auto rnd = bind(uniform_int_distribution<ll>(1, 125), mt19937(time(0)));
void bad() {
  cout << -1;
  exit(0);
}
int n, id1, id2, ind, c;
pii a[N];
int p1[N], p2[N], p[N];
ll ans[N], s;
signed main() {
  fast_io;
  cin >> n;
  int g = 1;
  for (int i = 0; i < n; i++) {
    cin >> a[i].f >> a[i].s >> p[i];
    ans[i] = inf;
    g *= 3;
  }
  ans[n] = inf;
  for (int mask = 0; mask < g; mask++) {
    id1 = 0, id2 = 0, ind = 0, s = 0;
    c = mask;
    while (c) {
      if (c % 3 == 1)
        p1[id1++] = a[ind].f;
      else if (c % 3 == 2)
        p2[id2++] = a[ind].s;
      ind++;
      c /= 3;
    }
    for (int i = 0; i < n; i++) {
      int mn = min(abs(a[i].f), abs(a[i].s));
      for (int k = 0; k < id1; k++)
        mn = min(mn, abs(a[i].f - p1[k]));
      for (int k = 0; k < id2; k++)
        mn = min(mn, abs(a[i].s - p2[k]));
      s += 1ll * mn * p[i];
    }
    ans[id1 + id2] = min(ans[id1 + id2], s);
  }
  for (int i = 0; i <= n; i++)
    cout << ans[i] << '\\n';
  return 0;
}
/*
0 0 0
2 1 3
3 2 7
1 3 8
1 4 2
3 5 3

/
*/


Error: TLE

Fixed submission:

// #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
typedef long long ll;
////////////////////////////////???????????????CHECK THIS
///OUT???????????????//////////////////////////////
#define pii pair<int, int>
#define endl "\\n"
const int N = 16 + 1;
const int M = 1e9 + 7;
const ll inf = 1e18;
int n, id1, id2, ind, c, p1[N], p2[N], p[N], x[N], y[N];
ll ans[N], s;
signed main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  cin >> n;
  int g = 1;
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> y[i] >> p[i];
    ans[i] = inf;
    g *= 3;
  }
  ans[n] = inf;
  for (int mask = 0; mask < g; mask++) {
    id1 = id2 = ind = s = 0;
    c = mask;
    while (c > 0 && (id1 + id2) < n) {
      if (c % 3 == 1)
        p1[id1++] = x[ind];
      else if (c % 3 == 2)
        p2[id2++] = y[ind];
      ind++;
      c /= 3;
    }
    for (int i = 0; i < n; i++) {
      int mn = min(abs(x[i]), abs(y[i]));
      for (int k = 0; k < id1; k++)
        mn = min(mn, abs(x[i] - p1[k]));
      for (int k = 0; k < id2; k++)
        mn = min(mn, abs(y[i] - p2[k]));
      s += 1ll * mn * p[i];
    }
    ans[id1 + id2] = min(ans[id1 + id2], s);
  }
  for (int i = 0; i <= n; i++)
    cout << ans[i] << "\\n";
  return 0;
}
/*

/
*/