专栏首页算法修养POJ-1644 To Bet or Not To Bet(概率DP)

POJ-1644 To Bet or Not To Bet(概率DP)

To Bet or Not To Bet Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 1668 Accepted: 541 Description

Alexander Charles McMillan loves to gamble, and during his last trip to the casino he ran across a new game. It is played on a linear sequence of squares as shown below.

A chip is initially placed on the Start square. The player then tries to move the chip to the End square through a series of turns, at which point the game ends. In each turn a coin is fl ipped: if the coin is heads the chip is moved one square to the right and if the coin is tails the chip is moved two squares to the right (unless the chip is one square away from the End square, in which case it just moves to the End square). At that point, any instruction on the square the coin lands on must be followed. Each instruction is one of the following: 1. Move right n squares (where n is some positive integer) 2. Move left n squares (where n is some positive integer) 3. Lose a turn 4. No instruction After following the instruction, the turn ends and a new one begins. Note that the chip only follows the instruction on the square it lands on after the coin flip. If, for example, the chip lands on a square that instructs it to move 3 spaces to the left, the move is made, but the instruction on the resulting square is ignored and the turn ends. Gambling for this game proceeds as follows: given a board layout and an integer T, you must wager whether or not you think the game will end within T turns. After losing his shirt and several other articles of clothing, Alexander has decided he needs professional help-not in beating his gambling addiction, but in writing a program to help decide how to bet in this game. Input

Input will consist of multiple problem instances. The first line will consist of an integer n indicating the number of problem instances. Each instance will consist of two lines: the first will contain two integers m and T (1 <= m <= 50, 1 <= T <= 40), where m is the size of the board excluding the Start and End squares, and T is the target number of turns. The next line will contain instructions for each of the m interior squares on the board. Instructions for the squares will be separated by a single space, and a square instruction will be one of the following: +n, -n, L or 0 (the digit zero). The first indicates a right move of n squares, the second a left move of n squares, the third a lose-a-turn square, and the fourth indicates no instruction for the square. No right or left move will ever move you off the board. Output

Output for each problem instance will consist of one line, either Bet for. x.xxxx if you think that there is a greater than 50% chance that the game will end in T or fewer turns, or Bet against. x.xxxx if you think there is a less than 50% chance that the game will end in T or fewer turns, or Push. 0.5000 otherwise, where x.xxxx is the probability of the game ending in T or fewer turns rounded to 4 decimal places. (Note that due to rounding the calculated probability for display, a probability of 0.5000 may appear after the Bet for. or Bet against. message.) Sample Input

5 4 4 0 0 0 0 3 3 0 -1 L 3 4 0 -1 L 3 5 0 -1 L 10 20 +1 0 0 -1 L L 0 +3 -7 0 Sample Output

Bet for. 0.9375 Bet against. 0.0000 Push. 0.5000 Bet for. 0.7500 Bet for. 0.8954

概率DP题目, 递推即可,

#include <iostream>
#include <string.h>
#include <algorithm>
#include <math.h>
#include <stdlib.h>
#include <string>

using namespace std;
#define MAX 999999
char a[55];
int m,t;
double dp[55][55];
int b[55];
int main()
{
    int cas;
    scanf("%d",&cas);
    while(cas--)
    {
        memset(dp,0,sizeof(dp));
        memset(b,0,sizeof(b));
        scanf("%d%d",&m,&t);
        for(int i=1;i<=m;i++)
        {
            scanf("%s",a);

             if(a[0]=='L')
                b[i]=MAX;
             else
                 sscanf(a,"%d",&b[i]);
        }
        b[0]=0;b[m+1]=0;b[m+2]=-1;
        dp[0][0]=1.0;
        for(int i=0;i<t;i++)
        {
            for(int j=0;j<m+1;j++)
            {
                if(b[j+1]==MAX)
                    dp[i+2][j+1]+=dp[i][j]*0.5;
                else
                    dp[i+1][j+b[j+1]+1]+=dp[i][j]*0.5;
                if(b[j+2]==MAX)
                    dp[i+2][j+2]+=dp[i][j]*0.5;
                else
                    dp[i+1][j+b[j+2]+2]+=dp[i][j]*0.5;
            }
        }
        double ans=0;
        for(int i=0;i<=t;i++)
            ans+=dp[i][m+1];
        if(ans>0.5)
            printf("Bet for. %.4f\n",ans);
        else if(ans==0.5)
            printf("Push. 0.5000\n");
        else if(ans<0.5)
            printf("Bet against. %.4f\n",ans);

    }
    return 0;
}

本文参与腾讯云自媒体分享计划,欢迎正在阅读的你也加入,一起分享。

我来说两句

0 条评论
登录 后参与评论

相关文章

  • ZOJ 3202 Second-price Auction

    Time Limit: 1 Second      Memory Limit: 32768 KB

    ShenduCC
  • HOJ-2056 Bookshelf(线性动态规划)

    L is a rather sluttish guy. He almost never clean up his surroundings or regulat...

    ShenduCC
  • CodeForces 665B Shopping

    B. Shopping time limit per test 1 second memory limit per test 256 megabyt...

    ShenduCC
  • 聊聊flink LocalEnvironment的execute方法

    flink-java-1.6.2-sources.jar!/org/apache/flink/api/java/DataSet.java

    codecraft
  • Duke@coursera 数据分析与统计推断unit5 inference for categorical variables

    一、sampling variability & CLT for proportions

    统计学家
  • 多目标进化算法应用于提高医药数据领域学习器的性能(CS AI)

    原文标题完整翻译:多目标进化算法应用于提高在医药数据领域使用整体特征选择和离散化模型的学习器的性能

    Donuts_choco
  • Redis 为什么这么快?(9)

    因为单线程已经够用了,CPU不是redis的瓶颈。Redis的瓶颈最有可能是机器内存或者网络带宽。既然单线程容易实现,而且CPU不会成为瓶颈,那就顺理成章地采用...

    兜兜毛毛
  • Duke@coursera 数据分析与统计推断unit6introduction to linear regression

    properties (I) the magnitude (absolutevalue) of the correlation coefficient meas...

    统计学家
  • linux kernel Documentation filesystems overlayfs

    Please see MAINTAINERS file for where to send questions.

    heidsoft
  • 聊聊flink LocalEnvironment的execute方法

    flink-java-1.6.2-sources.jar!/org/apache/flink/api/java/DataSet.java

    codecraft

扫码关注云+社区

领取腾讯云代金券