結果
| 問題 | No.309 シャイな人たち (1) |
| ユーザー |
 ぴろず
|
| 提出日時 | 2015-12-03 17:34:28 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 784 ms / 4,000 ms |
| コード長 | 7,069 bytes |
| コンパイル時間 | 2,684 ms |
| コンパイル使用メモリ | 88,868 KB |
| 実行使用メモリ | 72,012 KB |
| 最終ジャッジ日時 | 2024-09-14 08:28:29 |
| 合計ジャッジ時間 | 12,080 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 13 |
ソースコード
//(◞‸◟)package no309b;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.InputMismatchException;import java.util.NoSuchElementException;public class Main {public static long stime;public static double solve(int r,int c,double[][] p,int[][] s) {int[] table = new int[1<<(c*2)];int[] po = new int[c];for(int i=0;i<1<<(c*2);i++) {int i_ = i;for(int j=0;j<c;j++) {po[j] = (i_ & 3) + 1;i_ >>>= 2;}for(int j=0;j<c-1;j++) {if (po[j] >= 4) {po[j+1]++;}}for(int j=c-1;j>=1;j--) {if (po[j] >= 4) {po[j-1]++;}}for(int j=c-1;j>=0;j--) {table[i] <<= 1;table[i] |= po[j] >= 4 ? 1 : 0;}// System.out.println(tetral(i,c) + "," + binary(table[i],c));}int[] m1m = new int[1<<c];int[] m2m = new int[1<<c];int[] bitcount = new int[1<<c];for(int i=0;i<1<<c;i++) {for(int j=c-1;j>=0;j--) {m1m[i] = (m1m[i] << 2) | (i >> j & 1);}m2m[i] = m1m[i] | (m1m[i] << 1);bitcount[i] = Integer.bitCount(i);// System.out.println(tetral(m1m[i],c) + "," + tetral(m2m[i],c) + "," + bitcount[i]);}int[] s2 = new int[r];int[] ngmask = new int[r];int[] okmask = new int[r];for(int i=0;i<r;i++) {for(int j=c-1;j>=0;j--) {s2[i] <<= 2;ngmask[i] <<= 2;okmask[i] <<= 2;if (s[i][j] == 0) {okmask[i] |= 3;}else if(s[i][j] == 4) {ngmask[i] |= 3;}else{s2[i] |= 3 - s[i][j];}}// System.out.println(tetral(s2[i],c) + "," + tetral(ngmask[i],c) + "," + tetral(okmask[i],c));}// lap();double ans = 0;double[] bef = new double[1<<c];bef[0] = 1;for(int i=0;i<r;i++) {double[] now = new double[1<<c];for(int m2=0;m2<1<<c;m2++) { //この列の知っている人double q = 1;for(int j=0;j<c;j++) {q *= ((m2 >> j) & 1) > 0 ? p[i][j] : (1 - p[i][j]);}for(int m1=0;m1<1<<c;m1++) { //前の列の手の挙げ方if (bef[m1] == 0) {continue;}// System.out.println("----");// System.out.println(i + "," + binary(m1,c) + "," + binary(m2,c));// System.out.println("front:" + tetral(m1m[m1],c));// System.out.println("know :" + binary(m2,c));// System.out.println("point:" + tetral(m2m[m2] & s2[i],c));// System.out.println("ng :" + tetral(ngmask[i],c));// System.out.println("ok :" + tetral(m2m[m2] & okmask[i],c));int point = ((m1m[m1] + s2[i]) & m2m[m2] & ~ngmask[i]) | (m2m[m2] & okmask[i]);// System.out.println("total:" + tetral(point,c));int m3 = table[point];// System.out.println(binary(m3,c));now[m3] += bef[m1] * q;ans += bef[m1] * q * bitcount[m3];}}bef = now;}return ans;}public static void main(String[] args) {IO io = new IO();int r = io.nextInt();int c = io.nextInt();double[][] p = new double[r][c];for(int i=0;i<r;i++) {for(int j=0;j<c;j++) {p[i][j] = io.nextInt() / 100D;}}int[][] s = io.nextIntMatrix(r, c);stime = System.nanoTime();System.out.println(solve(r,c,p,s));// lap();}public static void lap() {System.out.println((System.nanoTime() - stime) / 1000000 + " ms");}public static String tetral(int x,int c) {StringBuilder sb = new StringBuilder();for(int i=0;i<c;i++) {sb.append(x & 3);x >>= 2;}return sb.toString();}public static String binary(int x,int c) {StringBuilder sb = new StringBuilder();for(int i=0;i<c;i++) {sb.append(x & 1);x >>= 1;}return sb.toString();}}class IO extends PrintWriter {private final InputStream in;private final byte[] buffer = new byte[1024];private int ptr = 0;private int buflen = 0;public IO() { this(System.in);}public IO(InputStream source) { super(System.out); this.in = source;}private boolean hasNextByte() {if (ptr < buflen) {return true;}else{ptr = 0;try {buflen = in.read(buffer);} catch (IOException e) {e.printStackTrace();}if (buflen <= 0) {return false;}}return true;}private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}public String next() {if (!hasNext()) {throw new NoSuchElementException();}StringBuilder sb = new StringBuilder();int b = readByte();while(isPrintableChar(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public char[] nextCharArray(int len) {if (!hasNext()) {throw new NoSuchElementException();}char[] s = new char[len];int i = 0;int b = readByte();while(isPrintableChar(b)) {if (i == len) {throw new InputMismatchException();}s[i++] = (char) b;b = readByte();}return s;}public String nextLine() {if (!hasNextLine()) {throw new NoSuchElementException();}StringBuilder sb = new StringBuilder();int b = readByte();while(!isNewLine(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public long nextLong() {if (!hasNext()) {throw new NoSuchElementException();}long n = 0;boolean minus = false;int b = readByte();if (b == '-') {minus = true;b = readByte();}if (b < '0' || '9' < b) {throw new NumberFormatException();}while(true){if ('0' <= b && b <= '9') {n *= 10;n += b - '0';}else if(b == -1 || !isPrintableChar(b)){return minus ? -n : n;}else{throw new NumberFormatException();}b = readByte();}}public int nextInt() {long nl = nextLong();if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {throw new NumberFormatException();}return (int) nl;}public char nextChar() {if (!hasNext()) {throw new NoSuchElementException();}return (char) readByte();}public double nextDouble() { return Double.parseDouble(next());}public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}public void close() { super.close(); try {in.close();} catch (IOException e) {}}}