洛谷P1464 Function ，输出全-1 ，5个点全RE

Question

#include<bits/stdc++.h>
using namespace std;
long long a,b,c,remember[23][23][23];
bool vis[23][23][23];
long long fun(long long a,long long b,long long c){
    if(a<=0||b<=0||c<=0) return 1;
    else if(vis[a][b][c]) return remember[a][b][c];
    vis[a][b][c]=true;
    if(a>20||b>20||c>20) return remember[20][20][20]=fun(20,20,20);
    if(a<b&&b<c) 
        if(remember[a][b][c]==-1) return remember[a][b][c]=fun(a,b,c-1)+fun(a,b-1,c-1)-fun(a,b-1,c);
    else {
        if(remember[a][b][c]==-1)
              remember[a][b][c]=fun(a-1,b,c)+fun(a-1,b-1,c)+fun(a-1,b,c-1)-fun(a-1,b-1,c-1);
    }
     return remember[a][b][c];
}
int main(){
    while(1){
        cin>>a>>b>>c;
        if(a==-1&&b==-1&&c==-1) break;
        memset(remember,-1,sizeof(remember));
        printf("w(%lld, %lld, %lld) = %lld\n",a,b,c,fun(a,b,c));
    }
    return 0;
}

```

Answer 1

#include<bits/stdc++.h> // 全库
typedef long long ll;
ll A[25][25][25];

ll w(ll a,ll b,ll c)
{
    if(a<=0||b<=0||c<=0)return 1;
    if(a>20||b>20||c>20)
    {
        A[20][20][20] = w(20,20,20);
        return A[20][20][20];
    }
    if(A[a][b][c]==0)
    {
        if(a<b&&b<c)
        {
            A[a][b][c]=w(a,b,c-1)+w(a,b-1,c-1)-w(a,b-1,c);
            return A[a][b][c];
        }
        else
        {
            A[a][b][c]=w(a-1,b,c)+w(a-1,b-1,c)+w(a-1,b,c-1)-w(a-1,b-1,c-1);
            return A[a][b][c];
        }
    }
    else return A[a][b][c];
}

int main()
{

    ll a,b,c;
    while(scanf("%lld%lld%lld",&a,&b,&c)==3)
    {
        if(a==-1&&b==-1&&c==-1)break;
        printf("w(%lld, %lld, %lld) = %lld\n",a,b,c,w(a,b,c));
    }
    return 0;
}