历届试题 蓝桥杯

#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
ll sum=0;
void dfs(ll last,ll fa,ll a,ll b,int n){
if(n==0){sum++;sum%=100000007;return;}
ll x[2];
x[0]=fa+a;
x[1]=fa-b;
for(int i=0;i<=1;i++){
    ll p=n*x[i]+n*(n-1)/2*a;
    ll q=n*x[i]-n*(n-1)/2*b;
    if(p>=last&&q<=last){
        dfs(last-x[i],x[i],a,b,n-1);
    }
}
}
int main(){
ll n,s,a,b;
cin>>n>>s>>a>>b;
ll min1=(double)s/n-(double)a*(n-1)/2;
ll max1=(double)s/n+(double)b*(n-1)/2;
for(ll i=min1;i<=max1;i++){
    dfs(s-i,i,a,b,n-1);
}
cout<<sum<<endl;
return 0;}

类动态规划也炸了

#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long ll;
ll s;
struct Node{
int i;
ll j;
int num;
priority_queue<ll,vector<ll>,greater<ll> >tail;
Node*next1;
Node(int I=0,ll J=-1):i(I),j(J),num(1),next1(NULL){};
}*root;
Node*addNode(Node*fa,int cnt,ll sum,ll t){
Node*p=new Node(cnt,sum);
fa->next1=p;
p->tail.push(t);
return p;
}
void insert1(Node*root,int cnt,ll sum,ll t){
Node*p=root;
while(p->next1&&p->next1->j<=sum)p=p->next1;
if(p->j==sum){p->tail.push(t);p->num++;p->num%=100000007;}
else if(p->next1==NULL)addNode(p,cnt,sum,t);
else {
    Node*pp=new Node(cnt,sum);
    pp->tail.push(t);
    pp->next1=p->next1;
    p->next1=pp;
}
}
ll ma(ll n,ll s,ll a,ll b){
return (double)s/n+(double)b*(n-1)/2;
}
ll mi(ll n,ll s,ll a,ll b){
return (double)s/n-(double)a*(n-1)/2;
}
int main(){
ll n,a,b;
cin>>n>>s>>a>>b;
ll min1=(double)s/n-(double)a*(n-1)/2;
ll max1=(double)s/n+(double)b*(n-1)/2;
root=new Node();
Node*p=root;
for(ll i=min1;i<=max1;i++)p=addNode(p,1,i,i);
for(int i=2;i<=n;i++){
      p=root->next1;
      root=new Node();
      while(p){
        while(!p->tail.empty()){
        ll x=p->tail.top();
        p->tail.pop();
        if(mi(n-i+1,s-p->j,a,b)<=x+a&&x+a<=ma(n-i+1,s-p->j,a,b))insert1(root,i,p->j+x+a,x+a);
        if(mi(n-i+1,s-p->j,a,b)<=x-b&&x-b<=ma(n-i+1,s-p->j,a,b))insert1(root,i,p->j+x-b,x-b);
        }
        p=p->next1;
      }
}
Node*z=root;
//while(z){cout<<z->j<<' '<<z->num<<endl;z=z->next1;}
while(z->next1&&z->j<s)z=z->next1;
//cout<<z->j<<endl;
if(z->j==s)cout<<z->num<<endl;
else cout<<0<<endl;
return 0;}