CCF 模拟D 动态规划

http://115.28.138.223:81/view.page?opid=4

这道题写的我醉醉的，想建一棵指定深度的树最后统计满足条件的个数

居然没去考虑这样必然超时！！！代码写的也是醉了，把没完成的代码先贴出来，好好嘲讽下自己

(╬▔皿▔)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int floorer,num,lable;//0 none ; 1 1 ; 3 3 ; 4 1&3
bool shine1,shine0,shine3,shit,shit0;
int x[]={,,,};
int y[]={,,,};
int donser1=,donser2=,donser3=,donser4=,donser5=;
bool dong1=false,dong2=false,dong3=false,dong4=false,dong5=false;
void creatree(int lab,int flooor)
{

    cout<<"-------->floor:"<<flooor<<"(12)"<<endl;
    if((flooor==floorer+)&&shine0&&shine1&&shine3){cout<<"*********************************************";num++;}
    if(flooor==floorer+){cout<<endl<<"&return "<<endl<<endl;return;}
    if(shit&&shit0)
    {
        for(int i=;i<;i++)
        {
            cout<<"lab -1 : "<<y[i]<<"(19)"<<endl;
            if(y[i]==){dong1=shine0;shine0=;donser1=;}
            if(y[i]==){dong1=shine1;shine1=;lab=;donser1=;}
            if(y[i]==){dong1=shine3;shine3=;lab=;donser1=;}
            if(flooor==floorer+){cout<<"++++"<<"(23)"<<endl;return;}
            int ii=flooor;
            creatree(lab,++ii);
            if(donser1==){shine0=dong1;donser1=;}
            if(donser1==){shine1=dong1;donser1=;}
            if(donser1==){shine3=dong1;donser1=;}
        }
    }
    if(lab==)
    {
        for(int i=;i<;i++)
        {
            cout<<"lab 0 : "<<x[i]<<"(31)"<<endl;
            if(y[i]==){dong2=shine0;shine0=;donser2=;}
            if(y[i]==){dong2=shine1;shine1=;lab=;donser2=;}
            if(y[i]==){dong2=shine3;shine3=;lab=;donser2=;}
            if(flooor==floorer+){cout<<"????"<<"(35)"<<endl;return;}
            int ii=flooor;
            creatree(lab,++ii);
            if(donser2==){shine0=dong2;donser2=;}
            if(donser2==){shine1=dong2;donser2=;}
            if(donser2==){shine3=dong2;donser2=;}
        }
    }
    if(lab==)
    {
        for(int i=;i<;i++)
        {
            cout<<"lab 1 : "<<x[i]<<"(43)"<<endl;
            if(x[i]==){dong3=shine3;shine3=;lab=;shit=false;donser3=;}
            if(flooor==floorer+){cout<<"...."<<"(45)"<<endl;return;}
            int ii=flooor;
            creatree(lab,++ii);
            if(donser3==){shine3=dong3;donser3=;}
        }
    }
    if(lab==)
    {
        for(int i=;i<;i++)
        {
            cout<<"lab 3 : "<<y[i]<<"(43)"<<endl;
            if(!y[i]==&&!shine1){shit=true;}
            if(y[i]==) {shit=false;dong4=shine1;shine1=;lab=;donser4=;}
            if(flooor==floorer+){cout<<"````"<<"(56)"<<endl;return;}
            int ii=flooor;
            creatree(lab,++ii);
            if(donser4==){shine1=dong4;donser4=;}
        }
    }
    if(lab==)
    {
        for(int i=;i<;i++)
        {
            cout<<"lab 4 : "<<y[i]<<"(64)"<<endl;
            if(flooor==floorer+){cout<<"----"<<"(65)"<<endl;return;}
            int ii=flooor;
            creatree(lab,++ii);
        }
    }
}
int main()
{
    int n,flooor;
    while(cin>>n)
    {
        floorer=n;
        shine1=shine0=shine3=shit=shit0=false;
        num=lable=;
        flooor=;
        creatree(,flooor);
        cout<<num<<endl;
        cout<<endl<<endl;
        cout<<"+++++++++++++++++++++++++++++++++++++++++++++++++++++++";
        shine1=shine0=shine3=shit=false;
        shit0=true;
        creatree(,flooor);
        cout<<num<<endl;
        cout<<endl<<endl;
        cout<<"+++++++++++++++++++++++++++++++++++++++++++++++++++++++";
        shine1=shine0=shine3=shit=false;
        shit0=true;
        creatree(,flooor);
        cout<<num<<endl;
    }
    return ;
}

#include<iostream>
using namespace std;
int main()
{
    long long mod=;
    long long n;
    cin>>n;
    long long**donser=new long long*[n+];
    for(long long i=; i<n+; i++)
        donser[i]=new long long[];
    for(long long i=; i<; i++)
        donser[][i]=;
    /*6种状态
    *0－－剩013
    *1－－剩13
    *2－－剩01
    *3－－剩3
    *4－－剩1
    *5－－无
    */
    for(long long i=; i<=n; i++)
    {
        long long j=i-;
        donser[i][]=;
        donser[i][]=(donser[j][]+donser[j][]*)%mod;
        donser[i][]=(donser[j][]+donser[j][])%mod;
        donser[i][]=(donser[j][]+donser[j][]*)%mod;
        donser[i][]=(donser[j][]+donser[j][]+donser[j][]*)%mod;
        donser[i][]=(donser[j][]+donser[j][]+donser[j][]*)%mod;
    }
    cout<<donser[n][]<<endl;
    return ;
}