結果
問題 | No.309 シャイな人たち (1) |
ユーザー |
👑 |
提出日時 | 2019-01-19 10:41:26 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 3,825 ms / 4,000 ms |
コード長 | 2,970 bytes |
コンパイル時間 | 3,002 ms |
コンパイル使用メモリ | 163,428 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-13 03:13:01 |
合計ジャッジ時間 | 30,115 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 13 |
ソースコード
import std.conv, std.stdio, std.string;import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;import core.bitop;class EOFException : Throwable { this() { super("EOF"); } }string[] tokens;string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }int readInt() { return readToken.to!int; }long readLong() { return readToken.to!long; }real readReal() { return readToken.to!real; }void chmin(T)(ref T t, in T f) { if (t > f) t = f; }void chmax(T)(ref T t, in T f) { if (t < f) t = f; }int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp)>> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }int M, N;real[][] P;int[][] S;void main() {try {for (; ; ) {M = readInt();N = readInt();P = new real[][](M, N);foreach (x; 0 .. M) foreach (y; 0 .. N) {P[x][y] = readInt() / 100.0;}S = new int[][](M, N);foreach (x; 0 .. M) foreach (y; 0 .. N) {S[x][y] = readInt();}auto prob = new real[][](M, 1 << N);foreach (x; 0 .. M) {foreach (a; 0 .. 1 << N) {prob[x][a] = 1.0;foreach (y; 0 .. N) {prob[x][a] *= ((a >> y) & 1) ? P[x][y] : (1.0 - P[x][y]);}}}auto dp = new real[][](M + 1, 1 << N);foreach (x; 0 .. M + 1) {dp[x][] = 0.0;}dp[0][0] = 1.0;foreach (x; 0 .. M) {foreach (b; 0 .. 1 << N) {if (isNormal(dp[x][b])) {auto s = new int[N];foreach (y; 0 .. N) {s[y] = (4 - S[x][y]) + ((b >> y) & 1);}foreach (a; 0 .. 1 << N) {int bb;foreach (y; 0 .. N) {if ((a >> y) & 1) {if (s[y] + ((y - 1 >= 0) ? ((bb >> (y - 1)) & 1) : 0) + ((bb >> (y + 1)) & 1) >= 4) {bb |= 1 << y;}}}foreach_reverse (y; 0 .. N) {if ((a >> y) & 1) {if (s[y] + ((y - 1 >= 0) ? ((bb >> (y - 1)) & 1) : 0) + ((bb >> (y + 1)) & 1) >= 4) {bb |= 1 << y;}}}dp[x + 1][bb] += dp[x][b] * prob[x][a];}}}}real ans = 0.0;foreach (x; 0 .. M) {foreach (b; 0 .. 1 << N) {ans += dp[x + 1][b] * popcnt(b);}}writefln("%.20f", ans);}} catch (EOFException e) {}}