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

#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
const int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1};
// adjust problem by problem
const double EPS = 1e-8;
const double PI = acos(-1.0);
#ifdef __GNUC__
int popcount(int n) { return __builtin_popcount(n); }
int popcount(ll n) { return __builtin_popcountll(n); }
#endif
#ifndef __GNUC__
template <class T> int popcount(T n) {
  int cnt = 0;
  while (n) {
    if (n % 2)
      cnt++;
    n /= 2;
  }
  return cnt;
}
#endif
template <class T> int SIZE(T a) { return a.size(); }
template <class T> string IntToString(T num) {
  string res;
  stringstream ss;
  ss << num;
  return ss.str();
}
template <class T> T StringToInt(string str) {
  T res = 0;
  for (int i = 0; i < SIZE(str); i++)
    res = (res * 10 + str[i] - '0');
  return res;
}
template <class T> T gcd(T a, T b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> void PrintSeq(T &a, int sz) {
  for (int i = 0; i < sz; i++) {
    cout << a[i];
    if (sz == i + 1)
      cout << endl;
    else
      cout << ' ';
  }
}
bool EQ(double a, double b) { return abs(a - b) < EPS; }
void fastStream() {
  cin.tie(0);
  std::ios_base::sync_with_stdio(0);
}
vector<string> split(string str, char del) {
  vector<string> res;
  for (int i = 0, s = 0; i < SIZE(str); i++) {
    if (str[i] == del) {
      if (i - s != 0)
        res.push_back(str.substr(s, i - s));
      s = i + 1;
    } else if (i == SIZE(str) - 1) {
      res.push_back(str.substr(s));
    }
  }
  return res;
}

int N, M, R;
double SXS[2010];
double SYS[2010];
double SZS[2010];
double SRS[2010];
double TXS[20];
double TYS[20];
double TZS[20];
double TBS[20];
double ex, ey, ez;

double dist(int lIdx) {
  return TBS[lIdx] / (pow(TXS[lIdx] - ex, 2) + pow(TYS[lIdx] - ey, 2) +
                      pow(TZS[lIdx] - ez, 2));
}

// 線分E-Light_iが球jを通るか
bool isPassed[20][2010];
// 点があるsphereの中にあるか
bool isInside[20][2010];

int main() {
  fastStream();
  while (cin >> N >> M >> R && (N | M | R)) {
    for (int i = 0; i < N; i++)
      cin >> SXS[i] >> SYS[i] >> SZS[i] >> SRS[i];
    for (int i = 0; i < M; i++)
      cin >> TXS[i] >> TYS[i] >> TZS[i] >> TBS[i];
    cin >> ex >> ey >> ez;
    memset(isPassed, 0, sizeof(isPassed));
    TXS[M] = ex, TYS[M] = ey, TZS[M] = ez;
    for (int i = 0; i <= M; i++) {
      for (int j = 0; j < N; j++) {
        double d = pow(SXS[j] - TXS[i], 2) + pow(SYS[j] - TYS[i], 2) +
                   pow(SZS[j] - TZS[i], 2);
        isInside[i][j] = pow(SRS[j], 2) >= d;
      }
    }
    // 全ての光源に対して
    for (int i = 0; i < M; i++) {
      // 線分E-Light_iが球jを通るかを調べる
      for (int j = 0; j < N; j++) {
        // 三分探索で球jの中心とE-Light_iの距離を計算
        double ub = 1.0;
        double lb = 0;
        for (int ite = 0; ite < 500; ite++) {
          double mid1 = ((ub - lb) / 3) + lb;
          double mid2 = ((ub - lb) / 3) * 2 + lb;
          double d[2];
          double ary[2] = {mid1, mid2};
          for (int k = 0; k < 2; k++) {
            double dx = ex - TXS[i];
            double dy = ey - TYS[i];
            double dz = ez - TZS[i];
            double px = dx * ary[k] + TXS[i];
            double py = dy * ary[k] + TYS[i];
            double pz = dz * ary[k] + TZS[i];
            d[k] = (SXS[j] - px) * (SXS[j] - px) +
                   (SYS[j] - py) * (SYS[j] - py) +
                   (SZS[j] - pz) * (SZS[j] - pz);
          }
          if (d[0] < d[1])
            ub = mid2;
          else
            lb = mid1;
        }
        double dx = ex - TXS[i];
        double dy = ey - TYS[i];
        double dz = ez - TZS[i];
        double px = dx * ub + TXS[i];
        double py = dy * ub + TYS[i];
        double pz = dz * ub + TZS[i];
        double dis = (SXS[j] - px) * (SXS[j] - px) +
                     (SYS[j] - py) * (SYS[j] - py) +
                     (SZS[j] - pz) * (SZS[j] - pz);
        if (pow(SRS[j], 2) >= dis)
          isPassed[i][j] = true;
        else
          isPassed[i][j] = false;
      }
    }

    bitset<2001> bs[16];
    for (int i = 0; i < M; i++)
      for (int j = 0; j < N; j++)
        if (isPassed[i][j] && !(isInside[M][j] && isInside[i][j]))
          bs[i][j] = 1;
    double ans = 0;
    // 光源を得たいものを求める
    for (int mask = 0; mask < (1 << M); mask++) {
      // ここで、各光源に対して
      // 消す必要のあるsphereを求める
      // bool isDel[2010]={};
      bitset<2001> b;
      for (int i = 0; i < M; i++)
        if ((mask >> i) & 1)
          b |= bs[i];
      int cnt = b.count();
      // for(int i=0;i<M;i++)
      //   if((mask>>i)&1)
      //     for(int j=0;j<N;j++)
      //       if(!isDel[j]&&isPassed[i][j]&&!(isInside[M][j]&&isInside[i][j]))isDel[j]=true,cnt++;
      if (cnt <= R) {
        double val = 0;
        for (int i = 0; i < M; i++)
          if ((mask >> i) & 1)
            val += dist(i);
        ans = max(ans, val);
      }
    }
    printf("%.5f\\n", ans);
  }
  return 0;
}

Error: TLE

Fixed submission:

#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
const int dy[] = {-1, 0, 1, 0}, dx[] = {0, 1, 0, -1};
// adjust problem by problem
const double EPS = 1e-8;
const double PI = acos(-1.0);
#ifdef __GNUC__
int popcount(int n) { return __builtin_popcount(n); }
int popcount(ll n) { return __builtin_popcountll(n); }
#endif
#ifndef __GNUC__
template <class T> int popcount(T n) {
  int cnt = 0;
  while (n) {
    if (n % 2)
      cnt++;
    n /= 2;
  }
  return cnt;
}
#endif
template <class T> int SIZE(T a) { return a.size(); }
template <class T> string IntToString(T num) {
  string res;
  stringstream ss;
  ss << num;
  return ss.str();
}
template <class T> T StringToInt(string str) {
  T res = 0;
  for (int i = 0; i < SIZE(str); i++)
    res = (res * 10 + str[i] - '0');
  return res;
}
template <class T> T gcd(T a, T b) {
  if (b == 0)
    return a;
  return gcd(b, a % b);
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <class T> void PrintSeq(T &a, int sz) {
  for (int i = 0; i < sz; i++) {
    cout << a[i];
    if (sz == i + 1)
      cout << endl;
    else
      cout << ' ';
  }
}
bool EQ(double a, double b) { return abs(a - b) < EPS; }
void fastStream() {
  cin.tie(0);
  std::ios_base::sync_with_stdio(0);
}
vector<string> split(string str, char del) {
  vector<string> res;
  for (int i = 0, s = 0; i < SIZE(str); i++) {
    if (str[i] == del) {
      if (i - s != 0)
        res.push_back(str.substr(s, i - s));
      s = i + 1;
    } else if (i == SIZE(str) - 1) {
      res.push_back(str.substr(s));
    }
  }
  return res;
}

int N, M, R;
double SXS[2010];
double SYS[2010];
double SZS[2010];
double SRS[2010];
double TXS[20];
double TYS[20];
double TZS[20];
double TBS[20];
double ex, ey, ez;

double dist(int lIdx) {
  return TBS[lIdx] / (pow(TXS[lIdx] - ex, 2) + pow(TYS[lIdx] - ey, 2) +
                      pow(TZS[lIdx] - ez, 2));
}

// 線分E-Light_iが球jを通るか
bool isPassed[20][2010];
// 点があるsphereの中にあるか
bool isInside[20][2010];

int main() {
  fastStream();
  while (cin >> N >> M >> R && (N | M | R)) {
    for (int i = 0; i < N; i++)
      cin >> SXS[i] >> SYS[i] >> SZS[i] >> SRS[i];
    for (int i = 0; i < M; i++)
      cin >> TXS[i] >> TYS[i] >> TZS[i] >> TBS[i];
    cin >> ex >> ey >> ez;
    memset(isPassed, 0, sizeof(isPassed));
    TXS[M] = ex, TYS[M] = ey, TZS[M] = ez;
    for (int i = 0; i <= M; i++) {
      for (int j = 0; j < N; j++) {
        double d = pow(SXS[j] - TXS[i], 2) + pow(SYS[j] - TYS[i], 2) +
                   pow(SZS[j] - TZS[i], 2);
        isInside[i][j] = pow(SRS[j], 2) >= d;
      }
    }
    // 全ての光源に対して
    for (int i = 0; i < M; i++) {
      // 線分E-Light_iが球jを通るかを調べる
      for (int j = 0; j < N; j++) {
        // 三分探索で球jの中心とE-Light_iの距離を計算
        double ub = 1.0;
        double lb = 0;
        for (int ite = 0; ite < 100; ite++) {
          double mid1 = ((ub - lb) / 3) + lb;
          double mid2 = ((ub - lb) / 3) * 2 + lb;
          double d[2];
          double ary[2] = {mid1, mid2};
          for (int k = 0; k < 2; k++) {
            double dx = ex - TXS[i];
            double dy = ey - TYS[i];
            double dz = ez - TZS[i];
            double px = dx * ary[k] + TXS[i];
            double py = dy * ary[k] + TYS[i];
            double pz = dz * ary[k] + TZS[i];
            d[k] =
                pow(SXS[j] - px, 2) + pow(SYS[j] - py, 2) + pow(SZS[j] - pz, 2);
          }
          if (d[0] < d[1])
            ub = mid2;
          else
            lb = mid1;
        }
        double dx = ex - TXS[i];
        double dy = ey - TYS[i];
        double dz = ez - TZS[i];
        double px = dx * ub + TXS[i];
        double py = dy * ub + TYS[i];
        double pz = dz * ub + TZS[i];
        double dis =
            pow(SXS[j] - px, 2) + pow(SYS[j] - py, 2) + pow(SZS[j] - pz, 2);
        if (pow(SRS[j], 2) >= dis)
          isPassed[i][j] = true;
        else
          isPassed[i][j] = false;
      }
    }
    double ans = 0;
    // 光源を得たいものを求める
    for (int mask = 0; mask < (1 << M); mask++) {
      int cnt = 0;
      // ここで、各光源に対して
      // 消す必要のあるsphereを求める
      bool isDel[2010] = {};
      for (int i = 0; i < M; i++)
        if ((mask >> i) & 1)
          for (int j = 0; j < N; j++)
            if (!isDel[j] && isPassed[i][j] &&
                !(isInside[M][j] && isInside[i][j]))
              isDel[j] = true, cnt++;
      if (cnt <= R) {
        double val = 0;
        for (int i = 0; i < M; i++)
          if ((mask >> i) & 1)
            val += dist(i);
        ans = max(ans, val);
      }
    }
    printf("%.5f\\n", ans);
  }
  return 0;
}