(UVa) 624 – CD


/*
User ID: turing_13
Problem Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=565
*/

#include <bits/stdc++.h>

#define pii pair <int,int>
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define oo 1<<29
#define dd double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define MAX 10000
#define SZ(a) (int)a.size()
#define getint(a) scanf("%d",&a)
#define loop(i,n) for(int i=0;i<n;i++)
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define inf 1000000
#define rtintlim 46340
#define llim 9223372036854775808
#define rtllim 3037000499
#define ull unsigned long long
#define I int

using namespace std;

int Set(int n,int pos)  { return n = n | 1<<pos;}
bool check(int n,int pos) { return n & 1<<pos;}
int Reset(int n, int pos) { return n=n & ~(1<<pos);}

int main()
{
    ///freopen("in.txt","r",stdin);
    ///freopen("out.txt","w",stdout);
    int n,song[100],dp[25][MAX],bitmask[25][MAX];
    while(cin>>n)
    {
        int m;
        cin>>m;
        for(int i=1; i<=m; i++)
            cin>>song[i];
        for(int i=0; i<=m; i++)
            dp[i][0]=bitmask[i][0]=0;
        for(int i=0; i<=n; i++)
            dp[0][i]=bitmask[0][i]=0;
        for(int i=1; i<=m; i++)
            for(int j=1; j<=n; j++)
            {
                if(song[i]>j)
                {
                    dp[i][j]=dp[i-1][j];
                    bitmask[i][j]=bitmask[i-1][j];
                }
                else
                {
                    if(dp[i-1][j]>dp[i-1][j-song[i]]+song[i])
                        dp[i][j]=dp[i-1][j],bitmask[i][j]=bitmask[i-1][j];
                    else
                    {
                        dp[i][j]=dp[i-1][j-song[i]]+song[i];
                        bitmask[i][j]=Set(bitmask[i-1][j-song[i]],i);
                    }
                }
            }
            for(int i=1;i<=m;i++)
                if(check(bitmask[m][n],i))
                    cout<<song[i]<<" ";
            cout<<"sum:"<<dp[m][n]<<endl;
    }
    return 0;
}

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s