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

// Marcin Knapik
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;

// #include <ext/pb_ds/assoc_container.hpp> // order_of_key
// #include <ext/pb_ds/tree_policy.hpp> // find by order
// using namespace __gnu_pbds;
// #define ordered_set tree< int , null_type,less< int >,
// rb_tree_tag,tree_order_statistics_node_update>

// const ll MAX_LL = 0xFFFFFFFFFFFFFFFF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define losuj(a, b) uniform_int_distribution<ll>(a, b)(rng)

typedef long double ld;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define pll pair<long long, long long>
#define vpll vector<pll>
#define ull unsigned long long

#define sz(a) (int)(a).size()
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define FOR(i, a) for (int i = 0; i < (a); i++)
#define f first
#define s second

template <class T> inline bool setmin(T &a, T b) {
  if (a > b)
    return a = b, 1;
  return 0;
}
template <class T> inline bool setmax(T &a, T b) {
  if (a < b)
    return a = b, 1;
  return 0;
}

template <class T> inline T fast(T a, T b, T mod) {
  ll res = 1;
  while (b) {
    if (b & 1)
      res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
template <class T> istream &operator>>(istream &os, vector<T> &container) {
  for (auto &u : container)
    os >> u;
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &container) {
  for (auto &u : container)
    os << u << " ";
  return os;
}
template <class T> inline T gcd(T a, T b) {
  while (b)
    swap(a %= b, b);
  return abs(a);
}

const ll INF = 1e9 + 7;
const ll mod = 998244353;
const ll BIG_INF = 1e18 + 7;
const ll N = 1e6 + 7;
const ll T = 1 << 20;
const ld inf = 1e18;

ll n, m, q, k, r;
ll X[15];
ll Y[15];
ll P[15];
vll ans(15, BIG_INF);

int stan[15];

ll koszt() {
  ll ret = 0;
  for (int i = 0; i < n; i++) {
    ll mini = min(abs(X[i]), abs(Y[i]));
    if (stan[i])
      mini = 0;

    for (int j = 0; j < n; j++) {
      if (mini == 0)
        break;
      if (stan[j] == 1)
        mini = min(mini, abs(X[i] - X[j]));
      if (stan[j] == 2)
        mini = min(mini, abs(Y[i] - Y[j]));
    }
    ret += P[i] * mini;
  }
  return ret;
}

int ile_bitow() {
  int ret = 0;
  for (int i = 0; i < n; i++)
    ret += stan[i] > 0;
  return ret;
}

void backtrack(int poz) {
  if (poz == n) {
    setmin(ans[ile_bitow()], koszt());
    return;
  }

  FOR(i, 3) {
    stan[poz] = i;
    backtrack(poz + 1);
  }
}

void solve() {
  cin >> n;
  FOR(i, n)
  cin >> X[i] >> Y[i] >> P[i];
  backtrack(0);
  FOR(i, n + 1)
  cout << ans[i] << '\\n';
}

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);

  q = 1;
  // cin >> q;

  for (int i = 1; i <= q; i++)
    solve();
}

Error: TLE

Fixed submission:

// Marcin Knapik
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;

// #include <ext/pb_ds/assoc_container.hpp> // order_of_key
// #include <ext/pb_ds/tree_policy.hpp> // find by order
// using namespace __gnu_pbds;
// #define ordered_set tree< int , null_type,less< int >,
// rb_tree_tag,tree_order_statistics_node_update>

// const ll MAX_LL = 0xFFFFFFFFFFFFFFFF;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define losuj(a, b) uniform_int_distribution<ll>(a, b)(rng)

typedef long double ld;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define pll pair<long long, long long>
#define vpll vector<pll>
#define ull unsigned long long

#define sz(a) (int)(a).size()
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define FOR(i, a) for (int i = 0; i < (a); i++)
#define f first
#define s second

template <class T> inline bool setmin(T &a, T b) {
  if (a > b)
    return a = b, 1;
  return 0;
}
template <class T> inline bool setmax(T &a, T b) {
  if (a < b)
    return a = b, 1;
  return 0;
}

template <class T> inline T fast(T a, T b, T mod) {
  ll res = 1;
  while (b) {
    if (b & 1)
      res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
template <class T> istream &operator>>(istream &os, vector<T> &container) {
  for (auto &u : container)
    os >> u;
  return os;
}
template <class T>
ostream &operator<<(ostream &os, const vector<T> &container) {
  for (auto &u : container)
    os << u << " ";
  return os;
}
template <class T> inline T gcd(T a, T b) {
  while (b)
    swap(a %= b, b);
  return abs(a);
}

const ll INF = 1e9 + 7;
const ll mod = 998244353;
const ll BIG_INF = 1e18 + 7;
const ll N = 1e6 + 7;
const ll T = 1 << 20;
const ld inf = 1e18;

ll n, m, q, k, r;
ll X[15];
ll Y[15];
ll P[15];
vll ans(15, BIG_INF);

int stan[15];

ll koszt() {
  ll ret = 0;
  for (int i = 0; i < n; i++) {
    ll mini = min(abs(X[i]), abs(Y[i]));

    for (int j = 0; j < n; j++) {
      if (stan[j] == 1)
        mini = min(mini, abs(X[i] - X[j]));
      if (stan[j] == 2)
        mini = min(mini, abs(Y[i] - Y[j]));
    }
    ret += P[i] * mini;
  }
  return ret;
}

int ile_bitow() {
  int ret = 0;
  for (int i = 0; i < n; i++)
    ret += stan[i] > 0;
  return ret;
}

void backtrack(int poz) {
  if (poz == n) {
    setmin(ans[ile_bitow()], koszt());
    return;
  }

  FOR(i, 3) {
    stan[poz] = i;
    backtrack(poz + 1);
  }
}

void solve() {
  cin >> n;
  FOR(i, n)
  cin >> X[i] >> Y[i] >> P[i];
  backtrack(0);
  FOR(i, n + 1)
  cout << ans[i] << '\\n';
}

signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);

  q = 1;
  // cin >> q;

  for (int i = 1; i <= q; i++)
    solve();
}