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

#include <bits/stdc++.h>

//    #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
// #define inf  998244353

#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define pb push_back
#define EPS (1e-8)

int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
public:
  int x;
  int y, z;
  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    return z < p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    return z > p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};

class pa4 {
public:
  int x;
  int y, z, w;
  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    if (z != p.z)
      return z < p.z;
    return w < p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    if (z != p.z)
      return z > p.z;
    return w > p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
public:
  int x, y;
  pa2(int x = 0, int y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};

string itos(int i) {
  ostringstream s;
  s << i;
  return s.str();
}

int Gcd(int v, int b) {
  if (v == 0)
    return b;
  if (b == 0)
    return v;
  if (v > b)
    return Gcd(b, v);
  if (v == b)
    return b;
  if (b % v == 0)
    return v;
  return Gcd(v, b % v);
}

int mod;
int extgcd(int a, int b, int &x, int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int d = extgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
pa operator+(const pa &l, const pa &r) {
  return {l.first + r.first, l.second + r.second};
}
pa operator-(const pa &l, const pa &r) {
  return {l.first - r.first, l.second - r.second};
}
int beki(int wa, int rr, int warukazu) {
  if (rr == 0)
    return 1 % warukazu;
  if (rr == 1)
    return wa % warukazu;
  wa %= warukazu;
  if (rr % 2 == 1)
    return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;
  ll zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}

int pr[100000];
int inv[100000];

int comb(int nn, int rr) {
  if (rr < 0 || rr > nn || nn < 0)
    return 0;
  int r = pr[nn] * inv[rr];
  r %= mod;
  r *= inv[nn - rr];
  r %= mod;
  return r;
}

void gya(int ert) {
  pr[0] = 1;
  for (int i = 1; i <= ert; i++) {
    pr[i] = ((ll)pr[i - 1] * i) % mod;
  }
  inv[ert] = beki(pr[ert], mod - 2, mod);
  for (int i = ert - 1; i >= 0; i--) {
    inv[i] = (ll)inv[i + 1] * (i + 1) % mod;
  }
}

//   cin.tie(0);
//	ios::sync_with_stdio(false);
// priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
// sort(ve.begin(),ve.end(),greater<int>());
//   mt19937(clock_per_sec);
//  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;

int x[20], y[20], p[20];
vector<pa> px, py;
vector<int> ve;
int inff;

int mae1[1 << 15][20];
int mae2[1 << 15][20];

void mae(int n) {
  for (int i = 0; i < (1 << n); i++) {
    vector<int> t;
    t.pb(0);
    for (int j = 0; j < n; j++)
      if (i & (1 << j)) {
        t.pb(x[j]);
      }
    for (int j = 0; j < n; j++) {
      int ima = inff;
      for (auto v : t)
        ima = min(abs(x[j] - v), ima);
      mae1[i][j] = ima;
    }
  }
  for (int i = 0; i < (1 << n); i++) {
    vector<int> t;
    t.pb(0);
    for (int j = 0; j < n; j++)
      if (i & (1 << j)) {
        t.pb(y[j]);
      }
    for (int j = 0; j < n; j++) {
      int ima = inff;
      for (auto v : t)
        ima = min(abs(y[j] - v), ima);
      mae2[i][j] = ima;
    }
  }
}
int tmp[20];
pa ch(int n) {

  int ans = 0;
  int k = n;
  int k1 = 0, k2 = 0;
  for (int i = 0; i < n; i++) {
    if (ve[i] == 1)
      k1 += (1ll << i);
    if (ve[i] == 2)
      k2 += (1ll << i);
  }
  int hh = 0;
  for (int i = 0; i < n; i++) {
    hh += min(mae1[k1][i], mae2[k2][i]) * p[i];
  }
  for (int i = 0; i < n; i++)
    if (ve[i] == 0) {

      k--;
    }
  // cout<<k<<" "<<hh<<endl;
  return mp(k, hh);
}

void solve() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++)
    cin >> x[i] >> y[i] >> p[i];

  for (int i = 0; i < n; i++)
    ve.pb(0);
  int ans = inf * 2000000000ll;
  vector<int> A(n + 1, ans);
  inff = ans;

  mae(n);

  while (1) {
    pa z = ch(n);
    //	ans=min(ans,	ch());
    A[z.first] = min(A[z.first], z.second);
    ve.back()++;
    int g = 0;
    for (int i = n - 1; i >= 0; i--) {
      if (g)
        ve[i]++, g = 0;
      if (ve[i] == 3) {
        ve[i] = 0;
        g = 1;
      }
    }
    if (g)
      break;
  }
  for (auto v : A)
    cout << v << endl;
  cout << endl;
}

