全TLE,求调

P1464 Function

aszxqw @ 2024-10-16 13:28:07

#include<bits/stdc++.h> 
#define ll long long
using namespace std;
ll s[50][50][50];
ll w(ll a,ll b,ll c){
    if(a<=0||b<=0||c<=0){
        return 1;
    }else if(a>20||b>20||c>20){
        s[a][b][c]=w(20,20,20);
    }else if(a<b&&b<c){
        s[a][b][c]=w(a,b,c-1)+w(a,b-1,c-1)-w(a,b-1,c);
    }else{
        s[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 s[a][b][c];
}
int main(){ 
    ll a1,b1,c1;
    while(1){
        cin>>a1>>b1>>c1;
        if(a1==-1&&b1==-1&&c1==-1){
            break;
        }else{
            cout<<"w(1, 1, 1) = "<<w(a1,b1,c1)<<endl;
        }
    }
    return 0;
}

by yjy288hmmNYY @ 2024-10-16 13:51:57

@aszxqw 燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍燊鼙齍

by aszxqw @ 2024-10-16 13:54:43

@yjy288hmmNYY ?

by yjy288hmmNYY @ 2024-10-16 13:55:42

@aszxqw 19-26行是无限死循环

by cheyichen @ 2024-10-16 13:56:25

ด้้้้้็้้้็็็็็้้้้้็็็็็้้้้้้็็็็็้้้้้็็็็็้้้้้้็็็็็้้้้้็็็็็้้้้้้็็็็็้้้้้็็็็็้้้้้้็็ด้้้้้็้้้็็็็็้้้้้็็็็็้้้้้้็็็็็้้้้้็็็็็้้้้้้็็็็็้้้้้็็็็็้้้้้้็็็็็้้้้้็็็็็้้้้้้็็ด้้้้้็้้้็็็็็้้้้้็็็็็้้้้้้็็็็็้้้้้็็็็็้้้้้้็็็็็้้้้้็็็็็้้้้้้็็็็็้้้้้็็็็็้้้้้้็็

by aszxqw @ 2024-10-16 13:59:43

@yjy288hmmNYY

    while(1){
        cin>>a1>>b1>>c1;
        if(a1==-1&&b1==-1&&c1==-1){
            break;
        }else{
            cout<<"w("<<a1<<", "<<b1<<", "<<c1<<") = "<<w(a1,b1,c1)<<endl;
        }
    }

有特判

by xhq_5206 @ 2024-10-16 14:06:56

@aszxqw 在函数里如果s[a][b][c]有值，你的代码不会直接用，还要通过w函数递归计算值，所以就TLE了

by xhq_5206 @ 2024-10-16 14:08:00


#include <iostream>
using namespace std;
long long A[25][25][25];
long long w(long long a, long long b, long long c)
{
    if (a <= 0 || b <= 0 || c <= 0)
    {
        return 1;
    }
    else if (a > 20 || b > 20 || c > 20)
    {
        return w(20, 20, 20);
    }
    else if (A[a][b][c])
    {
        return A[a][b][c];
    }
    else 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);
    }
    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];
}

int main()
{
    long long x, y, z;
    while (cin >> x >> y >> z)
    {
        if (x == -1 && y == -1 && z == -1)
        {
            break;
        }
        printf("w(%lld, %lld, %lld) = %lld\n", x, y, z, w(x, y, z));
    }
    return 0;
}```

by aszxqw @ 2024-10-16 14:08:25

@xhq_5206 AC了,以关

by xhq_5206 @ 2024-10-16 14:09:23

@aszxqw

by xhq_5206 @ 2024-10-16 14:10:43

@aszxqw

else if (A[a][b][c])
{
  return A[a][b][c];
}

加了这个

| 下一页