結果
| 問題 |
No.309 シャイな人たち (1)
|
| コンテスト | |
| ユーザー |
 ぴろず
|
| 提出日時 | 2015-12-03 11:54:44 |
| 言語 | Java (openjdk 23) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 6,738 bytes |
| コンパイル時間 | 2,686 ms |
| コンパイル使用メモリ | 91,140 KB |
| 実行使用メモリ | 239,288 KB |
| 最終ジャッジ日時 | 2024-09-14 08:26:46 |
| 合計ジャッジ時間 | 13,072 ms |
|
ジャッジサーバーID （参考情報） |
judge6 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | -- * 3 |
| other | TLE * 2 -- * 11 |
ソースコード
//(◞‸◟)
package no309b;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.HashMap;
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) {
double ans = 0;
double[] bef = new double[1<<c];
bef[0] = 1;
HashMap<Long, Integer> pm = new HashMap<Long, Integer>(); //m1mの逆変換
long[] m1m = new long[1<<c]; //前の人の上げ方から得られるポイント
long[] m2m = new long[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] << 4) | (i >> j & 1);
m2m[i] = (m2m[i] << 4) | ((i >> j & 1) * 0xf);
}
pm.put(m1m[i], i);
bitcount[i] = Integer.bitCount(i);
}
long[] sm = new long[r]; //知っているときのポイントをlongに詰める
for(int i=0;i<r;i++) {
for(int j=c-1;j>=0;j--) {
sm[i] = (sm[i] << 4) | (4 - s[i][j]);
}
}
HashMap<Long, Integer> memo = new HashMap<Long, Integer>();
int[] point = new int[c];
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(Long.toBinaryString(m1) + "," + Long.toBinaryString(m2));
long pointm = (sm[i] & m2m[m2]) + m1m[m1]; //0~4 0と1は同一視できる
// System.out.println(Long.toHexString(pointm));
long magic = pointm | pointm >> 1;
pointm += ~(magic | magic >> 2 | 0xEEEE_EEEE_EEEE_EEEEL); //0を1に
// System.out.println(Long.toHexString(pointm));
//メモ化すればここが前計算O(C 5^C)で計算可能? この段階でポイントが1でも0でも変わらないからC 4^Cになる
Integer m3 = memo.get(pointm);
if (m3 == null) {
long pmm = pointm;
for(int j=0;j<c;j++) {
point[j] = (int) (pmm & 7);
pmm >>= 4;
}
for(int j=0;j<c-1;j++) {
if (point[j] >= 4) {
point[j+1]++;
}
}
for(int j=c-1;j>=1;j--) {
if (point[j] >= 4) {
point[j-1]++;
}
}
int m32 = 0;
for(int j=c-1;j>=0;j--) {
m32 <<= 1;
if (point[j] >= 4) {
m32 |= 1;
}
}
m3 = m32;
memo.put(pointm, m3);
}
now[m3] += bef[m1] * q;
ans += bef[m1] * q * bitcount[m3];
}
}
bef = now;
}
// System.out.println(memo.size());
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");
}
}
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) {}}
}