【DFS】 CSU 1513 Kick the ball!

点击打开链接

A队B队轮流踢

注意当有一队发现自己赢不了时就结束踢球

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <set>
#include <vector>
#include <deque>
#include <map>
#define cler(arr, val)    memset(arr, val, sizeof(arr))
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long  LL;
const int MAXN = 1200;
const int MAXM = 140000;
const int INF = 0x3f3f3f3f;
const int mod = 1000000007;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
double x[2][22];
int abss(int x,int y)
{
    if(x-y>0)return x-y;
    else return y-x;
}
int h1,h2;
double hehe(int a,int b,int num,int flag)
{
    if(h1<a||h2<b) return 0;
    if(num>=10)//踢完
    {
        if(h1==a&&h2==b)
            return 1;
        else return 0;
    }
    if(a>b+(5-num/2)||b>a+(5-(num+1)/2))//最后赢不了,注意b>a的时候
    {
        if(h1==a&&h2==b)
            return 1;
        else
            return 0;
    }
    double ans=0;
    int xx,yy;
    if(!flag)
        xx=a+1,yy=b;
    else xx=a,yy=b+1;
    ans+=hehe(xx,yy,num+1,flag^1)*x[flag][num/2];//进球
    ans+=hehe(a,b,num+1,flag^1)*(1-x[flag][num/2]);//不进
    return ans;
}
int main()
{
    int cas=1;
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    //  freopen("out.txt", "w", stdout);
#endif
    while(scanf("%lf",&x[0][0])!=EOF)
    {
        for(int i=1; i<5; i++)
            scanf("%lf",&x[0][i]);
        for(int i=0; i<5; i++)
            scanf("%lf",&x[1][i]);
        scanf("%d-%d",&h1,&h2);
        double ans=0;
        ans+=hehe(0,0,0,0);
        printf("Case %d: %.2lf%%\n",cas++,ans*100);
    }
    return 0;
}