Function Run Fun
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 19578 | Accepted: 9887 |
Description
We all love recursion! Don't we?
Consider a three-parameter recursive function w(a, b, c):
if a <= 0 or b <= 0 or c <= 0, then w(a, b, c) returns: 1
if a > 20 or b > 20 or c > 20, then w(a, b, c) returns: w(20, 20, 20)
if a < b and b < c, then w(a, b, c) returns: w(a, b, c-1) + w(a, b-1, c-1) - w(a, b-1, c)
otherwise it returns: w(a-1, b, c) + w(a-1, b-1, c) + w(a-1, b, c-1) - w(a-1, b-1, c-1)
This is an easy function to implement. The problem is, if implemented directly, for moderate values of a, b and c (for example, a = 15, b = 15, c = 15), the program takes hours to run because of the massive recursion.
Consider a three-parameter recursive function w(a, b, c):
if a <= 0 or b <= 0 or c <= 0, then w(a, b, c) returns: 1
if a > 20 or b > 20 or c > 20, then w(a, b, c) returns: w(20, 20, 20)
if a < b and b < c, then w(a, b, c) returns: w(a, b, c-1) + w(a, b-1, c-1) - w(a, b-1, c)
otherwise it returns: w(a-1, b, c) + w(a-1, b-1, c) + w(a-1, b, c-1) - w(a-1, b-1, c-1)
This is an easy function to implement. The problem is, if implemented directly, for moderate values of a, b and c (for example, a = 15, b = 15, c = 15), the program takes hours to run because of the massive recursion.
Input
The input for your program will be a series of integer triples, one per line, until the end-of-file flag of -1 -1 -1. Using the above technique, you are to calculate w(a, b, c) efficiently and print the result.
Output
Print the value for w(a,b,c) for each triple.
Sample Input
1 1 1 2 2 2 10 4 6 50 50 50 -1 7 18 -1 -1 -1
Sample Output
w(1, 1, 1) = 2 w(2, 2, 2) = 4 w(10, 4, 6) = 523 w(50, 50, 50) = 1048576 w(-1, 7, 18) = 1
Source
题目大意:题目给出了w函数的递归,但是直接用递归的话会超时,给出未知数a,b,c的值,另想方法求函数的值。
大致思路:因为是道简单题,直接用超时的话用打表就好了,详见代码。(题目给了状态方程,还可以用dp写)
#include<iostream> using namespace std; #include<cstdio> int main() { int w[21][21][21],a,b,c,res; for(int i=0;i<21;i++)//打表可以优化时间复杂度 for(int j=0;j<21;j++) for(int k=0;k<21;k++) { if(!i||!j||!k)//因为是从零开始的,所以不考虑负的情况 w[i][j][k]=1; else if(i<j&&j<k) w[i][j][k]=w[i][j][k-1]+w[i][j-1][k-1]-w[i][j-1][k]; else w[i][j][k]=w[i-1][j][k]+w[i-1][j-1][k]+w[i-1][j][k-1]-w[i-1][j-1][k-1]; } while(scanf("%d%d%d",&a,&b,&c)==3) { if(a==-1&&b==-1&&c==-1) break; else if(a<=0||b<=0||c<=0) res=1; else if(a>20||b>20||c>20) res=w[20][20][20]; else res=w[a][b][c]; printf("w(%d, %d, %d) = %d\n",a,b,c,res); } }