結果
問題 | No.1151 チャレンジゲーム |
ユーザー | 👑 emthrm |
提出日時 | 2020-08-09 00:33:04 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 80 ms / 2,000 ms |
コード長 | 2,305 bytes |
コンパイル時間 | 2,200 ms |
コンパイル使用メモリ | 204,952 KB |
実行使用メモリ | 28,288 KB |
最終ジャッジ日時 | 2024-04-10 09:09:34 |
合計ジャッジ時間 | 5,911 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,944 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 2 ms
6,940 KB |
testcase_09 | AC | 1 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,944 KB |
testcase_11 | AC | 2 ms
6,940 KB |
testcase_12 | AC | 2 ms
6,944 KB |
testcase_13 | AC | 21 ms
9,728 KB |
testcase_14 | AC | 23 ms
9,856 KB |
testcase_15 | AC | 21 ms
9,728 KB |
testcase_16 | AC | 20 ms
9,856 KB |
testcase_17 | AC | 21 ms
9,728 KB |
testcase_18 | AC | 22 ms
9,728 KB |
testcase_19 | AC | 21 ms
9,728 KB |
testcase_20 | AC | 21 ms
9,728 KB |
testcase_21 | AC | 21 ms
9,728 KB |
testcase_22 | AC | 20 ms
9,728 KB |
testcase_23 | AC | 21 ms
9,728 KB |
testcase_24 | AC | 21 ms
9,728 KB |
testcase_25 | AC | 20 ms
9,728 KB |
testcase_26 | AC | 20 ms
9,728 KB |
testcase_27 | AC | 21 ms
9,728 KB |
testcase_28 | AC | 78 ms
28,160 KB |
testcase_29 | AC | 80 ms
28,160 KB |
testcase_30 | AC | 78 ms
28,160 KB |
testcase_31 | AC | 74 ms
28,288 KB |
testcase_32 | AC | 77 ms
28,160 KB |
testcase_33 | AC | 76 ms
28,160 KB |
testcase_34 | AC | 75 ms
28,160 KB |
testcase_35 | AC | 78 ms
28,160 KB |
testcase_36 | AC | 76 ms
28,160 KB |
testcase_37 | AC | 75 ms
28,160 KB |
testcase_38 | AC | 77 ms
28,160 KB |
testcase_39 | AC | 73 ms
28,160 KB |
testcase_40 | AC | 80 ms
28,160 KB |
testcase_41 | AC | 75 ms
28,160 KB |
testcase_42 | AC | 78 ms
28,288 KB |
testcase_43 | AC | 79 ms
28,288 KB |
testcase_44 | AC | 75 ms
28,160 KB |
testcase_45 | AC | 74 ms
28,160 KB |
testcase_46 | AC | 77 ms
28,160 KB |
testcase_47 | AC | 76 ms
28,160 KB |
testcase_48 | AC | 63 ms
28,160 KB |
testcase_49 | AC | 65 ms
28,160 KB |
testcase_50 | AC | 77 ms
28,288 KB |
testcase_51 | AC | 78 ms
28,288 KB |
testcase_52 | AC | 78 ms
28,160 KB |
ソースコード
#define _USE_MATH_DEFINES #include <bits/stdc++.h> using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; const int INF = 0x3f3f3f3f; const ll LINF = 0x3f3f3f3f3f3f3f3fLL; const double EPS = 1e-8; const int MOD = 1000000007; // const int MOD = 998244353; const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1}; template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; } template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); } } iosetup; int main() { int n; cin >> n; vector<int> a(n); REP(i, n) cin >> a[i]; vector dp(2, vector(1 << n, vector(1 << n, -1.0))); function<double(int, int, int)> rec = [&](int turn, int nu, int ki) { double &d = dp[turn][nu][ki]; if (d >= 0) return d; int removed = nu | ki; if (removed == (1 << n) - 1) { int sum = 0; REP(i, n) sum += a[i] * (nu >> i & 1 ? 1 : -1); return d = sum > 0 ? 1 : 0; } if (turn == 0) { // null d = 0; REP(i, n) { if (removed >> i & 1) continue; double mn = 1; REP(j, n) { if (removed >> j & 1) continue; double p = 0; p += rec(turn ^ 1, nu | (1 << i), ki) / a[i]; p += (1 - 1. / a[i]) * rec(turn, nu, ki | (1 << j)) / a[j]; if (a[i] > 1 && a[j] > 1) p /= 1 - (1 - 1. / a[i]) * (1 - 1. / a[j]); chmin(mn, p); } chmax(d, mn); } } else { // kiri d = 1; REP(i, n) { if (removed >> i & 1) continue; double mx = 0; REP(j, n) { if (removed >> j & 1) continue; double p = 0; p += rec(turn ^ 1, nu, ki | (1 << i)) / a[i]; p += (1 - 1. / a[i]) * rec(turn, nu | (1 << j), ki) / a[j]; if (a[i] > 1 && a[j] > 1) p /= 1 - (1 - 1. / a[i]) * (1 - 1. / a[j]); chmax(mx, p); } chmin(d, mx); } } return d; }; cout << rec(0, 0, 0) << '\n'; return 0; }