LightOJ-1027- A Dangerous Maze-直接递推期望

1027 - A Dangerous Maze

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

You are in a maze; seeing n doors in front of you in beginning. You can choose any door you like. The probability for choosing a door is equal for all doors.

If you choose the i^th door, it can either take you back to the same position where you begun in x_i minutes, or can take you out of the maze after x_i minutes. If you come back to the same position, you can't remember anything. So, every time you come to the beginning position, you have no past experience.

Now you want to find the expected time to get out of the maze.

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case contains a blank line and an integer n (1 ≤ n ≤ 100) denoting the number of doors. The next line contains n space separated integers. If the i^th integer (x_i)is positive, you can assume that the i^th door will take you out of maze after x_i minutes. If it's negative, then the i^th door will take you back to the beginning position after abs(x_i) minutes. You can safely assume that 1 ≤ abs(x_i) ≤ 10000.

Output

For each case, print the case number and the expected time to get out of the maze. If it's impossible to get out of the maze, print 'inf'. Print the result in p/q format. Where p is the numerator of the result and q is the denominator of the result and they are relatively prime. See the samples for details.

Sample Input	Output for Sample Input
3   1 1   2 -10 -3   3 3 -6 -9	Case 1: 1/1 Case 2: inf Case 3: 18/1

题意:

你在一个迷宫里,面前有n扇们,每个门有一个数字k;如果k为正数,则通过这扇门,走k分钟就能出去,

如果为负数,则通过这扇门走-k的分钟回到迷宫;走每扇门概率一样.问走出迷宫所需时间的期望值;

题解

我们来思考这么一个问题:

首先我们任意进入一个门的概率是1/n,设期望的逃出的时间为E;

如果我们进入了正数的门,则逃出去了,逃出的期望为1/n * T1 : T1:代表所有正数的逃出时间总和,

如果我们进入了负数的门,则进入一段时间回到原点,则逃出的期望为: 1/n*(T2 + m*E)

这上面怎么理解呢,T2:代表了所有负数的返回时间总和,而我们一共有m个负数的门,

假设我们进入其中的任意一个负数门,再回到原点时,现在面临的状态有初始化了,则又需要E的时间逃出去

我们来看以样例3

并来进行一定的推导:

E = 1/3 * 3 + 1/3 * (6+ E) + 1/3 *(9+E) 

E = 1/3(3+6+9+2*E)

3E = (3+6+9)+2*E

(3 - 2)E = (3+6+9)

推广到一般情况: (n - m)E = T1+T2 <=> E = (T1+T2) / (n-m)

当 m == n 时就是inf

代码:

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int caset,cas=0,n;scanf("%d",&caset);
    while(caset--) {
        scanf("%d",&n);
        int sum = 0,n1 = 0,n2 = 0;
        for(int i=0,x;i<n;i++) {
            scanf("%d",&x);
            if(x < 0) sum -= x,n2++;
            else sum += x,n1++;
        }
        printf("Case %d: ",++cas);
        if(n2 == n) printf("inf\n");
        else {
            int gcd = __gcd(sum,n1);
            printf("%d/%d\n",sum/gcd,n1/gcd);
        }
    }
    return 0;
}