题目
hdu7106 Function
Let’s define the sum of all digits in x as g(x). For example, g(123)=1+2+3=6.
Give you a function: f(x)=(Ax ^2)g(x) + (Bx ^2) + Cx(g(x) ^2) + Dxg(x)
Find the minimum value of f(x), where x is an integer and 1≤x≤N.
five integers A,B,C,D,N(0≤|A|≤10 ^3,0≤|B|,|C|,|D|≤10 ^6,1≤N≤10 ^6)
样例:
2
1 2 3 4 100
4 3 2 1 100
输出:
10
10
做法
考虑到gx的值非常的小只有1-54,所以我们预处理gx,再枚举gx然后f(x)便转化为一元二次方程,题目变为求解一元二次方程的最小值,注意x^2的系数为0情况。据说还能判前5000和后5000再加999和000结尾的数,不知道为什么这样也能过。
代码
#include<bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
#define int ll
#define pii pair<int,int>
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define rrep(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const double pi=acos(-1.0);
const double eps=1e-8;
const int mod=1e9+7;
const int INF=0x3f3f3f3f;
const int LINF=0x3f3f3f3f3f3f3f3f;
const int MAXN=1e5+10;
int a,b,c,d,n;
vector<int>v[105];
int g(int x)
{
int ans=0;
while(x)
{
ans+=x%10;
x/=10;
}
return ans;
}
void init()
{
for(int i=1; i<=1000000; ++i)
{
v[g(i)].push_back(i);
}
}
int f(int x,int gx)
{
return a*x*x*gx+b*x*x+c*x*gx*gx+d*x*gx;
}
void solve()
{
int ans=LINF;
cin>>a>>b>>c>>d>>n;
for(int i=1; i<=54; ++i)
{
int idx=upper_bound(v[i].begin(),v[i].end(),n)-v[i].begin();
if(idx!=0)
{
idx--;
ans=min(ans,f(v[i][idx],i));
}
if(v[i][0]<=n)
{
ans=min(ans,f(v[i][0],i));
}
if((a*i+b)!=0)
{
int dui=(-(c*i*i+d*i))/(2*(a*i+b));
int pos=upper_bound(v[i].begin(),v[i].end(),dui)-v[i].begin();
if(pos==0)
{
if(v[i][pos]<=n)
{
ans=min(ans,f(v[i][pos],i));
}
}
else if(pos==v[i].size())
{
if(v[i][pos-1]<=n)
{
ans=min(ans,f(v[i][pos-1],i));
}
}
else
{
if(v[i][pos-1]<=n)
{
ans=min(ans,f(v[i][pos-1],i));
}
if(v[i][pos]<=n)
{
ans=min(ans,f(v[i][pos],i));
}
}
}
}
cout<<ans<<"\n";
}
signed main()
{
std::ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
init();
int _=1;
cin>>_;
for(int i=1; i<=_; ++i)
{
solve();
}
return 0;
}