[DP] 51Nod 1293 球与切换器

经过该切换器的球的总量是k，发现如果是该位置的值是1，那么会有(k+1)/2的球像右去，剩下的球向下去。如果该位置的值是-1，那么会有(k+1)/2的球像下去，剩下的球向右去。

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
typedef long long ll;

inline char nc(){
  static char buf[100000],*p1=buf,*p2=buf;
  if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
  return *p1++;
}

inline void read(int &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

inline void read(ll &x){
  char c=nc(),b=1;
  for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
  for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=1005;

int n,m,a[N][N];
ll f[2][N][N];

int main(){
  read(m); read(n); read(f[0][1][1]);
  for (int i=1;i<=n;i++) for (int j=1;j<=m;j++) read(a[i][j]);
  for (int i=1;i<=n;i++)
    for (int j=1;j<=m;j++)
      if (a[i][j]==0){
	f[0][i+1][j]+=f[0][i][j];
	f[1][i][j+1]+=f[1][i][j];
      }else if (a[i][j]==1){
	ll k=f[0][i][j]+f[1][i][j];
	f[1][i][j+1]+=(k+1)>>1;
	f[0][i+1][j]+=k>>1;
      }else{
	ll k=f[0][i][j]+f[1][i][j];
	f[0][i+1][j]+=(k+1)>>1;
	f[1][i][j+1]+=k>>1;
      }
  printf("%lld\n",f[0][n+1][m]+f[1][n+1][m]);
  return 0;
}