Robot
Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 313 Accepted Submission(s): 123
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.
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.
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
Source
#include <iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
double dp[2][210];
int n,m,l,r,w;
int main()
{
int i,j,t,p;
double ans;
while(scanf("%d%d%d%d",&n,&m,&l,&r),n||m||l||r)
{
memset(dp[0],0,sizeof dp[0]);
t=0;
dp[t][0]=1;
l--,r--;
for(i=1;i<=m;i++)
{
memset(dp[t^1],0,sizeof dp[t^1]);
scanf("%d",&w);
for(j=0;j<n;j++)
{
if(dp[t][j]>0)
{
p=(j+w)%n;
dp[t^1][p]+=dp[t][j]*0.5;
p=(j+n-w%n)%n;
dp[t^1][p]+=dp[t][j]*0.5;
}
}
t^=1;
}
ans=0;
for(i=l;i<=r;i++)
ans+=dp[t][i];
printf("%.4lf\n",ans);
}
return 0;
}