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

#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define all(V) V.begin(), V.end()
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX / 2;
constexpr lint LINF = LLONG_MAX / 2;
constexpr double eps = DBL_EPSILON;
constexpr double PI = 3.141592653589793238462643383279;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
inline lint gcd(lint a, lint b) {
  while (b) {
    lint c = a;
    a = b;
    b = c % b;
  }
  return a;
}
inline lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
bool isprime(lint n) {
  if (n == 1)
    return false;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0)
      return false;
  }
  return true;
}
template <typename T> T mypow(T a, lint b) {
  if (!b)
    return T(1);
  if (b & 1)
    return mypow(a, b - 1) * a;
  T memo = mypow(a, b >> 1);
  return memo * memo;
}
lint modpow(lint a, lint b, lint m) {
  if (!b)
    return 1;
  if (b & 1)
    return modpow(a, b - 1, m) * a % m;
  lint memo = modpow(a, b >> 1, m);
  return memo * memo % m;
}
template <typename T> void printArray(std::vector<T> &vec) {
  rep(i, vec.size() - 1) std::cout << vec[i] << " ";
  std::cout << vec.back() << std::endl;
}
template <typename T> void printArray(T l, T r) {
  T rprev = r;
  rprev--;
  for (T i = l; i != rprev; i++) {
    std::cout << *i << " ";
  }
  std::cout << *rprev << std::endl;
}
#line 2 "main.cpp"
int n, x[15], y[15], p[15], cx[15], cy[15];
int dist[2][15][66000];
lint ans[16];
int main() {
  std::cin >> n;
  rep(i, n) std::cin >> x[i] >> y[i] >> p[i];
  int m = mypow(3, n);
  std::vector<int> allx, ally;
  allx.emplace_back(0);
  ally.emplace_back(0);
  rep(i, n) {
    allx.emplace_back(x[i]);
    ally.emplace_back(y[i]);
  }
  std::sort(all(allx));
  std::sort(all(ally));
  allx.erase(std::unique(all(allx)), allx.end());
  ally.erase(std::unique(all(ally)), ally.end());
  rep(i, n) {
    cx[i] = std::lower_bound(all(allx), x[i]) - allx.begin();
    cy[i] = std::lower_bound(all(ally), y[i]) - ally.begin();
  }
  rep(i, 2) {
    rep(j, n) {
      rep(k, 1 << (std::max(allx.size(), ally.size()))) { dist[i][j][k] = INF; }
    }
  }
  rep(i, 1 << allx.size()) {
    rep(j, allx.size()) {
      if (i & (1 << j)) {
        rep(k, n) { chmin(dist[0][k][i], std::abs(x[k] - allx[j])); }
      }
    }
  }
  rep(i, 1 << ally.size()) {
    rep(j, ally.size()) {
      if (i & (1 << j)) {
        rep(k, n) { chmin(dist[1][k][i], std::abs(y[k] - ally[j])); }
      }
    }
  }
  std::fill(ans, ans + n + 1, LINF);
  rep(i, m) {
    int ni = i, xbit = 0, ybit = 0, lines = 0;
    rep(j, n) {
      if (ni % 3 == 1) {
        xbit |= 1 << cx[j];
        lines++;
      }
      if (ni % 3 == 2) {
        ybit |= 1 << cy[j];
        lines++;
      }
      ni /= 3;
    }
    lint res = 0;
    rep(j, n) {
      res += (lint)std::min({dist[0][j][xbit], dist[1][j][ybit], std::abs(x[j]),
                             std::abs(y[j])}) *
             p[j];
    }
    chmin(ans[lines], res);
  }
  rep(i, n + 1) std::cout << ans[i] << std::endl;
  return 0;
}

Error: TLE

Fixed submission:

