题目链接:https://codeforces.com/gym/102878/problem/J
题解
这个题有两种做法,第二种做法比较好想,但是需要优化一下。
这里先说第一种做法(拉格朗日插值或者高斯消元)
首先题目给我们限定了
F
(
i
)
F(i)
F(i)的取值范围,对于每个
F
(
i
)
F(i)
F(i),至多有三种选择:
f
i
f_{i}
fi,
f
i
−
1
f_{i}-1
fi−1和
f
i
+
1
f_{i}+1
fi+1。
因此我们可以
3
5
3^{5}
35枚举出
F
F
F函数的值。
这样
F
F
F函数定了,那现在问题就转换成了知道经过
5
5
5个点的
4
4
4次多项式,求出这个多项式的系数。
这个问题可以用拉格朗日差值法或者高斯消元解决。
具体算法解析请参考OIWiki。
注意一下精度问题就行了,因为我们是用拉格朗日算法构造出来一个多项式去拟合我们给的条件,所以会有精度误差。
第二种做法(比赛时想到的)
我们直接枚举高次的系数,即枚举
a
4
,
a
3
,
a
2
a4,a3,a2
a4,a3,a2。
根据这三个系数我们可以消除一些误差比较大的数据(优化)。
我们知道
G
1
=
a
1
+
a
0
,
G
2
=
2
a
1
+
a
0
G_{1}=a_{1}+a_{0},G_{2}=2a_{1}+a_{0}
G1=a1+a0,G2=2a1+a0
令
g
i
=
a
4
∗
i
4
+
a
3
∗
i
3
+
a
2
∗
i
2
g_{i}=a_{4}*i^{4}+a_{3}*i^{3}+a_{2}*i^{2}
gi=a4∗i4+a3∗i3+a2∗i2。
因此已知
f
1
,
f
2
f1,f2
f1,f2时,
a
1
a_{1}
a1的取值至多有五种
[
(
f
2
−
g
2
)
−
(
f
1
−
g
1
)
−
2
,
(
f
2
−
g
2
)
−
(
f
1
−
g
1
)
+
2
]
[(f_{2}-g_{2})-(f_{1}-g_{1})-2,(f_{2}-g_{2})-(f_{1}-g_{1})+2]
[(f2−g2)−(f1−g1)−2,(f2−g2)−(f1−g1)+2]。
而当
a
1
a_{1}
a1确定时,
a
0
a_{0}
a0的取值至多有三种
[
(
f
1
−
g
1
)
−
1
,
(
f
1
−
g
1
)
+
1
]
[(f_{1}-g_{1})-1,(f_{1}-g_{1})+1]
[(f1−g1)−1,(f1−g1)+1]。
我们直接枚举判定即可。
代码实现
做法一(高斯消元)
#include <bits/stdc++.h>
#define PI atan(1.0)*4
#define rp(i,s,t) for (register int i = (s); i <= (t); i++)
#define RP(i,t,s) for (register int i = (t); i >= (s); i--)
#define sc(x) scanf("%d",&x)
#define scl(x) scanf("%lld",&x)
#define ll long long
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define lson rt<<1,l,m
#define rson rt<<1|1,m+1,r
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define m_p make_pair
#define p_b push_back
#define ins insert
#define era erase
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
#define dg if(debug)
#define pY puts("YES")
#define pN puts("NO")
#define outval(a) cout << "Debuging...|" << #a << ": " << a << "\n";
#define outval2(a,b) cout << "Debuging...|" << #a << ": " << a <<"\t"<< #b << ": " << b << "\n";
#define outval3(a,b,c) cout << "Debuging...|" << #a << ": " << a <<"\t"<< #b << ": " << b <<"\t"<< #c << ": " << c << "\n";
using namespace std;
int debug = 0;
ll gcd(ll a,ll b){
return b?gcd(b,a%b):a;
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
inline int read(){
int s=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
s=s*10+ch-'0';
ch=getchar();
}
return s*f;
}
const int maxn = 100;
const double eps = 1e-6;
ll f[10];
double a[10][10];
int n;
int gauss()
{
int c, r; // c 是列数、r 是行数
for(c = 0, r = 0; c < n; c++) //枚举每一列
{
int t = r;
for(int i=r; i<n; i++) // 找到第 c 列的值最大的是哪一行
if(fabs(a[i][c]) > fabs(a[t][c]))
t = i;
if(fabs(a[t][c]) < eps) continue; //当前这一列最大值都为 0,说明这一列所有系数都为0
for(int i=c; i<=n; i++) swap(a[t][i],a[r][i]); //把绝对值最大的这行(即第t行)换到当前最上面去(第r行)
for(int i=n; i>=c; i--) a[r][i] /= a[r][c]; //把第t行第一个数变成1(方程所有数同除第一个数即可)
//要先处理最后一个数,因为如果先处理第一个数,第一个数先变为1了,后面所有数就会都除1而不是第一个数
for(int i =r+1; i<n; i++) //枚举从 r+1 的每一行,把第 c 列的数全部消成 0
if(fabs(a[i][c]) > eps) //如果已经 ==0 ,就不用消了
for(int j=n; j>=c; j--) //枚举这一行的每个数
a[i][j] -= a[r][j] * a[i][c]; //每个数减去a[i][c] * a[r][j] 即可
r++; //该下一行了
}
if(r < n) //说明剩下的方程数小于 n 个,需要判断是 无解 还是 有多组解
{ //现在已经是阶梯型,所有系数都应该为0,如果等式右边a[i][n] != 0,说明无解
for(int i=r; i<n; i++)
if(fabs(a[i][n]) > eps)
return 2; //无解
return 1; //多组解,说明 r~n-1的这些方程是可以被 0~n 的某些方程表示出来的
}
//有唯一解,从下向上回代,依次求解
for(int i=n-1; i>=0; i--) //从下向上枚举每一行
for(int j=i+1; j<n; j++)
a[i][n] -= a[i][j] * a[j][n];
return 0;
}
vector<ll> v;
int ff=0;
void dfs(vector<ll> v,ll num,int cnt){
if(ff) return ;
if(cnt==5){
n=5;
for(int i=0;i<n;i++){
double base=1.0;
for(int j=0;j<n;j++){
a[i][j]=base;
base=base*(i+1.0);
}
}
for(int i=0;i<n;i++) a[i][n]=v[i];
gauss();
int flag=0;
rp(i,0,4){
if(a[i][n]>100||a[i][n]<-100){
flag=1;
break;
}
}
// outval(flag);
vector<ll> vv;
rp(i,0,4) vv.push_back((ll)(a[i][n]));
// for(auto val:vv) cout<<val<<" ";
// cout<<endl;
rp(i,1,5){
ll ans=vv[0]+1ll*vv[1]*i+1ll*vv[2]*i*i+1ll*vv[3]*i*i*i+1ll*vv[4]*i*i*i*i;
// outval3(i,ans,f[i]);
if(abs(ans-f[i])>1){
flag=1;
break;
}
}
if(!flag){
ff=1;
rp(i,0,4) cout<<vv[i]<<(i==4?'\n':' ');
return ;
}
// outval(flag);
// cout<<"**********"<<endl;
return ;
}
v.push_back(f[cnt+1]-1);
dfs(v,f[cnt+1]-1,cnt+1);
v.pop_back();
v.push_back(f[cnt+1]+1);
dfs(v,f[cnt+1]+1,cnt+1);
v.pop_back();
v.push_back(f[cnt+1]);
dfs(v,f[cnt+1],cnt+1);
v.pop_back();
}
void solve(){
ff=0;
rp(i,1,5) scl(f[i]);
v.push_back(f[1]-1);
dfs(v,f[1]-1,1);
v.pop_back();
v.push_back(f[1]+1);
dfs(v,f[1]+1,1);
v.pop_back();
v.push_back(f[1]);
dfs(v,f[1],1);
v.pop_back();
}
int main(){
//ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef ONLINE_JUDGE
#else
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
// debug = 1;
#endif
time_t beg, end;
if(debug) beg = clock();
int T=read();
while(T--) solve();
if(debug) {
end = clock();
printf("time:%.2fs\n", 1.0 * (end - beg) / CLOCKS_PER_SEC);
}
return 0;
}
做法一(拉格朗日差值)
对拍了好长时间也没找到 W A WA WA的点。
#include <bits/stdc++.h>
#define PI atan(1.0)*4
#define rp(i,s,t) for (register int i = (s); i <= (t); i++)
#define RP(i,t,s) for (register int i = (t); i >= (s); i--)
#define sc(x) scanf("%d",&x)
#define scl(x) scanf("%lld",&x)
#define ll long long
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define lson rt<<1,l,m
#define rson rt<<1|1,m+1,r
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define m_p make_pair
#define p_b push_back
#define ins insert
#define era erase
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
#define dg if(debug)
#define pY puts("YES")
#define pN puts("NO")
#define outval(a) cout << "Debuging...|" << #a << ": " << a << "\n";
#define outval2(a,b) cout << "Debuging...|" << #a << ": " << a <<"\t"<< #b << ": " << b << "\n";
#define outval3(a,b,c) cout << "Debuging...|" << #a << ": " << a <<"\t"<< #b << ": " << b <<"\t"<< #c << ": " << c << "\n";
using namespace std;
int debug = 0;
ll gcd(ll a,ll b){
return b?gcd(b,a%b):a;
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
inline int read(){
int s=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
s=s*10+ch-'0';
ch=getchar();
}
return s*f;
}
const int maxn = 100;
ll f[10];
ll mod = 1e9+7;
ll qm(ll a, ll b){
ll res = 1;
while(b) {
if(b&1)res = res*a%mod;
a = a*a%mod, b>>=1;
}
return res;
}
double a[maxn], b[maxn], c[maxn], temp[maxn];
double x[maxn], y[maxn];
void mul(double *f, int len, ll t){//len为多项式的次数+1,函数让多项式f变成f*(x+t)
for(int i = len; i > 0; --i) temp[i] = f[i], f[i] = f[i-1];
temp[0] = f[0], f[0] = 0;
for(int i = 0; i <= len; ++i) f[i] = (f[i] + t*temp[i]);
}
void dev(double *f, double *r, ll t){//f是被除多项式的系数,r保存f除以x+t的结果
for(int i = 0; i <= 5; ++i) temp[i] = f[i];
for(int i = 5; i > 0; --i){
r[i-1] = temp[i];
temp[i-1] = (temp[i-1] - t*temp[i]);
}
return;
}
void lglr(){
memset(a,0,sizeof a);
b[1] = 1, b[0] = -x[1];
for(int i = 2; i <= 5; ++i){
mul(b, i, -x[i]);
}
for(int i = 1; i <= 5; ++i){
double fz = 1;
for(int j = 1; j <= 5; ++j){
if(j == i) continue;
fz = fz*(x[i] - x[j]);
}
fz = y[i]/fz;//得到多项式系数
dev(b, c, -x[i]);//得到多项式,保存在b数组
for(int j = 0; j < 5; ++j) a[j] = (a[j] + fz*c[j]);
}
}
vector<ll> v;
int ff=0;
void dfs(vector<ll> v,ll num,int cnt){
if(ff) return ;
if(cnt==5){
memset(a,0,sizeof a);
memset(b,0,sizeof b);
memset(c,0,sizeof c);
memset(temp,0,sizeof temp);
rp(i,1,5) x[i]=i,y[i]=v[i-1];
lglr();
// rp(i,1,5) cout<<v[i-1]<<" ";
// cout<<endl;
// rp(i,1,5) cout<<a[i]<<" ";
// cout<<endl;
int flag=0;
rp(i,0,4){
if(a[i]<-100||a[i]>100){
flag=1;
break;
}
}
// outval(flag);
rp(i,0,4){
a[i]=(ll)(round((a[i]));
}
rp(i,1,5){
ll ans=a[0]+1ll*a[1]*i+1ll*a[2]*i*i+1ll*a[3]*i*i*i+1ll*a[4]*i*i*i*i;
// outval3(i,ans,f[i]);
if(abs(ans-f[i])>1){
flag=1;
break;
}
}
if(!flag){
ff=1;
rp(i,0,4) cout<<a[i]<<(i==4?'\n':' ');
return ;
}
// outval(flag);
// cout<<"**********"<<endl;
return ;
}
v.push_back(f[cnt+1]-1);
dfs(v,f[cnt+1]-1,cnt+1);
v.pop_back();
v.push_back(f[cnt+1]+1);
dfs(v,f[cnt+1]+1,cnt+1);
v.pop_back();
v.push_back(f[cnt+1]);
dfs(v,f[cnt+1],cnt+1);
v.pop_back();
}
void solve(){
ff=0;
rp(i,1,5) scl(f[i]);
v.push_back(f[1]-1);
dfs(v,f[1]-1,1);
v.pop_back();
v.push_back(f[1]+1);
dfs(v,f[1]+1,1);
v.pop_back();
v.push_back(f[1]);
dfs(v,f[1],1);
v.pop_back();
}
int main(){
//ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef ONLINE_JUDGE
#else
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
// debug = 1;
#endif
time_t beg, end;
if(debug) beg = clock();
int T=read();
while(T--) solve();
if(debug) {
end = clock();
printf("time:%.2fs\n", 1.0 * (end - beg) / CLOCKS_PER_SEC);
}
return 0;
}
做法二(枚举优化)
也没过,代码仅供参考。
#include <bits/stdc++.h>
#define PI atan(1.0)*4
#define rp(i,s,t) for ( ll i = (s); i <= (t); i++)
#define RP(i,t,s) for ( ll i = (t); i >= (s); i--)
#define sc(x) scanf("%d",&x)
#define scl(x) scanf("%lld",&x)
#define ll long long
#define ull unsigned long long
#define mst(a,b) memset(a,b,sizeof(a))
#define lson rt<<1,l,m
#define rson rt<<1|1,m+1,r
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pil pair<int,ll>
#define m_p make_pair
#define p_b push_back
#define ins insert
#define era erase
#define INF 0x3f3f3f3f
#define inf 0x3f3f3f3f3f3f3f3f
#define dg if(debug)
#define pY puts("YES")
#define pN puts("NO")
#define outval(a) cout << "Debuging...|" << #a << ": " << a << "\n";
#define outval2(a,b) cout << "Debuging...|" << #a << ": " << a <<"\t"<< #b << ": " << b << "\n";
#define outval3(a,b,c) cout << "Debuging...|" << #a << ": " << a <<"\t"<< #b << ": " << b <<"\t"<< #c << ": " << c << "\n";
using namespace std;
int debug = 0;
ll gcd(ll a,ll b){
return b?gcd(b,a%b):a;
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
inline int read(){
int s=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9'){
s=s*10+ch-'0';
ch=getchar();
}
return s*f;
}
ll f[10],b[10];
ll a0,a1;
int check(ll a4,ll a3,ll a2){
ll num1=a2+a3+a4;
ll num2=1ll*a2*2*2+1ll*a3*2*2*2+1ll*a4*2*2*2*2;
ll ans1=f[1]-num1;
ll ans2=f[2]-num2;
for(a1=ans2-ans1-2;a1<=ans2-ans1+2;a1++){
a0=ans1-a1;
int flag=0;
rp(i,1,5){
ll ans=a0+1ll*a1*i+1ll*a2*i*i+1ll*a3*i*i*i+1ll*a4*i*i*i*i;
if(abs(f[i]-ans)>1){
flag=1;
break;
}
}
if(!flag) return 1;
a0=ans1-a1-1;
flag=0;
rp(i,1,5){
ll ans=a0+1ll*a1*i+1ll*a2*i*i+1ll*a3*i*i*i+1ll*a4*i*i*i*i;
if(abs(f[i]-ans)>1){
flag=1;
break;
}
}
if(!flag) return 1;
a0=ans1-a1+1;
flag=0;
rp(i,1,5){
ll ans=a0+1ll*a1*i+1ll*a2*i*i+1ll*a3*i*i*i+1ll*a4*i*i*i*i;
if(abs(f[i]-ans)>1){
flag=1;
break;
}
}
if(!flag) return 1;
}
return 0;
}
void solve(){
rp(i,1,5) scl(f[i]);
// outval(check(0,0,1));
rp(a4,-100,100){
rp(a3,-100,100){
rp(a2,-100,100){
int flag=0;
rp(i,1,5){
ll num=1ll*a2*i*i+1ll*a3*i*i*i+1ll*a4*i*i*i*i;
if(abs(num-f[i])>1ll*100*(i+1)){
flag=1;
break;
}
}
if(flag) continue;
if(check(a4,a3,a2)){
cout<<a0<<" "<<a1<<" "<<a2<<" "<<a3<<" "<<a4<<endl;
return ;
}
}
}
}
}
int main(){
//ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifdef ONLINE_JUDGE
#else
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
// debug = 1;
#endif
time_t beg, end;
if(debug) beg = clock();
int T;sc(T);
while(T--) solve();
if(debug) {
end = clock();
printf("time:%.2fs\n", 1.0 * (end - beg) / CLOCKS_PER_SEC);
}
return 0;
}