#62383 (Java) No.309 シャイな人たち (1)

• 問題: No.309 シャイな人たち (1)
• ユーザー: holeguma
• 提出日時: 2015-12-04 01:12:28
• 言語: Java (openjdk 23)
• 結果: RE
• 実行時間: -
• コード長: 4,150 bytes
• コンパイル時間: 2,615 ms
• コンパイル使用メモリ: 80,252 KB
• 実行使用メモリ: 54,620 KB
• 最終ジャッジ日時: 2024-09-14 10:46:32
• 合計ジャッジ時間: 4,145 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

ファイルパターン	結果
sample	RE * 3
other	RE * 13

ソースコード

import java.io.InputStream;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.math.BigInteger;

public class Main{

static PrintWriter out;
static InputReader ir;

static void solve(){
 int n=ir.nextInt(),m=ir.nextInt();
 int[][] p=new int[n][],s=new int[n][];
 int[] se=new int[1<<(m*2)],co=new int[m],bit=new int[1<<m];
 double[] pre=new double[1<<m],now=new double[1<<m];
 for(int i=0;i<n;i++){
  p[i]=ir.nextIntArray(m);
  s[i]=ir.nextIntArray(m);
 }
 for(int i=0;i<1<<(m*2);i++){
  int mask=i;
  ArrayDeque<Integer> que=new ArrayDeque<>();
  for(int j=0;j<m;j++){
   co[j]=mask&3;
   if(co[j]==0) que.add(i);
   mask>>=2;
  }
  while(!que.isEmpty()){
   int t=que.poll();
   se[i]|=1<<t;
   if(t!=0){
    co[t-1]--;
    if(co[t-1]==0){
     que.add(t-1);
     se[i]|=1<<(t-1);
    }
   }
   if(t!=m-1){
    co[t+1]--;
    if(co[t+1]==0){
     que.add(t+1);
     se[i]|=1<<(t+1);
    }
   }
  }
 }
 for(int i=0;i<1<<m;i++){
  bit[i]=Integer.bitCount(i);
  pre[i]=1.0;
 }
 double ans=0.0;
 for(int i=0;i<n;i++){
  for(int ma1=0;ma1<1<<m;ma1++){
   now[ma1]=1.0;
   for(int k=0;k<m;k++){
    now[ma1]*=((ma1&(1<<k))!=0)?(double)p[i][k]/100:1.0-(double)p[i][k]/100;
   }
   for(int ma2=0;ma2<((i==0)?1:1<<m);ma2++){
    int mask=0;
    for(int j=0;j<m;j++){
     mask<<=2;
     int re=4;
     if((ma1&(1<<j))!=0&&s[i][j]!=4) re=s[i][j];
     if((ma2&(1<<j))!=0) re--;
     if(re>=3) re=3;
     if(re<=0) re=0;
     mask|=re;
    }
    ans+=(double)bit[se[mask]]*now[ma1]*pre[ma2];
   }
  }
  pre=now;
 }
 out.printf("%.15f\n",ans);
}

public static void main(String[] args) throws Exception{
 ir=new InputReader(System.in);
 out=new PrintWriter(System.out);
 solve();
 out.flush();
}

static class InputReader {
 private InputStream in;
 private byte[] buffer=new byte[1024];
 private int curbuf;
 private int lenbuf;

 public InputReader(InputStream in) {this.in=in; this.curbuf=this.lenbuf=0;}
 
 public boolean hasNextByte() {
  if(curbuf>=lenbuf){
   curbuf= 0;
   try{
    lenbuf=in.read(buffer);
   }catch(IOException e) {
    throw new InputMismatchException();
   }
   if(lenbuf<=0) return false;
  }
  return true;
 }

 private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;}
 
 private boolean isSpaceChar(int c){return !(c>=33&&c<=126);}
 
 private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;}
 
 public boolean hasNext(){skip(); return hasNextByte();}
 
 public String next(){
  if(!hasNext()) throw new NoSuchElementException();
  StringBuilder sb=new StringBuilder();
  int b=readByte();
  while(!isSpaceChar(b)){
   sb.appendCodePoint(b);
   b=readByte();
  }
  return sb.toString();
 }
 
 public int nextInt() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  int res=0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }
 
 public long nextLong() {
  if(!hasNext()) throw new NoSuchElementException();
  int c=readByte();
  while (isSpaceChar(c)) c=readByte();
  boolean minus=false;
  if (c=='-') {
   minus=true;
   c=readByte();
  }
  long res = 0;
  do{
   if(c<'0'||c>'9') throw new InputMismatchException();
   res=res*10+c-'0';
   c=readByte();
  }while(!isSpaceChar(c));
  return (minus)?-res:res;
 }

 public double nextDouble(){return Double.parseDouble(next());}

 public BigInteger nextBigInteger(){return new BigInteger(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 char[][] nextCharMap(int n,int m){
  char[][] map=new char[n][m];
  for(int i=0;i<n;i++) map[i]=next().toCharArray();
  return map;
 }
}
}