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

///////////////////////////////////////////////////////////////////////////////

#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>

using namespace std;

///////////////////////////////////////////////////////////////////////////////

#define DEBUG 0

#define pb push_back
#define V vector
#define M unordered_map
#define S static

#define rep(i, n) for (ll i = 0LL; i < n; ++i)
#define srep(i, s, n) for (ll i = s; i < n; ++i)
#define rrep(i, n) for (ll i = n - 1LL; i >= 0LL; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define CIN(x)                                                                 \\
  do {                                                                         \\
    assert(!cin.eof());                                                        \\
    cin >> x;                                                                  \\
    assert(!cin.fail());                                                       \\
  } while (0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG

typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T>>;

///////////////////////////////////////////////////////////////////////////////

template <typename TT, typename T> T get_m(M<TT, T> &m, TT k, T default_value) {
  if (m.find(k) == m.end())
    return m[k] = default_value;
  return m[k];
}

template <typename TT, typename T> void incr_m(M<TT, T> &m, TT k) {
  if (m.find(k) == m.end())
    m[k] = 0;
  m[k]++;
}

template <typename TT, typename T> void incr_m(map<TT, T> &m, TT k) {
  if (m.find(k) == m.end())
    m[k] = 0;
  m[k]++;
}

void llin(ll &a) { CIN(a); }

void llinl1(V<ll> &v, ll count) {
  for (ll i = 0LL; i < count; ++i) {
    ll a;
    CIN(a);
    v.push_back(a);
  }
}

void llinl2(V<t2> &v, ll count) {
  for (ll i = 0LL; i < count; ++i) {
    ll a, b;
    CIN(a >> b);
    v.push_back(t2(a, b));
  }
}

void llinl3(V<t3> &v, ll count) {
  for (ll i = 0LL; i < count; ++i) {
    ll a, b, c;
    CIN(a >> b >> c);
    v.push_back(t3(a, b, c));
  }
}

void llinl4(V<t4> &v, ll count) {
  for (ll i = 0LL; i < count; ++i) {
    ll a, b, c, d;
    CIN(a >> b >> c >> d);
    v.push_back(t4(a, b, c, d));
  }
}

void llina(V<ll> &v, ll count) { llinl1(v, count); }

template <typename T> void sort(V<T> &v) { sort(v.begin(), v.end()); }

template <typename T> void sort_reverse(V<T> &v) {
  sort(v.begin(), v.end(), greater<T>());
}

template <typename T> void _debug_print(T x) { cout << x << endl; }

void _debug_print(const t2 &x) {
  ll x1 = get<0>(x);
  ll x2 = get<1>(x);
  cout << "-- " << x1 << " -- " << x2 << endl;
}

void _debug_print(const t3 &x) {
  ll x1 = get<0>(x);
  ll x2 = get<1>(x);
  ll x3 = get<2>(x);
  cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}

void _debug_print(const t4 &x) {
  ll x1 = get<0>(x);
  ll x2 = get<1>(x);
  ll x3 = get<2>(x);
  ll x4 = get<3>(x);
  cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << " -- " << x4 << endl;
}

template <typename T> void _debug_print(T xarray[], ll n) {
  rep(i, n) _debug_print(xarray[i]);
}

template <typename T> void _debug_print(const V<T> &xlist) {
  for (auto x : xlist) {
    cout << "-- ";
    _debug_print(x);
  }
}

template <typename T> void _debug_print(const set<T> &xset) {
  for (auto x : xset) {
    cout << "-- ";
    _debug_print(x);
  }
}

template <typename TT, typename T> void _debug_print(const M<TT, T> &xlist) {
  for (auto x : xlist) {
    TT k = x.first;
    T v = x.second;
    cout << "====" << endl;
    cout << "K=";
    _debug_print(k);
    cout << "V=";
    _debug_print(v);
  }
}

template <typename TT, typename T> void _debug_print(const map<TT, T> &xlist) {
  for (auto x : xlist) {
    TT k = x.first;
    T v = x.second;
    cout << "====" << endl;
    cout << "K=";
    _debug_print(k);
    cout << "V=";
    _debug_print(v);
  }
}

void _debug_print_time(const char *prefix) {
  struct timeval tv;
  gettimeofday(&tv, NULL);
  struct tm *tm = localtime(&tv.tv_sec);
  debug_printf("-- %s %02d:%02d:%02d.%06ld\\n", prefix, tm->tm_hour, tm->tm_min,
               tm->tm_sec, tv.tv_usec);
}

///////////////////////////////////////////////////////////////////////////////

void _main();
int main() {
  cout << setprecision(12);
#if !DEBUG
  ios::sync_with_stdio(false);
  cin.tie(0);
#endif

  _main();
  return 0;
}

void _main() {
  ll n;
  llin(n);
  V<t3> xyplist;
  llinl3(xyplist, n);

  S ll xptns[40000][16];
  rep(ptn, (1LL << n)) {
    rep(i, n) xptns[ptn][i] = abs(get<0>(xyplist[i]));
    rep(i, n) rep(j, n) {
      if (ptn & (1LL << i)) {
        xptns[ptn][j] =
            min(xptns[ptn][j], abs(get<0>(xyplist[i]) - get<0>(xyplist[j])));
      }
    }
  }

  S ll yptns[40000][16];
  rep(ptn, (1LL << n)) {
    rep(i, n) yptns[ptn][i] = abs(get<1>(xyplist[i]));
    rep(i, n) rep(j, n) {
      if (ptn & (1LL << i)) {
        yptns[ptn][j] =
            min(yptns[ptn][j], abs(get<1>(xyplist[i]) - get<1>(xyplist[j])));
      }
    }
  }

  ll end = 1;
  rep(i, n) end *= 3LL;
  ll anslist[20];
  rep(i, 20) anslist[i] = 1e18;
  ll tasks[20] = {};

  rep(ptn, end) {

    if (ptn % 1000000LL == 0)
      _debug_print_time("xxx");

    ll cnt = 0;
    ll xptn = 0;
    ll yptn = 0;
    bool ok[17] = {};

    rep(i, n) {
      if (tasks[i] == 0)
        continue;
      else if (tasks[i] == 1)
        xptn |= (1LL << i);
      else if (tasks[i] == 2)
        yptn |= (1LL << i);
      cnt++;
      ok[i] = true;
    }

    debug_printf("ptn=%lld cnt=%lld\\n", ptn, cnt);

    ll total = 0;
    rep(i, n) {
      if (ok[i])
        continue;
      ll p = get<2>(xyplist[i]);
      ll d = 1e18;

      d = min(d, xptns[xptn][i]);
      d = min(d, yptns[yptn][i]);
      total += d * p;
    }

    anslist[cnt] = min(anslist[cnt], total);

    rep(i, n) {
      tasks[i]++;
      if (tasks[i] < 3LL)
        break;
      tasks[i] %= 3LL;
    }
  }

  rep(i, n + 1) cout << anslist[i] << endl;
}

///////////////////////////////////////////////////////////////////////////////


Error: TLE

Fixed submission:

///////////////////////////////////////////////////////////////////////////////

#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>

using namespace std;

///////////////////////////////////////////////////////////////////////////////

#define DEBUG 0

#define pb push_back
#define V vector
#define M unordered_map
#define S static

#define rep(i, n) for (ll i = 0LL; i < n; ++i)
#define srep(i, s, n) for (ll i = s; i < n; ++i)
#define rrep(i, n) for (ll i = n - 1LL; i >= 0LL; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define CIN(x)                                                                 \\
  do {                                                                         \\
    assert(!cin.eof());                                                        \\
    cin >> x;                                                                  \\
    assert(!cin.fail());                                                       \\
  } while (0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG

typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T>>;

///////////////////////////////////////////////////////////////////////////////

template <typename TT, typename T> T get_m(M<TT, T> &m, TT k, T default_value) {
  if (m.find(k) == m.end())
    return m[k] = default_value;
  return m[k];
}

template <typename TT, typename T> void incr_m(M<TT, T> &m, TT k) {
  if (m.find(k) == m.end())
    m[k] = 0;
  m[k]++;
}

template <typename TT, typename T> void incr_m(map<TT, T> &m, TT k) {
  if (m.find(k) == m.end())
    m[k] = 0;
  m[k]++;
}

void llin(ll &a) { CIN(a); }

void llinl1(V<ll> &v, ll count) {
  for (ll i = 0LL; i < count; ++i) {
    ll a;
    CIN(a);
    v.push_back(a);
  }
}

void llinl2(V<t2> &v, ll count) {
  for (ll i = 0LL; i < count; ++i) {
    ll a, b;
    CIN(a >> b);
    v.push_back(t2(a, b));
  }
}

void llinl3(V<t3> &v, ll count) {
  for (ll i = 0LL; i < count; ++i) {
    ll a, b, c;
    CIN(a >> b >> c);
    v.push_back(t3(a, b, c));
  }
}

void llinl4(V<t4> &v, ll count) {
  for (ll i = 0LL; i < count; ++i) {
    ll a, b, c, d;
    CIN(a >> b >> c >> d);
    v.push_back(t4(a, b, c, d));
  }
}

void llina(V<ll> &v, ll count) { llinl1(v, count); }

template <typename T> void sort(V<T> &v) { sort(v.begin(), v.end()); }

template <typename T> void sort_reverse(V<T> &v) {
  sort(v.begin(), v.end(), greater<T>());
}

template <typename T> void _debug_print(T x) { cout << x << endl; }

void _debug_print(const t2 &x) {
  ll x1 = get<0>(x);
  ll x2 = get<1>(x);
  cout << "-- " << x1 << " -- " << x2 << endl;
}

void _debug_print(const t3 &x) {
  ll x1 = get<0>(x);
  ll x2 = get<1>(x);
  ll x3 = get<2>(x);
  cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}

void _debug_print(const t4 &x) {
  ll x1 = get<0>(x);
  ll x2 = get<1>(x);
  ll x3 = get<2>(x);
  ll x4 = get<3>(x);
  cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << " -- " << x4 << endl;
}

template <typename T> void _debug_print(T xarray[], ll n) {
  rep(i, n) _debug_print(xarray[i]);
}

template <typename T> void _debug_print(const V<T> &xlist) {
  for (auto x : xlist) {
    cout << "-- ";
    _debug_print(x);
  }
}

template <typename T> void _debug_print(const set<T> &xset) {
  for (auto x : xset) {
    cout << "-- ";
    _debug_print(x);
  }
}

template <typename TT, typename T> void _debug_print(const M<TT, T> &xlist) {
  for (auto x : xlist) {
    TT k = x.first;
    T v = x.second;
    cout << "====" << endl;
    cout << "K=";
    _debug_print(k);
    cout << "V=";
    _debug_print(v);
  }
}

template <typename TT, typename T> void _debug_print(const map<TT, T> &xlist) {
  for (auto x : xlist) {
    TT k = x.first;
    T v = x.second;
    cout << "====" << endl;
    cout << "K=";
    _debug_print(k);
    cout << "V=";
    _debug_print(v);
  }
}

void _debug_print_time(const char *prefix) {
  struct timeval tv;
  gettimeofday(&tv, NULL);
  struct tm *tm = localtime(&tv.tv_sec);
  printf("-- %s %02d:%02d:%02d.%06ld\\n", prefix, tm->tm_hour, tm->tm_min,
         tm->tm_sec, tv.tv_usec);
}

///////////////////////////////////////////////////////////////////////////////

void _main();
int main() {
  cout << setprecision(12);
#if !DEBUG
  ios::sync_with_stdio(false);
  cin.tie(0);
#endif

  _main();
  return 0;
}

void _main() {
  ll n;
  llin(n);
  V<t3> xyplist;
  llinl3(xyplist, n);

  ll end = 1;
  rep(i, n) end *= 3LL;

  ll anslist[20];
  rep(i, 20) anslist[i] = 1e18;

  rep(ptn, end) {

    set<ll> xs;
    xs.insert(-1e17);
    xs.insert(0);
    xs.insert(1e17);
    set<ll> ys;
    ys.insert(-1e17);
    ys.insert(0);
    ys.insert(1e17);
    ll cnt = 0;
    ll lptn = ptn;

    rep(i, n) {
      ll x = get<0>(xyplist[i]);
      ll y = get<1>(xyplist[i]);
      if (lptn % 3LL == 0) {
        lptn /= 3LL;
        continue;
      } else if (lptn % 3LL == 1)
        xs.insert(x);
      else if (lptn % 3LL == 2)
        ys.insert(y);
      lptn /= 3LL;
      cnt++;
    }

    debug_printf("ptn=%lld cnt=%lld\\n", ptn, cnt);

    ll total = 0;
    for (auto xyp : xyplist) {
      ll x = get<0>(xyp);
      ll y = get<1>(xyp);
      ll p = get<2>(xyp);
      ll d = 1e18;

      auto iter_x = xs.lower_bound(x);
      d = min(d, abs(x - *iter_x));
      iter_x--;
      d = min(d, abs(x - *iter_x));

      auto iter_y = ys.lower_bound(y);
      d = min(d, abs(y - *iter_y));
      iter_y--;
      d = min(d, abs(y - *iter_y));

      total += d * p;
    }

    anslist[cnt] = min(anslist[cnt], total);
  }

  rep(i, n + 1) cout << anslist[i] << endl;
}

///////////////////////////////////////////////////////////////////////////////