Robot - HDU 4576 dp

Robot

Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 102400/102400 K (Java/Others)
Total Submission(s): 2468    Accepted Submission(s): 868

Problem Description

Michael has a telecontrol robot. One day he put the robot on a loop with n cells. The cells are numbered from 1 to n clockwise.



At first the robot is in cell 1. Then Michael uses a remote control to send m commands to the robot. A command will make the robot walk some distance. Unfortunately the direction part on the remote control is broken, so for every command the robot will chose a direction(clockwise or anticlockwise) randomly with equal possibility, and then walk w cells forward.
Michael wants to know the possibility of the robot stopping in the cell that cell number >= l and <= r after m commands.

 

Input

There are multiple test cases. 
Each test case contains several lines.
The first line contains four integers: above mentioned n(1≤n≤200) ,m(0≤m≤1,000,000),l,r(1≤l≤r≤n).
Then m lines follow, each representing a command. A command is a integer w(1≤w≤100) representing the cell length the robot will walk for this command.  
The input end with n=0,m=0,l=0,r=0. You should not process this test case.

 

Output

For each test case in the input, you should output a line with the expected possibility. Output should be round to 4 digits after decimal points.

 

Sample Input

  
  

   
   3 1 1 2
1
5 2 4 4
1
2
0 0 0 0
  
  

 

Sample Output

  
  

   
   0.5000
0.2500
  
  
  
  


  
  

题意：一个机器人在一个顺时针的1-n的格子上走，每个走k格，但是可能往前走，也可能往后走，问最后在l-r的概率是多少。

思路：大水题，每次找到它从i=1;i<=n;i++时的i对应的前面到的格q，和后面到的格h,dp[q]=dp[i]*0.5；dp[h]=dp[i]*0.5;注意分两个数组，来回倒着用。表示前一步的状态和走完当前一步的状态。

AC代码如下：

#include<cstdio>
#include<cstring>
using namespace std;
double dp[220][2];
int main()
{ int i,j,k,n,m,l,r,q,h,f=0;
  double ans;
  while(~scanf("%d%d%d%d",&n,&m,&l,&r) && n>0)
  { ans=0;
    f=0;
    memset(dp,0,sizeof(dp));
    dp[1][0]=1;
    while(m--)
    { f=(f+1)%2;
      scanf("%d",&k);
      for(i=1;i<=n;i++)
      { q=(i+k)%n;
        if(q==0)
         q=n;
        h=i-k;
        while(h<=0)
         h+=n;
        dp[q][f]+=dp[i][(f+1)%2]*0.5;
        dp[h][f]+=dp[i][(f+1)%2]*0.5;
        dp[i][(f+1)%2]=0;
      }
    }
    for(i=l;i<=r;i++)
     ans+=dp[i][f];
    printf("%.4f\n",ans);
  }
}