結果

問題 No.309 シャイな人たち (1)
ユーザー uwiuwi
提出日時 2015-12-02 06:35:37
言語 Java21
(openjdk 21)
結果
AC  
実行時間 2,120 ms / 4,000 ms
コード長 5,527 bytes
コンパイル時間 4,265 ms
コンパイル使用メモリ 82,516 KB
実行使用メモリ 61,632 KB
最終ジャッジ日時 2024-09-14 07:50:07
合計ジャッジ時間 31,877 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2,069 ms
61,552 KB
testcase_01 AC 2,062 ms
61,632 KB
testcase_02 AC 2,097 ms
61,628 KB
testcase_03 AC 2,089 ms
61,460 KB
testcase_04 AC 266 ms
42,912 KB
testcase_05 AC 606 ms
47,380 KB
testcase_06 AC 2,068 ms
61,404 KB
testcase_07 AC 2,062 ms
61,500 KB
testcase_08 AC 2,076 ms
61,492 KB
testcase_09 AC 2,095 ms
61,572 KB
testcase_10 AC 2,104 ms
61,608 KB
testcase_11 AC 2,108 ms
61,608 KB
testcase_12 AC 2,120 ms
61,264 KB
testcase_13 AC 124 ms
40,912 KB
testcase_14 AC 125 ms
41,072 KB
testcase_15 AC 627 ms
47,404 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package q8xx;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.Queue;

// TLEしそう(こなみ
public class Q846 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
//	String INPUT = "11 11 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ "9 9 9 9 9 9 9 9 9 9 9 "
//			+ ""
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "3 3 3 3 3 3 3 3 3 3 3 "
//			+ "";
	
	void solve()
	{
		int n = ni(), m = ni();
		int[][] P = new int[n][];
		for(int i = 0;i < n;i++)P[i] = na(m);
		int[][] S = new int[n][];
		for(int i = 0;i < n;i++)S[i] = na(m);
		
		Queue<Integer> q = new ArrayDeque<Integer>();
		int[] trans = new int[1<<2*m];
		for(int i = 0;i < 1<<2*m;i++){
			int x = i;
			for(int j = 0;j < m;j++){
				if((i>>>2*j&3) == 0){
					q.add(j);
				}
			}
			while(!q.isEmpty()){
				int cur = q.poll();
				if(cur-1 >= 0 && (x>>>2*(cur-1)&3) > 0){
					x -= 1<<2*(cur-1);
					if((x>>>2*(cur-1)&3) == 0){
						q.add(cur-1);
					}
				}
				if(cur+1 < m && (x>>>2*(cur+1)&3) > 0){
					x -= 1<<2*(cur+1);
					if((x>>>2*(cur+1)&3) == 0){
						q.add(cur+1);
					}
				}
			}
			for(int j = 0;j < m;j++){
				if((x>>>2*j&3) == 0){
					trans[i] |= 1<<j;
				}
			}
//			tr(i, trans[i]);
		}
		
		double[] last = new double[1<<m];
		last[0] = 1;
		double E = 0;
		for(int i = 0;i < n;i++){
			double[] nlast = new double[1<<m];
			for(int j = 0;j < 1<<m;j++){
				double pr = 1;
				for(int k = 0;k < m;k++){
					if(j<<~k<0){
						pr *= (double)P[i][k]/100;
					}else{
						pr *= (double)(100-P[i][k])/100;
					}
				}
				int[] lefti = new int[m];
				Arrays.fill(lefti, 4);
				for(int k = 0;k < m;k++){
					if(j<<~k<0){
						lefti[k] = S[i][k];
					}
				}
				
				for(int k = 0;k < 1<<m;k++){
					int ind = 0;
					for(int l = 0;l < m;l++){
						int val = Math.max(lefti[l] - (k>>>l&1), 0);
						if(val >= 4)val = 3;
						ind |= val<<2*l;
					}
//					tr(i, j, k, ind, trans[ind], pr, last[k]);
					nlast[trans[ind]] += pr * last[k];
					E += pr*Integer.bitCount(trans[ind])*last[k];
				}
			}
			last = nlast;
		}
		out.printf("%.14f\n", E);
	}
	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new Q846().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0