結果

問題 No.174 カードゲーム（Hard）
ユーザー fumiphysfumiphys
提出日時 2019-09-23 22:54:11
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 412 ms / 2,000 ms
コード長 4,343 bytes
コンパイル時間 1,746 ms
コンパイル使用メモリ 174,040 KB
実行使用メモリ 20,244 KB
最終ジャッジ日時 2023-10-19 08:28:53
合計ジャッジ時間 6,122 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 3 ms
5,904 KB
testcase_01 AC 3 ms
5,904 KB
testcase_02 AC 412 ms
20,244 KB
testcase_03 AC 409 ms
20,244 KB
testcase_04 AC 411 ms
20,244 KB
testcase_05 AC 408 ms
20,244 KB
testcase_06 AC 411 ms
20,244 KB
testcase_07 AC 409 ms
20,244 KB
testcase_08 AC 409 ms
20,244 KB
testcase_09 AC 411 ms
20,244 KB
testcase_10 AC 2 ms
5,904 KB
testcase_11 AC 2 ms
5,904 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// includes
#include <bits/stdc++.h>
using namespace std;

// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr)
#define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define bit(n) (1LL<<(n))
// functions
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}
template <typename T> ostream &operator<<(ostream &os, const vector<T>& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_set<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T>& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){os << p.first << " " << p.second; return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
template <typename T1, typename T2> ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;}
//  types
using ll = long long int;
using P = pair<int, int>;
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1000000007;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// io
struct fast_io{
  fast_io(){ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20);}
} fast_io_;

double dpb2[1<<20];
double dpb[21][21];
double dpa2[1<<20];
double dpa[21][21];

int main(int argc, char const* argv[])
{
  int n;
  double pa, pb;
  cin >> n >> pa >> pb;
  vector<int> a(n), b(n);
  cin >> a >> b;
  sort(all(a));
  sort(all(b));

  dpb2[0] = 1.;
  FOR(i, 1, bit(n)){
    int mini = inf;
    rep(j, n){
      if(!((i >> j) & 1)){
        mini = min(mini, b[j]);
      }
    }
    rep(j, n){
      if((i >> j) & 1){
        double pr = dpb2[i ^ bit(j)];
        int rem = n - __builtin_popcount(i) + 1;
        double tmp = 0.;
        if(rem == 1)tmp = pr;
        else if(b[j] < mini)tmp = pr * pb;
        else tmp = pr * (1. - pb) / (double)(rem - 1);
        dpb2[i] += tmp;
        dpb[__builtin_popcount(i)][j] += tmp;
      }
    }
  }

  dpa2[0] = 1.;
  FOR(i, 1, bit(n)){
    int mini = inf;
    rep(j, n){
      if(!((i >> j) & 1)){
        mini = min(mini, a[j]);
      }
    }
    rep(j, n){
      if((i >> j) & 1){
        double pr = dpa2[i ^ bit(j)];
        int rem = n - __builtin_popcount(i) + 1;
        double tmp = 0.;
        if(rem == 1)tmp = pr;
        else if(a[j] < mini)tmp = pr * pa;
        else tmp = pr * (1. - pa) / (double)(rem - 1);
        dpa2[i] += tmp;
        dpa[__builtin_popcount(i)][j] += tmp;
      }
    }
  }

  double res = 0.;
  rep(i, n){
    rep(j, n){
      rep(k, n){
        if(a[i] > b[j])res += dpa[k + 1][i] * dpb[k + 1][j] * (a[i] + b[j]);
      }
    }
  }
  cout << res << endl;
  return 0;
}
0