結果

問題 No.309 シャイな人たち (1)
ユーザー ぴろずぴろず
提出日時 2015-12-02 23:44:39
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 5,165 bytes
コンパイル時間 2,498 ms
コンパイル使用メモリ 77,680 KB
実行使用メモリ 53,536 KB
最終ジャッジ日時 2024-09-14 08:10:41
合計ジャッジ時間 10,707 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 WA -
testcase_02 WA -
testcase_03 WA -
testcase_04 AC 181 ms
53,392 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 54 ms
50,196 KB
testcase_14 AC 54 ms
49,900 KB
testcase_15 WA -
権限があれば一括ダウンロードができます

ソースコード

diff # 

package no309;

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 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);
//		long stime = System.nanoTime();
		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;
					}

					long point = 0;

					for(int j=0;j<c;j++) {
						if ((m2 >> j & 1) > 0) {
							point += 4 - s[i][j] << j * 4;
						}
						if ((m1 >> j & 1) > 0) {
							point += 1 << j * 4;
						}
					}

					long mask = 0x4444_4444_4444_4444L;
					point += (point & mask) >> 6;
					point += (point & mask) << 2;

					int m3 = 0; //この列の手の挙げ方
					int count = 0;
					for(int j=c-1;j>=0;j--) {
						m3 <<= 1;
						if ((point >> j * 4 & 0xf) >= 4) {
							m3 |= 1;
							count++;
						}
					}
					now[m3] += bef[m1] * q;
					ans += bef[m1] * q * count;
				}
			}

			bef = now;
		}

		System.out.println(ans);
//		long etime = System.nanoTime();
//		System.out.println("time: " + (etime - stime) / 1000000 + " ms");
	}

}
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) {}}
}
0