zcmimi's blog
查看原题

点击跳转

f[k][i][j]表示前k种面值,Ai元,Bj元最少交换几张

#include<bits/stdc++.h>
namespace ZDY{
    #pragma GCC optimize(3)
    #define il __inline__ __attribute__ ((always_inline))
    #define register
    #define ll long long
    #define ull unsigned long long
    #define db double
    #define sht short
    #define MB template <class T>il
    #define Fur(i,x,y) for(int i(x);i<=y;++i)
    #define Fdr(i,x,y) for(int i(x);i>=y;--i)
    #define fl(i,x) for(int i(head[x]),to;to=e[i].to,i;i=e[i].nxt)
    #define clr(x,y) memset(x,y,sizeof(x))
    #define cpy(x,y) memcpy(x,y,sizeof(x))
    #define fin(s) freopen(s".in","r",stdin)
    #define fout(s) freopen(s".out","w",stdout)
    #define fcin ios::sync_with_stdio(false)
    #define l2(n) ((int)(log2(n)))
    #define inf 2122219134
    MB T ABS(T x){return x>0?x:-x;}
    MB T MAX(T x,T y){return x>y?x:y;}
    MB T MIN(T x,T y){return x<y?x:y;}
    MB T GCD(T x,T y){return y?GCD(y,x%y):x;}
    MB void SWAP(T &x,T &y){T t=x;x=y;y=t;}
}using namespace ZDY;using namespace std;
namespace IO{const int str=1<<20;static char in_buf[str],*in_s,*in_t;bool __=0;il char gc(){return (in_s==in_t)&&(in_t=(in_s=in_buf)+fread(in_buf,1,str,stdin)),in_s==in_t?__=1,EOF:*in_s++;}il void in(string &ch){ch.clear();if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF){__=1;return;}ch+=c;while((c=gc())!=EOF&&!isspace(c))ch+=c;if(c==EOF)__=1;}il void in(char &ch){if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF)__=1;else ch=c;}il void in(char *ch){*ch='\0';if(__)return;char c;while((c=gc())!=EOF&&isspace(c));if(c==EOF){__=1;return;}*ch=c;ch++;while((c=gc())!=EOF&&!isspace(c))*ch=c,ch++;if(c==EOF)__=1;*ch='\0';}template<typename T>il void in(T &x){if(__)return;char c=gc();bool f=0;while(c!=EOF&&(c<'0'||c>'9'))f^=(c=='-'),c=gc();if(c==EOF){__=1;return;}x=0;while(c!=EOF&&'0'<=c&&c<='9')x=x*10+c-48,c=gc();if(c==EOF)__=1;if(f)x=-x;}template<typename T,typename ... arr>il void in(T &x,arr & ... y){in(x),in(y...);}const char ln='\n';static char out_buf[str],*out_s=out_buf,*out_t=out_buf+str;il void flush(){fwrite(out_buf,1,out_s-out_buf,stdout);out_s=out_buf;}il void pt(char c){(out_s==out_t)?(fwrite(out_s=out_buf,1,str,stdout),*out_s++=c):(*out_s++=c);}il void out(const char* s){while(*s)pt(*s++);}il void out(char* s){while(*s)pt(*s++);}il void out(char c){pt(c);}il void out(string s){for(int i=0;s[i];i++)pt(s[i]);}template<typename T>il void out(T x){if(!x){pt('0');return;}if(x<0)pt('-'),x=-x;char a[50],t=0;while(x)a[t++]=x%10,x/= 10;while(t--)pt(a[t]+'0');}template<typename T,typename ... arr>il void out(T x,arr & ... y){out(x),out(y...);}}using namespace IO;
const int N=1011;
int A,B,C,val[7]={0,100,50,20,10,5,1},a[4][7],s[4],cnt[7],f[7][N][N],tot=0;
int main(){
    in(A,B,C);
    Fur(i,1,3)Fur(j,1,6){
        in(a[i][j]);
        s[i]+=a[i][j]*val[j];
        tot+=a[i][j]*val[j];
        cnt[j]+=a[i][j];
    }

    clr(f,126);
    f[0][s[1]][s[2]]=0;
    int ans=inf;
    Fur(i,1,6)
        Fur(j,0,tot)
            Fur(k,0,tot-j)
            if(f[i-1][j][k]!=inf)
                Fur(x1,0,cnt[i])
                    Fur(x2,0,cnt[i]-x1){
                        int na=j-(a[1][i]-x1)*val[i],
                            nb=k-(a[2][i]-x2)*val[i],
                            x3=cnt[i]-x1-x2;
                        if(na>=0&&nb>=0&&na+nb<=tot){
                            int w=ABS(a[1][i]-x1)+ABS(a[2][i]-x2)+ABS(a[3][i]-x3);
                            f[i][na][nb]=MIN(f[i][na][nb],f[i-1][j][k]+(w>>1));
                        }
                    }
    int s1=s[1]-A+C,s2=s[2]-B+A,s3=s[3]-C+B;
    if(s1<0||s2<0||s3<0)printf("impossible\n");
    else{
        Fur(i,0,6)ans=f[i][s1][s2];
        if(ans==inf)printf("impossible\n");
        else printf("%d\n",ans);
    }
}
LG 4026 [SHOI2008]循环的债务
comment评论
Search
search