HDU 5602 Black Jack（博弈dp）

最新推荐文章于 2020-08-09 20:49:48 发布

TaoSama

最新推荐文章于 2020-08-09 20:49:48 发布

阅读量860

点赞数 1

分类专栏：动态规划文章标签：博弈dp

本文链接：https://blog.csdn.net/lwt36/article/details/50411205

版权

动态规划专栏收录该内容

135 篇文章 0 订阅

订阅专栏

题意:

$纸牌游戏21点, 牌面大小\in[1,10],由于牌数无限,取到[1,9]的概率是1/13, 取到10的概率是4/13$
$A,B一开始都有2张牌, 然后A不停的叫牌直到停牌, 中途爆点直接输, B同样, 然后比大小,大的赢$
$求A胜的概率, 大于0.5输出YES,否则NO$

分析:

$f[A][a][b]:=当前局面A点数为a,B点数为b, A的胜率$
$f[B][a][b]:=当前局面A点数为a,B点数为b, B的输率$
$显然A要尽可能使得胜率变大, B要使得输率尽可能变小$
$转移直接按照题目转移即可$

代码:

//
//  Created by TaoSama on 2015-12-26
//  Copyright (c) 2015 TaoSama. All rights reserved.
//
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>

using namespace std;
#define pr(x) cout << #x << " = " << x << "  "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;

double f[2][32][32];
bool vis[2][32][32];

int get(char c) {
    if(c == 'A') return 1;
    else if(isdigit(c)) return c - '0';
    return 10;
}

//1->losing prob
double dfs1(int a, int b) {
    if(b > 21) return 1;
    double &ret = f[1][a][b], tmp = 0;
    if(vis[1][a][b]) return ret;
    vis[1][a][b] = true;
    ret = a > b;
    for(int i = 1; i <= 9; ++i) tmp += dfs1(a, b + i);
    tmp += 4 * dfs1(a, b + 10);
    tmp /= 13;
    return ret = min(ret, tmp);
}

//0->winning prob
double dfs0(int a, int b) {
    if(a > 21) return 0;
    double &ret = f[0][a][b], tmp = 0;
    if(vis[0][a][b]) return ret;
    vis[0][a][b] = true;
    ret = dfs1(a, b);
    for(int i = 1; i <= 9; ++i) tmp += dfs0(a + i, b);
    tmp += 4 * dfs0(a + 10, b);
    tmp /= 13;
    return ret = max(ret, tmp);
}

int main() {
#ifdef LOCAL
    freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
//  freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
    ios_base::sync_with_stdio(0);

    int t; scanf("%d", &t);
    while(t--) {
        char s[5]; scanf("%s", s);
        double ans = dfs0(get(s[0]) + get(s[1]), get(s[2]) + get(s[3]));
//      printf("%.10f\n", ans);
        puts(ans > 0.5 ? "YES" : "NO");
    }
    return 0;
}