1122 - Digit Count
Time Limit: 2 second(s) | Memory Limit: 32 MB |
Given a set of digits S, and an integer n, you have to find how many n-digit integers are there, which contain digits that belong to S and the difference between any two adjacent digits is not more than two.
Input
Input starts with an integer T (≤ 300), denoting the number of test cases.
Each case contains two integers, m (1 ≤ m < 10) and n (1 ≤ n ≤ 10). The next line will contain m integers (from 1 to 9)separated by spaces. These integers form the set S as described above. These integers will be distinct and given in ascending order.
Output
For each case, print the case number and the number of valid n-digit integers in a single line.
Sample Input | Output for Sample Input |
3 3 2 1 3 6 3 2 1 2 3 3 3 1 4 6 | Case 1: 5 Case 2: 9 Case 3: 9 |
Note
For the first case the valid integers are
11
13
31
33
66
题意:给你m个数,让你组成一个n位数,相邻的两位之差不能>2,可以为0;
思路:m很小最大是9,如果组成数字的位数很小的时候还行,多了就不好枚举了,太复杂,而且时间也不允许,造成时间复杂度高的原因仍然是中间的相同状态查询了多次,比如,第n位的数字由1,变成了2,还需要将前面的所有位上的数枚举一边看有多少种情况,很明显查询重复了很多次,所以我们应该保存中间状态,将问题化简成小问题,dp[i][j]:第i位上的数字是a[j]时的情况有多少种,那么dp[i][j]就可以由dp[i-1]推出来;
失误:比赛最后一分钟刚刚写好,就差几秒,写了40分钟,主要是状态方程最后的写法,其实最开始不要去想怎么写代码,主要指思路,如果一直想代码怎么写可能某个条件控制不清晰就会影响思路,把思路想清楚,主要是大的方向,像怎么控制条件,选择都是小问题,到写程序的时候就是水到渠成的了。
AC代码:
#include<cstdio>
#include<cstring>
using namespace std;
int a[22],dp[22][33];
int main()
{
int T,i,j,k,Kase=0,M,N,t,ans;
scanf("%d",&T);
while(T--)
{
memset(dp,0,sizeof(dp));
scanf("%d %d",&M,&N);
for(i=1;i<=M;++i) scanf("%d",&a[i]),dp[1][i]=1;
for(i=1;i<=N;++i)
{
for(j=1;j<=M;++j)
{
for(k=1;k<=M;++k)
{
t=a[j]-a[k];
if(t>=-2&&t<=2) dp[i][j]+=dp[i-1][k];
}
}
}
ans=0;
for(i=1;i<=M;++i) ans+=dp[N][i];
printf("Case %d: %d\n",++Kase,ans);
}
return 0;
}