結果
| 問題 | No.309 シャイな人たち (1) |
| ユーザー |
 heno239
|
| 提出日時 | 2020-08-27 13:16:30 |
| 言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 3,304 ms / 4,000 ms |
| コード長 | 3,909 bytes |
| コンパイル時間 | 1,325 ms |
| コンパイル使用メモリ | 121,300 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2024-11-07 15:40:11 |
| 合計ジャッジ時間 | 35,459 ms |
|
ジャッジサーバーID （参考情報） |
judge2 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 13 |
ソースコード
#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<utility>#include<cassert>#include<complex>#include<numeric>#include<array>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;constexpr ll mod = 1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#define stop char nyaa;cin>>nyaa;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;typedef long double ld;typedef pair<ld, ld> LDP;const ld eps = 1e-12;const ld pi = acosl(-1.0);ll mod_pow(ll x, ll n, ll m) {ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % m; n >>= 1;}return res;}struct modint {ll n;modint() :n(0) { ; }modint(ll m) :n(m) {if (n >= mod)n %= mod;else if (n < 0)n = (n % mod + mod) % mod;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, ll n) {if (n == 0)return modint(1);modint res = (a * a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }const int max_n = 1 << 1;modint fact[max_n], factinv[max_n];void init_f() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}ld p[11][11];int s[11][11];void solve() {int h, w; cin >> h >> w;rep(i, h)rep(j, w) {cin >> p[i][j]; p[i][j] /= 100.0;}rep(i, h)rep(j, w)cin >> s[i][j];vector<ld> dp(1 << w),cop(1<<w);dp[0] = 1;vector<int> cnt(w);ld ans = 0;queue<int> q;rep(i, h) {fill(all(cop), 0);rep(k, (1 << w)) {ld pro = 1;rep(l, w) {if (k & (1 << l)) {pro *= p[i][l];}else {pro *= (1 - p[i][l]);}}rep(j, (1 << w)) {ld pab = dp[j] * pro;int nj = 0;rep(l, w) {if (j & (1 << l))cnt[l] = 1;else cnt[l] = 0;if (k & (1 << l))cnt[l] += 4 - s[i][l];if (cnt[l] >= 4) {nj^= (1 << l);q.push(l);}}while (!q.empty()) {ans += pab;int id = q.front(); q.pop();//cout << j << " " << k << " " << pab << "\n";if (id > 0) {cnt[id - 1]++;if (cnt[id - 1] == 4) {q.push(id - 1);nj ^= (1 << id - 1);}}if (id + 1 < w) {cnt[id + 1]++;if (cnt[id + 1] == 4) {q.push(id + 1);nj ^= (1 << id + 1);}}}cop[nj] += pab;}}swap(dp, cop);}cout << ans << "\n";}signed main() {ios::sync_with_stdio(false);cin.tie(0);cout << fixed << setprecision(15);//init_f();//expr();//int t; cin >> t; rep(i, t)solve();return 0;}