結果

問題 No.1151 チャレンジゲーム
ユーザー NyaanNyaanNyaanNyaan
提出日時 2020-08-07 21:55:31
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 366 ms / 2,000 ms
コード長 9,112 bytes
コンパイル時間 3,181 ms
コンパイル使用メモリ 300,460 KB
実行使用メモリ 20,160 KB
最終ジャッジ日時 2024-09-24 19:57:03
合計ジャッジ時間 13,580 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 4 ms
6,944 KB
testcase_02 AC 6 ms
6,944 KB
testcase_03 AC 2 ms
6,944 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 3 ms
6,940 KB
testcase_09 AC 3 ms
6,944 KB
testcase_10 AC 4 ms
6,940 KB
testcase_11 AC 6 ms
6,944 KB
testcase_12 AC 6 ms
6,940 KB
testcase_13 AC 123 ms
12,456 KB
testcase_14 AC 118 ms
12,052 KB
testcase_15 AC 118 ms
12,468 KB
testcase_16 AC 119 ms
12,392 KB
testcase_17 AC 119 ms
12,724 KB
testcase_18 AC 128 ms
13,660 KB
testcase_19 AC 118 ms
12,240 KB
testcase_20 AC 120 ms
13,156 KB
testcase_21 AC 119 ms
12,360 KB
testcase_22 AC 120 ms
13,460 KB
testcase_23 AC 120 ms
12,212 KB
testcase_24 AC 132 ms
12,360 KB
testcase_25 AC 119 ms
12,356 KB
testcase_26 AC 119 ms
12,408 KB
testcase_27 AC 120 ms
12,056 KB
testcase_28 AC 267 ms
19,880 KB
testcase_29 AC 287 ms
19,980 KB
testcase_30 AC 274 ms
20,012 KB
testcase_31 AC 287 ms
20,080 KB
testcase_32 AC 266 ms
19,960 KB
testcase_33 AC 274 ms
19,980 KB
testcase_34 AC 264 ms
20,024 KB
testcase_35 AC 270 ms
20,160 KB
testcase_36 AC 269 ms
20,068 KB
testcase_37 AC 280 ms
19,948 KB
testcase_38 AC 264 ms
20,008 KB
testcase_39 AC 267 ms
19,916 KB
testcase_40 AC 276 ms
20,088 KB
testcase_41 AC 332 ms
19,976 KB
testcase_42 AC 285 ms
20,052 KB
testcase_43 AC 267 ms
20,124 KB
testcase_44 AC 261 ms
19,864 KB
testcase_45 AC 279 ms
19,996 KB
testcase_46 AC 271 ms
20,140 KB
testcase_47 AC 283 ms
20,040 KB
testcase_48 AC 264 ms
20,124 KB
testcase_49 AC 366 ms
19,952 KB
testcase_50 AC 265 ms
20,092 KB
testcase_51 AC 266 ms
19,888 KB
testcase_52 AC 271 ms
19,968 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma region kyopro_template
#define Nyaan_template
#include <immintrin.h>
#include <bits/stdc++.h>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define mem(a, val) memset(a, val, sizeof(a))
#define ini(...)   \
  int __VA_ARGS__; \
  in(__VA_ARGS__)
#define inl(...)         \
  long long __VA_ARGS__; \
  in(__VA_ARGS__)
#define ins(...)      \
  string __VA_ARGS__; \
  in(__VA_ARGS__)
#define inc(...)    \
  char __VA_ARGS__; \
  in(__VA_ARGS__)
#define in2(s, t)                           \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i]);                         \
  }
#define in3(s, t, u)                        \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i]);                   \
  }
#define in4(s, t, u, v)                     \
  for (int i = 0; i < (int)s.size(); i++) { \
    in(s[i], t[i], u[i], v[i]);             \
  }
#define rep(i, N) for (long long i = 0; i < (long long)(N); i++)
#define repr(i, N) for (long long i = (long long)(N)-1; i >= 0; i--)
#define rep1(i, N) for (long long i = 1; i <= (long long)(N); i++)
#define repr1(i, N) for (long long i = (N); (long long)(i) > 0; i--)
#define reg(i, a, b) for (long long i = (a); i < (b); i++)
#define die(...)      \
  do {                \
    out(__VA_ARGS__); \
    return;           \
  } while (0)
