Problem p02604 (C++)

Buggy submission (status: Time Limit Exceeded):
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define tr(it, c) for (iter(c) it = (c).begin(); it != (c).end(); it++)
ll check(ll n, ll m, ll x, ll y) { return x >= 0 && x < n && y >= 0 && y < m; }
void pr() { ln; }
template <class A, class... B> void pr(const A &a, const B &...b) {
  cout << a << (sizeof...(b) ? " " : "");
  pr(b...);
}
template <class A> void PR(A a, ll n) {
  rep(i, n) cout << (i ? " " : "") << a[i];
  ln;
}
const ll MAX = 1e9 + 7, MAXL = 1LL << 61, dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1},
         dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};
typedef pair<ll, ll> P;
typedef pair<P, ll> PP;

void Main() {
  ll n;
  R n;
  PP a[n];
  rep(i, n) cin >> a[i].F.F >> a[i].F.S >> a[i].S;
  ll ans[n + 1];
  rep(i, n + 1) ans[i] = MAXL;
  vector<P> v;
  rep(i, n) {
    v.pb(P(a[i].F.F, 0));
    v.pb(P(a[i].F.S, 1));
  }
  v.pb(P(0, 0));
  v.pb(P(0, 1));
  ll d[n][v.size()];
  vector<P> b[n];
  rep(i, n) {
    rep(j, v.size()) {
      if (v[j].S == 0)
        d[i][j] = abs(a[i].F.F - v[j].F) * a[i].S;
      else
        d[i][j] = abs(a[i].F.S - v[j].F) * a[i].S;
    }
    rep(j, v.size()) b[i].pb(P(d[i][j], j));
    sort(all(b[i]));
  }
  rep(t, pow(3, n)) {
    bitset<33> e;
    ll r = t, c = 0;
    rep(i, n) {
      if (r % 3 == 1)
        e.set(i * 2), c++;
      else if (r % 3 == 2)
        e.set(i * 2 + 1), c++;
      r /= 3;
    }
    e.set(n * 2);
    e.set(n * 2 + 1);
    ll sum = 0;
    rep(i, n) {
      ll M = MAXL;
      rep(j, b[i].size()) {
        if (e.test(b[i][j].S)) {
          M = d[i][b[i][j].S];
          break;
        }
      }
      sum += M;
      if (sum > ans[c])
        goto next;
    }
    ans[c] = min(ans[c], sum);
  next:;
  }
  rep(i, n + 1) pr(ans[i]);
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  Main();
  return 0;
}


Fixed submission:
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define tr(it, c) for (iter(c) it = (c).begin(); it != (c).end(); it++)
ll check(ll n, ll m, ll x, ll y) { return x >= 0 && x < n && y >= 0 && y < m; }
void pr() { ln; }
template <class A, class... B> void pr(const A &a, const B &...b) {
  cout << a << (sizeof...(b) ? " " : "");
  pr(b...);
}
template <class A> void PR(A a, ll n) {
  rep(i, n) cout << (i ? " " : "") << a[i];
  ln;
}
const ll MAX = 1e9 + 7, MAXL = 1LL << 61, dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1},
         dy[8] = {0, 1, 0, -1, -1, 1, 1, -1};
typedef pair<ll, ll> P;
typedef pair<P, ll> PP;

void Main() {
  ll n;
  R n;
  PP a[n];
  rep(i, n) cin >> a[i].F.F >> a[i].F.S >> a[i].S;
  ll ans[n + 1];
  rep(i, n + 1) ans[i] = MAXL;
  vector<P> v;
  rep(i, n) {
    v.pb(P(a[i].F.F, 0));
    v.pb(P(a[i].F.S, 1));
  }
  v.pb(P(0, 0));
  v.pb(P(0, 1));
  ll d[n][v.size()];
  vector<P> b[n];
  rep(i, n) {
    rep(j, v.size()) {
      if (v[j].S == 0)
        d[i][j] = abs(a[i].F.F - v[j].F) * a[i].S;
      else
        d[i][j] = abs(a[i].F.S - v[j].F) * a[i].S;
    }
    rep(j, v.size()) b[i].pb(P(d[i][j], j));
    sort(all(b[i]));
  }
  rrep(t, pow(3, n)) {
    bitset<33> e;
    ll r = t, c = 0;
    rep(i, n) {
      if (r % 3 == 1)
        e.set(i * 2), c++;
      else if (r % 3 == 2)
        e.set(i * 2 + 1), c++;
      r /= 3;
    }
    e.set(n * 2);
    e.set(n * 2 + 1);
    ll sum = 0;
    rep(i, n) {
      ll M = MAXL;
      rep(j, b[i].size()) {
        if (e.test(b[i][j].S)) {
          M = d[i][b[i][j].S];
          break;
        }
      }
      sum += M;
      if (sum > ans[c])
        goto next;
    }
    ans[c] = min(ans[c], sum);
  next:;
  }
  rep(i, n + 1) pr(ans[i]);
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  Main();
  return 0;
}