• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            posts - 12,  comments - 16,  trackbacks - 0
              
            Shopping Offers
            IOI'95

            In a certain shop, each kind of product has an integer price. For example, the price of a flower is 2 zorkmids (z) and the price of a vase is 5z. In order to attract more customers, the shop introduces some special offers.

            A special offer consists of one or more product items together for a reduced price, also an integer. Examples:

            • three flowers for 5z instead of 6z, or
            • two vases together with one flower for 10z instead of 12z.

            Write a program that calculates the price a customer has to pay for a purchase, making optimal use of the special offers to make the price as low as possible. You are not allowed to add items, even if that would lower the price.

            For the prices and offers given above, the (lowest) price for three flowers and two vases is 14z: two vases and one flower for the reduced price of 10z and two flowers for the regular price of 4z.

            PROGRAM NAME: shopping

            INPUT FORMAT

            The input file has a set of offers followed by a purchase.
            Line 1: s, the number of special offers, (0 <= s <= 99).
            Line 2..s+1: Each line describes an offer using several integers. The first integer is n (1 <= n <= 5), the number of products that are offered. The subsequent n pairs of integers c and k indicate that k items (1 <= k <= 5) with product code c (1 <= c <= 999) are part of the offer. The last number p on the line stands for the reduced price (1 <= p <= 9999). The reduced price of an offer is less than the sum of the regular prices.
            Line s+2: The first line contains the number b (0 <= b <= 5) of different kinds of products to be purchased.
            Line s+3..s+b+2: Each of the subsequent b lines contains three values: c, k, and p. The value c is the (unique) product code (1 <= c <= 999). The value k indicates how many items of this product are to be purchased (1 <= k <= 5). The value p is the regular price per item (1 <= p <= 999). At most 5*5=25 items can be in the basket.

            SAMPLE INPUT (file shopping.in)

            2
            1 7 3 5
            2 7 1 8 2 10
            2
            7 3 2
            8 2 5
            

            OUTPUT FORMAT

            A single line with one integer: the lowest possible price to be paid for the purchases.

            SAMPLE OUTPUT (file shopping.out)

            14

            解答:
            0 <= b <= 5,1 <= k <= 5,可用5*5*5*5*5的DP 每種買0~5個(gè),可以用6進(jìn)制表示,然后5維DP~OK!

            狀態(tài)設(shè)置:F[a1][a2][a3][a4][a5]為買a1件物品1,a2件物品2,a3件物品3,a4件物品4,a5件物品5時(shí),所需的最少價(jià)格

            邊界條件:F[0][0][0][0][0]=0;

            狀態(tài)轉(zhuǎn)移方程:
            F[a1][a2][a3][a4][a5]=min{F[ a1-P[i][1] ][ a2-P[i][2] ][ a3-P[i][3] ][ a4-P[i][4] ][ a5-P[i][5] ]+P[i][0]}
            其中i=1..s+b; 且 ak-p[i][k]>=0

            /*
            ID: kuramaw1
            PROG: shopping
            LANG: C++
            */

            #include 
            <fstream>
            #include 
            <cstring>


            using std::ifstream;
            using std::ofstream;
            using std::endl;

            #define  MAX_T(a,b) ((a)>(b)?(a):(b))

            #define  MAX 5
            #define  MAX_S 100

            int f[MAX+1][MAX+1][MAX+1][MAX+1][MAX+1];//min price

            short s,b;
            short s_p[MAX_S],component[MAX_S][MAX],p_num[MAX],p[MAX],p_t(0),order[MAX];

            inline 
            short product_code_to_order(short code)
            {
                
            for(int i=0;i<p_t;i++)
                 
            if(p_num[i]==code)
                     
            return i;
                p_num[p_t
            ++]=code;
                
            return (p_t-1);

            }

            int main()
            {
                ifstream 
            in("shopping.in");
                
            in>>s;
                memset(component,
            0,sizeof(component));
                
            for(int i=0;i<s;i++)
                {
                    
            short n;
                    
            in>>n;
                    
            for(int j=0;j<n;j++)
                    {
                        
            short c,k;
                        
            in>>c>>k;
                        component[i][product_code_to_order(c)]
            =k;
                    }
                    
            in>>s_p[i];
                        
                }

                memset(order,
            0,sizeof(order));
                memset(p,
            0,sizeof(p));
                
            in>>b;
                
            for(int i=0;i<b;i++)
                {
                    
            short c,k,p1;
                    
            in>>c>>k>>p1;
                    
            short n=product_code_to_order(c);
                    order[n]
            =k;
                    p[n]
            =p1;
                }
                
            in.close();

                
            //do dp
                short ii[MAX];
            #define loop(i)  for(ii[i]=0;ii[i]<=order[i];ii[i]++)
            #define  F(a) f[a[0]][a[1]][a[2]][a[3]][a[4]]
                
                loop(
            0) loop(1) loop(2) loop(3) loop(4)
                {

                    F(ii)
            =ii[0]*p[0]+ii[1]*p[1]+ii[2]*p[2]+ii[3]*p[3]+ii[4]*p[4];
                    
            for(short j=0;j<s;j++)
                    {
                        
            short t[MAX];
                        
            for(short k=0;k<5;k++)
                            t[k]
            =MAX_T(0,ii[k]-component[j][k]);
                        
            if(F(t)+s_p[j]<F(ii))
                            F(ii)
            =F(t)+s_p[j];

                    }
                }

                
            //out
                ofstream out("shopping.out");
                
            out<<F(order)<<endl;
                
            out.close();


            }


            posted on 2009-08-13 11:46 kuramawzw 閱讀(501) 評(píng)論(0)  編輯 收藏 引用 所屬分類: USACO

            只有注冊(cè)用戶登錄后才能發(fā)表評(píng)論。
            網(wǎng)站導(dǎo)航: 博客園   IT新聞   BlogJava   博問(wèn)   Chat2DB   管理


            <2025年7月>
            293012345
            6789101112
            13141516171819
            20212223242526
            272829303112
            3456789

            常用鏈接

            留言簿(5)

            隨筆分類

            隨筆檔案

            文章檔案

            Algorithm

            搜索

            •  

            最新評(píng)論

            閱讀排行榜

            評(píng)論排行榜

            国产99久久精品一区二区| 97久久久久人妻精品专区| 国产∨亚洲V天堂无码久久久| 久久精品久久久久观看99水蜜桃| 日产精品久久久久久久| 亚洲国产成人久久精品动漫| 久久人人爽人人精品视频 | 欧美喷潮久久久XXXXx| 久久精品综合一区二区三区| 男女久久久国产一区二区三区| 熟妇人妻久久中文字幕| 久久精品桃花综合| 国产成人久久久精品二区三区| 亚洲伊人久久大香线蕉综合图片| 久久夜色精品国产www| 日韩人妻无码一区二区三区久久 | 丰满少妇高潮惨叫久久久| 久久人人爽人人澡人人高潮AV | 久久国产成人精品麻豆| 伊人久久大香线蕉亚洲| 中文精品久久久久国产网址 | 国产A级毛片久久久精品毛片| 久久久青草久久久青草| 国产欧美一区二区久久| 97久久婷婷五月综合色d啪蜜芽| 99热都是精品久久久久久| 精品久久久无码人妻中文字幕豆芽| 青青热久久国产久精品| 无码国内精品久久人妻麻豆按摩| 国产日产久久高清欧美一区| 色综合久久综合中文综合网| 99久久这里只精品国产免费| 亚洲欧美国产日韩综合久久| 久久亚洲AV无码精品色午夜 | 狠色狠色狠狠色综合久久| 少妇久久久久久久久久| 亚洲国产精品久久久天堂| 伊人久久综合无码成人网| 久久久久久久精品成人热色戒| 思思久久99热只有频精品66| 久久午夜综合久久|