2021ccpc网络赛 G. Function

官方题解：

#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
using namespace std;
typedef long long ll;
vector<ll>a[60];
//ll s[60][5];
int main()
{

    ll w=0,x;
    for(int i=1; i<=1000002; i++)
    {
        x=i;
        w=0;
        while(x)
        {
            w+=x%10;
            x/=10;
        }
        a[w].push_back(i);
    }
    int T;
    ll  n,aa,bb,cc,dd;

    while(~scanf("%d", &T))
    {
        while (T--)
        {
            scanf("%lld%lld%lld%lld%lld", &aa,&bb,&cc,&dd,&n);
            ll ans=1000000000000000,p,q;
            for(int i=1; i<=54; i++)
            {
                //cout<<i<<" "<<ans<<endl;
                ll mmin=a[i][0];
                if(mmin>n)continue;

                p=aa*1ll*i+bb;///1e3*55+1e6
                q=cc*1ll*i*i+dd*1ll*i;///1e6*2500+1e6*55
                int pos;
                pos=upper_bound(a[i].begin(),a[i].end(),n)-a[i].begin();
                ll mmax;
                if(pos>0)mmax=a[i][pos-1];
                else mmax=a[i][pos];

                //cout<<mmax<<" "<<mmin<<endl;
                if(p!=0)
                {
                    double dcz=-0.5*q/p;
                    ll zhi=0;
                    //cout<<dcz<<" "<<endl;
                    if(dcz<=1.0*mmin)
                    {
                        if(p>0)zhi=(p*mmin+q)*mmin;
                        else zhi=(p*mmax+q)*mmax;
                        //cout<<dcz<<"  mmin  "<<endl;
                    }
                    else if(dcz>=mmax*1.0)
                    {
                        if(p<0)zhi=(p*mmin+q)*mmin;
                        else zhi=(p*mmax+q)*mmax;
                        //  cout<<dcz<<"  mmax  "<<endl;
                    }
                    else///对称轴在mmin~mmax之间
                    {
                        if(p>0)
                        {
                            ll zd=(int)dcz;
                            pos=upper_bound(a[i].begin(),a[i].end(),zd)-a[i].begin();
                            while(pos>=a[i].size())pos--;
                            zd=a[i][pos];
                            if(zd<=n)
                            {
                                zhi=(p*zd+q)*zd;
                                ans=min(ans,zhi);
                            }

                            if(pos>0)
                            {
                                pos--;
                                zd=a[i][pos];
                                if(zd<=n)
                                {
                                    zhi=(p*zd+q)*zd;
                                    ans=min(ans,zhi);
                                }
                            }

                            if(pos>0)
                            {
                                pos--;
                                zd=a[i][pos];
                                if(zd<=n)
                                {
                                    zhi=(p*zd+q)*zd;
                                    ans=min(ans,zhi);
                                }
                            }
                            //ans=min(ans,zhi);
                        }
                        else
                        {
                            zhi=(p*mmin+q)*mmin;
                            ans=min(ans,zhi);
                            zhi=(p*mmax+q)*mmax;
                            ans=min(ans,zhi);
                            //ans=min(ans,zhi);
                        }
                        // cout<<dcz<<"  mmin  mmax "<<endl;
                    }
                    ans=min(ans,zhi);
                }
                else///一次
                {
                    ll zhi=0;
                    if(q>=0)zhi=(p*mmin+q)*mmin;
                    else zhi=(p*mmax+q)*mmax;
                    ans=min(ans,zhi);
                }
            }

            cout<<ans<<endl;
        }
    }

    return 0;
}