結果

問題 No.162 8020運動
ユーザー fumiphysfumiphys
提出日時 2019-09-22 17:40:13
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 976 ms / 5,000 ms
コード長 3,962 bytes
コンパイル時間 1,804 ms
コンパイル使用メモリ 167,472 KB
実行使用メモリ 6,400 KB
最終ジャッジ日時 2024-09-19 03:39:38
合計ジャッジ時間 12,515 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 49 ms
5,248 KB
testcase_01 AC 17 ms
5,376 KB
testcase_02 AC 721 ms
5,632 KB
testcase_03 AC 154 ms
6,272 KB
testcase_04 AC 963 ms
6,272 KB
testcase_05 AC 967 ms
6,272 KB
testcase_06 AC 976 ms
6,016 KB
testcase_07 AC 952 ms
6,400 KB
testcase_08 AC 957 ms
6,144 KB
testcase_09 AC 4 ms
5,376 KB
testcase_10 AC 24 ms
5,376 KB
testcase_11 AC 17 ms
5,376 KB
testcase_12 AC 9 ms
5,376 KB
testcase_13 AC 29 ms
5,376 KB
testcase_14 AC 8 ms
5,376 KB
testcase_15 AC 28 ms
5,376 KB
testcase_16 AC 48 ms
5,376 KB
testcase_17 AC 43 ms
5,376 KB
testcase_18 AC 257 ms
5,888 KB
testcase_19 AC 673 ms
5,504 KB
testcase_20 AC 118 ms
5,376 KB
testcase_21 AC 781 ms
5,504 KB
testcase_22 AC 48 ms
5,376 KB
testcase_23 AC 770 ms
5,760 KB
testcase_24 AC 719 ms
5,632 KB
testcase_25 AC 493 ms
5,760 KB
testcase_26 AC 7 ms
5,376 KB
testcase_27 AC 324 ms
5,376 KB
testcase_28 AC 146 ms
6,016 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 dp[30][1<<14];
double p = 1.;
int st = 0;
double p0, p1, p2;

void dfs(int k, int i, int j){
  if(k == 14){
    dp[i+1][st] += p;
    return;
  }
  int tst = st;
  double tp = p;
  if((j >> k) & 1){
    double pl = 0.;
    int cnt = 0;
    if(k == 0 || !((j >> (k-1)) & 1))cnt++;
    if(k == 13 || !((j >> (k+1)) & 1))cnt++;
    if(cnt == 0)pl = p2;
    else if(cnt == 1)pl = p1;
    else if(cnt == 2)pl = p0;
    if(pl > 0.){
      p *= pl;
      st = st & (~(bit(k)));
      dfs(k + 1, i, j);
      p = tp;
      st = tst;
    }
    if(1. - pl > 0){
      st = st | bit(k);
      p *= (1. - pl);
      dfs(k + 1, i, j);
      p = tp;
      st = tst;
    }
  }else{
    dfs(k + 1, i, j);
  }
}

int main(int argc, char const* argv[])
{
  int a;
  cin >> a;
  cin >> p0 >> p1 >> p2, p0 /= 100., p1 /= 100., p2 /= 100.;
  dp[0][bit(14)-1] = 1.;
  for(int i = 0; i < 80 - a; i++){
    rep(j, bit(14)){
      p = dp[i][j];
      dfs(0, i, j);
    }
  }
  double res = 0.;
  rep(i, bit(14)){
    res += __builtin_popcount(i) * dp[80-a][i];
  }
  cout << res * 2. << endl;
  return 0;
}
0