CodeForces 454D Little Pony and Harmony Chest （状压DP+估界）

#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define fi first                                  
#define se second
#define mk(x,y) make_pair(x,y)
const int mod=1e9+7;
const int maxn=60;///主要难点是估界，每个数不会超过60因为如果超过60则可以替换成1
const int maxm=17;
const ll INF=1e18;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
    if(y==0) return x;
    return gcd(y,x%y);
}
int prim[maxm]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59},a[105];
int mp[maxn],dp[105][1<<maxm],nxt[105][1<<maxm];
int val(int x){return x>0?x:-x;}

void output(int n,int y,int z){///y为下一个状态值，z为现在的状态值
    if(!n) return ;
    output(n-1,nxt[n-1][y],y);
    int x=dp[n][z]-dp[n-1][y];
    if(mp[a[n]-x]==(y^z)) cout<<a[n]-x<<" ";///可能会越界
    else cout<<a[n]+x<<" ";
}
int n,mark;
int main(){
    ios::sync_with_stdio(false);/*
    freopen("d://in.txt","r",stdin);
    freopen("d://out.txt","w",stdout);*/
    cin>>n;rep(i,1,n+1) cin>>a[i];

    rep(i,0,maxm) mp[prim[i]]=(1<<i);
    rep(i,2,maxn) if(!mp[i]){
        int tmp=i;
        rep(j,2,i) if(tmp%j==0){
            while(tmp%j==0) tmp/=j;
            mp[i]+=mp[j];
        }
    }

    mst(dp,0xf),mark=dp[0][0],dp[0][0]=0;
    rep(i,1,n+1) rep(j,1,maxn) rep(k,0,1<<maxm){
        if((k&mp[j])==mp[j]) if(dp[i-1][k^mp[j]]!=mark){
            int tmp=dp[i-1][k^mp[j]]+val(j-a[i]);///代价函数和对应的背包状态都很好找
            if(dp[i][k]>tmp) dp[i][k]=tmp,nxt[i][k]=(k^mp[j]);
        }
    }

    int minv=mark,sta,cur;
    rep(i,0,1<<maxm) if(dp[n][i]<minv)
        minv=dp[n][i],cur=i,sta=nxt[n][i];
    output(n,sta,cur);
    return 0;
}