signed main() {

  cin.tie(0);
  ios::sync_with_stdio(false);
  int n;
  n = 1;
  for (int i = 0; i < n; i++)
    solve();

  return 0;
}


Error: TLE

Fixed submission:

#include <bits/stdc++.h>

//    #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
// #define inf  998244353

#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define pb push_back
#define EPS (1e-8)

int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
public:
  int x;
  int y, z;
  pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    return z < p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    return z > p.z;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};

class pa4 {
public:
  int x;
  int y, z, w;
  pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x)
      return x < p.x;
    if (y != p.y)
      return y < p.y;
    if (z != p.z)
      return z < p.z;
    return w < p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x)
      return x > p.x;
    if (y != p.y)
      return y > p.y;
    if (z != p.z)
      return z > p.z;
    return w > p.w;
    // return x != p.x ? x<p.x: y<p.y;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
public:
  int x, y;
  pa2(int x = 0, int y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};

string itos(int i) {
  ostringstream s;
  s << i;
  return s.str();
}

int Gcd(int v, int b) {
  if (v == 0)
    return b;
  if (b == 0)
    return v;
  if (v > b)
    return Gcd(b, v);
  if (v == b)
    return b;
  if (b % v == 0)
    return v;
  return Gcd(v, b % v);
}

int mod;
int extgcd(int a, int b, int &x, int &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  int d = extgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
pa operator+(const pa &l, const pa &r) {
  return {l.first + r.first, l.second + r.second};
}
pa operator-(const pa &l, const pa &r) {
  return {l.first - r.first, l.second - r.second};
}
int beki(int wa, int rr, int warukazu) {
  if (rr == 0)
    return 1 % warukazu;
  if (rr == 1)
    return wa % warukazu;
  wa %= warukazu;
  if (rr % 2 == 1)
    return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;
  ll zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}

int pr[100000];
int inv[100000];

int comb(int nn, int rr) {
  if (rr < 0 || rr > nn || nn < 0)
    return 0;
  int r = pr[nn] * inv[rr];
  r %= mod;
  r *= inv[nn - rr];
  r %= mod;
  return r;
}

void gya(int ert) {
  pr[0] = 1;
  for (int i = 1; i <= ert; i++) {
    pr[i] = ((ll)pr[i - 1] * i) % mod;
  }
  inv[ert] = beki(pr[ert], mod - 2, mod);
  for (int i = ert - 1; i >= 0; i--) {
    inv[i] = (ll)inv[i + 1] * (i + 1) % mod;
  }
}

//   cin.tie(0);
//	ios::sync_with_stdio(false);
// priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
// sort(ve.begin(),ve.end(),greater<int>());
//   mt19937(clock_per_sec);
//  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;

int x[20], y[20], p[20];
vector<int> ve;
int inff;
pa ch(int n) {

  int ans = 0;
  int k = n;
  for (int i = 0; i < n; i++)
    if (ve[i] == 0) {
      k--;
      int d1 = abs(x[i]);
      int d2 = abs(y[i]);
      for (int j = 0; j < n; j++) {
        if (ve[j] == 1)
          d1 = min(d1, abs(x[j] - x[i]));
        if (ve[j] == 2)
          d2 = min(d2, abs(y[j] - y[i]));
      }

      ans += min(d1, d2) * p[i];
    }
  return mp(k, ans);
}

void solve() {
  int n;
  cin >> n;
  for (int i = 0; i < n; i++)
    cin >> x[i] >> y[i] >> p[i];

  for (int i = 0; i < n; i++)
    ve.pb(0);
  int ans = inf * 2000000000ll;
  vector<int> A(n + 1, ans);
  inff = ans;
  while (1) {
    pa z = ch(n);
    //	ans=min(ans,	ch());
    A[z.first] = min(A[z.first], z.second);
    ve.back()++;
    int g = 0;
    for (int i = n - 1; i >= 0; i--) {
      if (g)
        ve[i]++, g = 0;
      if (ve[i] == 3) {
        ve[i] = 0;
        g = 1;
      }
    }
    if (g)
      break;
  }
  for (auto v : A)
    cout << v << endl;
  cout << endl;
}

signed main() {

  cin.tie(0);
  ios::sync_with_stdio(false);
  int n;
  n = 1;
  for (int i = 0; i < n; i++)
    solve();

  return 0;
}