Submission #19059644

---

Source Code Expand

#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(char &c){
  int i;
  for(;;){
    i = my_getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c = i;
}
inline int rd(char c[]){
  int i;
  int sz = 0;
  for(;;){
    i = my_getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c[sz++] = i;
  for(;;){
    i = my_getchar_unlocked();
    if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){
      break;
    }
    c[sz++] = i;
  }
  c[sz]='\0';
  return sz;
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
int WRITER_DOUBLE_DIGIT = 15;
inline int writerDigit_double(){
  return WRITER_DOUBLE_DIGIT;
}
inline void writerDigit_double(int d){
  WRITER_DOUBLE_DIGIT = d;
}
inline void wt_L(double x){
  const int d = WRITER_DOUBLE_DIGIT;
  int k;
  int r;
  double v;
  if(x!=x || (x==x+1 && x==2*x)){
    my_putchar_unlocked('E');
    my_putchar_unlocked('r');
    my_putchar_unlocked('r');
    return;
  }
  if(x < 0){
    my_putchar_unlocked('-');
    x = -x;
  }
  x += 0.5 * pow(0.1, d);
  r = 0;
  v = 1;
  while(x >= 10*v){
    v *= 10;
    r++;
  }
  while(r >= 0){
    r--;
    k = floor(x / v);
    if(k >= 10){
      k = 9;
    }
    if(k <= -1){
      k = 0;
    }
    x -= k * v;
    v *= 0.1;
    my_putchar_unlocked(k + '0');
  }
  if(d > 0){
    my_putchar_unlocked('.');
    v = 1;
    for(r=(0);r<(d);r++){
      v *= 0.1;
      k = floor(x / v);
      if(k >= 10){
        k = 9;
      }
      if(k <= -1){
        k = 0;
      }
      x -= k * v;
      my_putchar_unlocked(k + '0');
    }
  }
}
template<class S, class T> inline S chmin(S &a, T b){
  if(a>b){
    a=b;
  }
  return a;
}
int N = 4;
char S[4][6];
double dp[70000];
int main(){
  int i;
  int j;
  int ni;
  int nj;
  int nij;
  int mask;
  int dm;
  double tmp;
  int dx[5] = {0, 1, -1, 0, 0};
  int dy[5] = {0, 0, 0, 1, -1};
  for(mask=(1);mask<(1<<16);mask++){
    dp[mask] = 1e150;
    for(i=(0);i<(N);i++){
      for(j=(0);j<(N);j++){
        int d;
        dm = 5;
        tmp = 0;
        for(d=(0);d<(5);d++){
          {
            auto WYIGIcGE = (i + dx[d]);
            auto t_ynMSdg = ( j + dy[d]);
            ni = WYIGIcGE;
            nj = t_ynMSdg;
          }
          nij = ni * N + nj;
          if(ni < 0 || nj < 0 || ni >= N || nj >= N || !((mask) &(1<<(nij)))){
            continue;
          }
          tmp += dp[mask ^(1<<(nij))];
          dm--;
        }
        if(dm==5){
          continue;
        }
        chmin(dp[mask], (tmp + 5) / (5 - dm));
      }
    }
  }
  {
    int KrdatlYV;
    for(KrdatlYV=(0);KrdatlYV<(N);KrdatlYV++){
      rd(S[KrdatlYV]);
    }
  }
  mask = 0;
  for(i=(0);i<(N);i++){
    for(j=(0);j<(N);j++){
      if(S[i][j]=='#'){
        mask |=(1<<(i*4+j));
      }
    }
  }
  wt_L(dp[mask]);
  wt_L('\n');
  return 0;
}
// cLay version 20201229-1

// --- original code ---
// int N = 4;
// char S[4][6];
// double dp[7d4];
// {
//   int i, j, ni, nj, nij;
//   int mask, dm;
//   double tmp;
//   int dx[5] = {0, 1, -1, 0, 0};
//   int dy[5] = {0, 0, 0, 1, -1};
//   rep(mask,1,1<<16){
//     dp[mask] = double_inf;
//     rep(i,N) rep(j,N){
//       dm = 5;
//       tmp = 0;
//       rep(d,5){
//         (ni, nj) = (i + dx[d], j + dy[d]);
//         nij = ni * N + nj;
//         if(ni < 0 || nj < 0 || ni >= N || nj >= N || !BIT_ith(mask, nij)) continue;
//         tmp += dp[mask ^ BIT_ith(nij)];
//         dm--;
//       }
//       if(dm==5) continue;
//       dp[mask] <?= (tmp + 5) / (5 - dm);
//     }
//   }
//   rd(S(N));
//   mask = 0;
//   rep(i,N) rep(j,N) if(S[i][j]=='#') mask |= BIT_ith(i*4+j);
//   wt(dp[mask]);
// }

Submission Info

Judge Result