#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp"
#define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define all(V) V.begin(), V.end()
typedef long long lint;
typedef unsigned long long ulint;
typedef std::pair<int, int> P;
typedef std::pair<lint, lint> LP;
constexpr int INF = INT_MAX / 2;
constexpr lint LINF = LLONG_MAX / 2;
constexpr double eps = DBL_EPSILON;
constexpr double PI = 3.141592653589793238462643383279;
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <class T, class U> inline bool chmax(T &lhs, const U &rhs) {
  if (lhs < rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
template <class T, class U> inline bool chmin(T &lhs, const U &rhs) {
  if (lhs > rhs) {
    lhs = rhs;
    return 1;
  }
  return 0;
}
inline lint gcd(lint a, lint b) {
  while (b) {
    lint c = a;
    a = b;
    b = c % b;
  }
  return a;
}
inline lint lcm(lint a, lint b) { return a / gcd(a, b) * b; }
bool isprime(lint n) {
  if (n == 1)
    return false;
  for (int i = 2; i * i <= n; i++) {
    if (n % i == 0)
      return false;
  }
  return true;
}
template <typename T> T mypow(T a, lint b) {
  if (!b)
    return T(1);
  if (b & 1)
    return mypow(a, b - 1) * a;
  T memo = mypow(a, b >> 1);
  return memo * memo;
}
lint modpow(lint a, lint b, lint m) {
  if (!b)
    return 1;
  if (b & 1)
    return modpow(a, b - 1, m) * a % m;
  lint memo = modpow(a, b >> 1, m);
  return memo * memo % m;
}
template <typename T> void printArray(std::vector<T> &vec) {
  rep(i, vec.size() - 1) std::cout << vec[i] << " ";
  std::cout << vec.back() << std::endl;
}
template <typename T> void printArray(T l, T r) {
  T rprev = r;
  rprev--;
  for (T i = l; i != rprev; i++) {
    std::cout << *i << " ";
  }
  std::cout << *rprev << std::endl;
}
#line 2 "main.cpp"
int n, x[15], y[15], p[15];
int dist[2][15][66000];
lint ans[16];
int main() {
  std::cin >> n;
  rep(i, n) std::cin >> x[i] >> y[i] >> p[i];
  int m = mypow(3, n);
  std::vector<int> allx, ally, nx, ny;
  allx.emplace_back(0);
  ally.emplace_back(0);
  rep(i, n) {
    allx.emplace_back(x[i]);
    ally.emplace_back(y[i]);
  }
  std::sort(all(allx));
  std::sort(all(ally));
  allx.erase(std::unique(all(allx)), allx.end());
  ally.erase(std::unique(all(ally)), ally.end());
  rep(i, 2) {
    rep(j, n) {
      rep(k, 1 << (std::max(allx.size(), ally.size()))) { dist[i][j][k] = INF; }
    }
  }
  rep(i, 1 << allx.size()) {
    rep(j, allx.size()) {
      if (i & (1 << j)) {
        rep(k, n) { chmin(dist[0][k][i], std::abs(x[k] - allx[j])); }
      }
    }
  }
  rep(i, 1 << ally.size()) {
    rep(j, ally.size()) {
      if (i & (1 << j)) {
        rep(k, n) { chmin(dist[1][k][i], std::abs(y[k] - ally[j])); }
      }
    }
  }
  std::fill(ans, ans + n + 1, LINF);
  rep(i, m) {
    int ni = i;
    nx.clear();
    ny.clear();
    nx.emplace_back(0);
    ny.emplace_back(0);
    rep(j, n) {
      if (ni % 3 == 1)
        nx.emplace_back(x[j]);
      if (ni % 3 == 2)
        ny.emplace_back(y[j]);
      ni /= 3;
    }
    int lines = nx.size() + ny.size() - 2;
    std::sort(all(nx));
    std::sort(all(ny));
    nx.erase(std::unique(all(nx)), nx.end());
    ny.erase(std::unique(all(ny)), ny.end());
    int nowx = 0, xbit = 0, nowy = 0, ybit = 0;
    rep(j, allx.size()) {
      if (nowx != nx.size() && nx[nowx] == allx[j]) {
        xbit += 1 << j;
        nowx++;
      }
    }
    rep(j, ally.size()) {
      if (nowy != ny.size() && ny[nowy] == ally[j]) {
        ybit += 1 << j;
        nowy++;
      }
    }
    lint res = 0;
    rep(j, n) {
      res += (lint)std::min(dist[0][j][xbit], dist[1][j][ybit]) * p[j];
    }
    chmin(ans[lines], res);
  }
  rep(i, n + 1) std::cout << ans[i] << std::endl;
  return 0;
}