using namespace std;
using ll = long long;
template <class T>
using V = vector<T>;
using vi = vector<int>;
using vl = vector<long long>;
using vvi = vector<vector<int>>;
using vd = V<double>;
using vs = V<string>;
using vvl = vector<vector<long long>>;
using P = pair<long long, long long>;
using vp = vector<P>;
using pii = pair<int, int>;
using vpi = vector<pair<int, int>>;
constexpr int inf = 1001001001;
constexpr long long infLL = (1LL << 61) - 1;
template <typename T, typename U>
inline bool amin(T &x, U y) {
  return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U>
inline bool amax(T &x, U y) {
  return (x < y) ? (x = y, true) : false;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
  is >> p.first >> p.second;
  return is;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  int s = (int)v.size();
  for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (auto &x : v) is >> x;
  return is;
}
void in() {}
template <typename T, class... U>
void in(T &t, U &... u) {
  cin >> t;
  in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U>
void out(const T &t, const U &... u) {
  cout << t;
  if (sizeof...(u)) cout << " ";
  out(u...);
}

#ifdef NyaanDebug
#define trc(...)                   \
  do {                             \
    cerr << #__VA_ARGS__ << " = "; \
    dbg_out(__VA_ARGS__);          \
  } while (0)
#define trca(v, N)       \
  do {                   \
    cerr << #v << " = "; \
    array_out(v, N);     \
  } while (0)
#define trcc(v)                             \
  do {                                      \
    cerr << #v << " = {";                   \
    each(x, v) { cerr << " " << x << ","; } \
    cerr << "}" << endl;                    \
  } while (0)
template <typename T>
void _cout(const T &c) {
  cerr << c;
}
void _cout(const int &c) {
  if (c == 1001001001)
    cerr << "inf";
  else if (c == -1001001001)
    cerr << "-inf";
  else
    cerr << c;
}
void _cout(const unsigned int &c) {
  if (c == 1001001001)
    cerr << "inf";
  else
    cerr << c;
}
void _cout(const long long &c) {
  if (c == 1001001001 || c == (1LL << 61) - 1)
    cerr << "inf";
  else if (c == -1001001001 || c == -((1LL << 61) - 1))
    cerr << "-inf";
  else
    cerr << c;
}
void _cout(const unsigned long long &c) {
  if (c == 1001001001 || c == (1LL << 61) - 1)
    cerr << "inf";
  else
    cerr << c;
}
template <typename T, typename U>
void _cout(const pair<T, U> &p) {
  cerr << "{ ";
  _cout(p.fi);
  cerr << ", ";
  _cout(p.se);
  cerr << " } ";
}
template <typename T>
void _cout(const vector<T> &v) {
  int s = v.size();
  cerr << "{ ";
  for (int i = 0; i < s; i++) {
    cerr << (i ? ", " : "");
    _cout(v[i]);
  }
  cerr << " } ";
}
template <typename T>
void _cout(const vector<vector<T>> &v) {
  cerr << "[ ";
  for (const auto &x : v) {
    cerr << endl;
    _cout(x);
    cerr << ", ";
  }
  cerr << endl << " ] ";
}
void dbg_out() { cerr << endl; }
template <typename T, class... U>
void dbg_out(const T &t, const U &... u) {
  _cout(t);
  if (sizeof...(u)) cerr << ", ";
  dbg_out(u...);
}
template <typename T>
void array_out(const T &v, int s) {
  cerr << "{ ";
  for (int i = 0; i < s; i++) {
    cerr << (i ? ", " : "");
    _cout(v[i]);
  }
  cerr << " } " << endl;
}
template <typename T>
void array_out(const T &v, int H, int W) {
  cerr << "[ ";
  for (int i = 0; i < H; i++) {
    cerr << (i ? ", " : "");
    array_out(v[i], W);
  }
  cerr << " ] " << endl;
}
#else
#define trc(...)
#define trca(...)
#define trcc(...)
#endif

inline int popcnt(unsigned long long a) { return __builtin_popcountll(a); }
inline int lsb(unsigned long long a) { return __builtin_ctzll(a); }
inline int msb(unsigned long long a) { return 63 - __builtin_clzll(a); }
template <typename T>
inline int getbit(T a, int i) {
  return (a >> i) & 1;
}
template <typename T>
inline void setbit(T &a, int i) {
  a |= (1LL << i);
}
template <typename T>
inline void delbit(T &a, int i) {
  a &= ~(1LL << i);
}
template <typename T>
int lb(const vector<T> &v, const T &a) {
  return lower_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int ub(const vector<T> &v, const T &a) {
  return upper_bound(begin(v), end(v), a) - begin(v);
}
template <typename T>
int btw(T a, T x, T b) {
  return a <= x && x < b;
}
template <typename T, typename U>
T ceil(T a, U b) {
  return (a + b - 1) / b;
}
constexpr long long TEN(int n) {
  long long ret = 1, x = 10;
  while (n) {
    if (n & 1) ret *= x;
    x *= x;
    n >>= 1;
  }
  return ret;
}
template <typename T>
vector<T> mkrui(const vector<T> &v) {
  vector<T> ret(v.size() + 1);
  for (int i = 0; i < int(v.size()); i++) ret[i + 1] = ret[i] + v[i];
  return ret;
};
template <typename T>
vector<T> mkuni(const vector<T> &v) {
  vector<T> ret(v);
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  return ret;
}
template <typename F>
vector<int> mkord(int N, F f) {
  vector<int> ord(N);
  iota(begin(ord), end(ord), 0);
  sort(begin(ord), end(ord), f);
  return ord;
}
template <typename T = int>
vector<T> mkiota(int N) {
  vector<T> ret(N);
  iota(begin(ret), end(ret), 0);
  return ret;
}
template <typename T>
vector<int> mkinv(vector<T> &v) {
  vector<int> inv(v.size());
  for (int i = 0; i < (int)v.size(); i++) inv[v[i]] = i;
  return inv;
}

struct IoSetupNya {
  IoSetupNya() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(15);
    cerr << fixed << setprecision(7);
  }
} iosetupnya;

void solve();
int main() { solve(); }

#pragma endregion

double dp[1024][2][1024];

void solve() {
  ini(N);
  vi a(N);
  in(a);
  int off = 512;

  int ma = 500;
  rep(i, 1 << N) for (int j = -ma; j <= ma; j++) {
    if (!i) {
      if (j > 0) dp[0][0][j + off] = dp[0][1][j + off] = 1.0;
      continue;
    }
    V<array<double, 3>> memo;
    rep(b, N) {
      if (!getbit(i, b)) continue;
      array<double, 3> A;
      // bを選んだ時の成功確率
      A[0] = 1.0 / a[b];
      // 先行が成功したときの勝率
      A[1] = dp[i ^ (1 << b)][1][j + a[b] + off];
      //
      A[2] = dp[i ^ (1 << b)][0][j - a[b] + off];
      memo.push_back(A);
    }
    // trc("a",i,j);
    // 0に取って最適な択は？
    {
      double nxt = 0;
      rep(i, sz(memo)) {
        double curmin = 1.0;
        double buf = memo[i][0] * memo[i][1];
        rep(j, sz(memo)) {
          // i,jを選んだ時の最小化する択は？
          double cur = (1 - memo[i][0]) * memo[j][0] * memo[j][2];
          double rec = (1 - memo[i][0]) * (1 - memo[j][0]);
          amin(curmin, 1.0 / (1.0 - rec) * (buf + cur));
        }
        amax(nxt, curmin);
      }
      dp[i][0][j + off] = nxt;
    }

    // 1に取って最適な択は？
    {
      // 最小
      double nxt = 1.0;
      rep(i, sz(memo)) {
        double curmax = 0.0;
        double buf = memo[i][0] * memo[i][2];
        rep(j, sz(memo)) {
          // i,jを選んだ時の最大化する択は？
          double cur = (1 - memo[i][0]) * memo[j][0] * memo[j][1];
          double rec = (1 - memo[i][0]) * (1 - memo[j][0]);
          amax(curmax, 1.0 / (1.0 - rec) * (buf + cur));
        }
        amin(nxt, curmax);
      }
      dp[i][1][j + off] = nxt;
    }
    //trc(i, j, dp[i][0][j + off], dp[i][1][j + off]);
  }
  out(dp[(1 << N) - 1][0][off]);
}
0