HDOJ 3555 Bomb

最新推荐文章于 2016-02-04 18:55:51 发布

B12040331

最新推荐文章于 2016-02-04 18:55:51 发布

阅读量1.1k

点赞数

分类专栏： ACM_动态规划那些年我们一起做过的ACM 文章标签： HDOJ 数位DP

本文链接：https://blog.csdn.net/u010084308/article/details/40902907

版权

那些年我们一起做过的ACM 同时被 2 个专栏收录

108 篇文章 3 订阅

订阅专栏

ACM_动态规划

7 篇文章 0 订阅

订阅专栏

题目：

【科普】什么是BestCoder？如何参加？
NEW~ 关于举办计算机学院大学生程序设计竞赛（2014'11）的报名通知

Bomb

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 8265 Accepted Submission(s): 2891

Problem Description

The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. If the current number sequence includes the sub-sequence "49", the power of the blast would add one point.
Now the counter-terrorist knows the number N. They want to know the final points of the power. Can you help them?

Input

The first line of input consists of an integer T (1 <= T <= 10000), indicating the number of test cases. For each test case, there will be an integer N (1 <= N <= 2^63-1) as the description.

The input terminates by end of file marker.

Output

For each test case, output an integer indicating the final points of the power.

Sample Input

Sample Output

      
      
       
       0
1
15


       
       
        
        
         
         Hint
        
        From 1 to 500, the numbers that include the sub-sequence "49" are "49","149","249","349","449","490","491","492","493","494","495","496","497","498","499",
so the answer is 15.

传送门：点击打开链接

解题思路：

数位dp+记忆化搜索。

注意几个点：49，前面所有数都达到限制条件，并且包含49，返回1；492，在查找前两位变成49之后，第三位在满足限制条件的情况下应该返回1；4950，在查找前两位变成49之后，第三位取0,1,2,3,4都应该返回10，取5返回1。所以就有了下面tag和flag的判断限制条件。

代码：

/*数位dp*/
#include <cstdio>
#include <cstring>

typedef long long lint;
const int MAXN = 25;
int t, num[MAXN];
lint n, f[MAXN], dp[MAXN][MAXN];

//cur：当前位数，x：前一位的值，
//tag：在前面所有的数达到限制的条件下遇到49，flag是否达到限制
lint dfs(int cur, int x, bool tag, bool flag)
{
    //printf("%d %d\n", cur, x);
    if(tag && !flag) return f[cur+1];
    if(cur < 0)
    {
        if(tag && flag) return 1;
        return 0;
    }
    if(!flag && -1!=dp[cur][x])
    {
        return dp[cur][x];
    }
    lint ret = 0;
    int iend = flag ? num[cur] : 9;
    for(int i=0; i<=iend; ++i)
    {
        if(4==x && 9==i)
        {
            if(!flag)
            {
                ret += f[cur];
            }
            else
            {
                ret += dfs(cur-1, i, true, true);
            }
        }
        else
        {
            ret += dfs(cur-1, i, tag, flag&&(i==iend));
        }
    }
    if(!flag) dp[cur][x] = ret;
   // printf("%d %d %I64d %d\n", cur, x, ret, flag);
    return ret;
}

int main()
{
    memset(dp, -1, sizeof(dp));
    memset(f, 0, sizeof(f));
    f[0] = 1;
    for(int i=1; i<=18; ++i)
    {
        f[i] = 10*f[i-1];
    }
    scanf("%d", &t);
    while(t--)
    {
        scanf("%I64d", &n);
        int m = 0;
        lint k = n;
        while(k)
        {
            num[m++] = k%10;
            k /= 10;
        }
        printf("%I64d\n", dfs(m-1, -1, false, true));
    }
    return 0;
}