NOJ 1116 哈罗哈的大披萨【淡蓝】 [状压dp+各种优化]

最新推荐文章于 2024-07-11 21:50:48 发布

weixin_34356555

最新推荐文章于 2024-07-11 21:50:48 发布

阅读量89

点赞数

文章标签：测试 java 数据结构与算法

原文链接：http://www.cnblogs.com/njczy2010/p/4127344.html

版权

我只能说，珍爱生命，远离卡常数的题。。。感谢陈老师和蔡神，没有他们，，，我调一个星期都弄不出来，，，，

哈罗哈的大披萨【淡蓝】

时间限制(普通/Java) : 1000 MS/ 3000 MS 运行内存限制 : 65536 KByte
总提交 : 73 测试通过 : 9

描述

输入

输出

样例输入

样例输出

题目来源

“IBM南邮杯”团队赛2009

题意不是很难，看到n=15我尝试了暴力、递归两种方法，T了之后乖乖地状压dp去了，用一个二进制数表示当前状态s，其中‘1’表示已经买过的pizza种类，然后依次去掉一个‘1’，得到s'，由s'可以转移得到s，dp[te]=mini(dp[te],dp[o]+p[k]*zhe[o][k] ); 其中p[k]代表第k种pizza的价格，zhe[o][k]代表的是第k种物品在状态s'时所能获得的所有折扣，dp[te]表示状态s时最小的总价格。。。。然后，，，，就是一路优化常数的悲催经历了，，，感谢陈老师和蔡神，没有他们，，，我调一个星期都弄不出来，，，，

优化：

1.预处理了每个状态s时，第i种pizza所能得到的总折扣率。

2.去掉了位运算

3.预处理了每个状态中0的位置，0的总数

4.优化了dp顺序

5.还有各种稀奇古怪的，，，反正刚好不T了，我也就没管了，，，

附上题解：（来自陈老师）

Since each pizza can be bought at most once, we could solve the problem by enumerating all subsets of pizzas. However the order of buying the pizzas does matter, since coupons cannot be used retrospectively, and it is too slow to try all permutations of how to buy the pizzas.

The important observation is: given the subset of pizzas already bought, we do not care anymore about the order in which this subset of pizzas was bought. Therefore, we can use dynamic programming to solve this problem. We represent the subset of pizzas already bought by a bitmask with n bits, where bit i is set to 1 if and only if pizza i was already bought. The recurrence relation can be formulated as follows: minimum_price(mask) = min_{mask = submask + 2ⁱ} minimum_price(submask) + price of pizza i where the price of pizza i is determined using discount coupons given for the pizzas bought before pizza i represented by the bitmask submask.

When calculating the minimum price for a subset of pizzas we only need to refer to bitmasks with a lower numeric value, therefore the recurrence relation can be calculated bottom up by enumerating all bitmasks with n bits from 0 to 2ⁿ-1. We need a table of size 2ⁿ, and each entry of the table can be calculated in O(n²) time, therefore the overall runtime is O(2ⁿ ⋅ n²).

Judges' test data consists of 37 test cases; most of them are random-generated.

ps:最后三个是我的代码，前面ac的都是蔡神的

5954	njczy2010	G	Accepted	12656 KB	921 ms	GCC	2612 B	2014-11-27 22:08:52
5953	njczy2010	G	Accepted	12656 KB	890 ms	G++	2823 B	2014-11-27 22:07:44
5951	njczy2010	G	Accepted	12656 KB	921 ms	GCC	2823 B	2014-11-27 22:05:53
5949	njczy2010	G	Time Limit Exceed at Test 1			GCC	3044 B	2014-11-27 21:55:45
5948	njczy2010	G	Time Limit Exceed at Test 1			GCC	3146 B	2014-11-27 21:53:51
5947	njczy2010	G	Time Limit Exceed at Test 1			GCC	3150 B	2014-11-27 21:47:58
5946	njczy2010	G	Time Limit Exceed at Test 1			GCC	2751 B	2014-11-27 21:13:15
5924	njczy2010	G	Accepted	9312 KB	750 ms	GCC	2223 B	2014-11-27 16:23:23
5918	njczy2010	G	Time Limit Exceed at Test 1			GCC	3162 B	2014-11-27 16:14:19
5917	njczy2010	G	Time Limit Exceed at Test 1			GCC	2967 B	2014-11-27 16:08:09
5916	njczy2010	G	Compile Error			GCC	2965 B	2014-11-27 16:07:51
5915	njczy2010	G	Time Limit Exceed at Test 1			GCC	2851 B	2014-11-27 16:05:25
5913	njczy2010	G	Time Limit Exceed at Test 1			GCC	2806 B	2014-11-27 16:03:56
5911	njczy2010	G	Accepted	9312 KB	859 ms	G++	2215 B	2014-11-27 15:53:04
5909	njczy2010	G	Time Limit Exceed at Test 1			G++	2996 B	2014-11-27 15:52:13
5908	njczy2010	G	Time Limit Exceed at Test 1			G++	2692 B	2014-11-27 15:26:46
5864	njczy2010	G	Time Limit Exceed at Test 1			G++	2482 B	2014-11-27 11:57:07
5863	njczy2010	G	Time Limit Exceed at Test 1			G++	2428 B	2014-11-27 11:55:09
5862	njczy2010	G	Time Limit Exceed at Test 1			G++	2416 B	2014-11-27 11:50:31
5861	njczy2010	G	Time Limit Exceed at Test 1			G++	2406 B	2014-11-27 11:44:55

这是水过去的代码：

  1 #include<stdio.h>
  2 
  3 //#include<pair>
  4 
  5 #define N 20
  6 #define M 1005
  7 #define mod 1000000007
  8 //#define p 10000007
  9 #define mod2 1000000000
 10 #define ll long long
 11 #define LL long long
 12 #define eps 1e-9
 13 #define maxi(a,b) (a)>(b)? (a) : (b)
 14 #define mini(a,b) (a)<(b)? (a) : (b)
 15 
 16 int m;
 17 int x[N][N];
 18 double p[N],a[N],n[N],y[N][N];
 19 double zhe[ 32768 ][N];
 20 double ans;
 21 double dp[ 32768 ];
 22 double tta[ 32768 ];
 23 int tot;
 24 double zhezhe[N][N];
 25 int pos[ 32768 ];
 26 int son[ 32768 ];
 27 int pos2[ 32768 ][ 17 ];
 28 int cnt2[ 32768 ];
 29 int son2[ 32768 ][ 17 ];
 30 int h[16];
 31 char ss[17];
 32 int bit[32768][16];
 33 
 34 void ini1()
 35 {
 36     int i,o,j,k,ch;
 37 
 38     h[0]=1;
 39     for(i=1;i<16;i++)
 40         h[i]=2*h[i-1];
 41     for(o=0;o<32768;o++){
 42         k=o;
 43         j=0;
 44         ch=1;
 45         while(k > 0){
 46             bit[i][j] = k%2;
 47             k = k/2;
 48             j++;
 49         }
 50         for(j=0;j<15;j++)
 51         {
 52             if(bit[i][j]==0)
 53             {
 54                 pos2[o][ cnt2[o] ]=j;
 55                 cnt2[o]++;
 56             }
 57             else
 58             {
 59                 if(ch==1)
 60                 {
 61                     ch=0;
 62                     pos[o]=j;
 63                     son[o]= o - h[j];
 64                 }
 65             }
 66         }
 67     }
 68 }
 69 
 70 void ini()
 71 {
 72     ans=1000000000;
 73     int i,j;
 74     int o;
 75     tot=h[m];
 76     for(i=1;i<=m;i++){
 77         for(j=1;j<=m;j++){
 78             zhezhe[i][j]=1.0;
 79         }
 80         scanf("%lf%lf%lf",&p[i],&a[i],&n[i]);
 81         for(j=1;j<=n[i];j++){
 82             scanf("%d%lf",&x[i][j],&y[i][j]);
 83             y[i][j]=(100.0-y[i][j])/100.0;
 84             zhezhe[i][ x[i][j] ]=y[i][j];
 85         }
 86     }
 87 
 88     for(o=0;o<tot;o++){
 89         dp[o]=1000000000;
 90 
 91     }
 92     for(j=1;j<=m;j++){
 93         zhe[0][j]=1.0;
 94     }
 95     tta[0]=0.0;
 96 }
 97 
 98 void solve()
 99 {
100     int o,k,kk,j;
101     int te;
102     dp[0]=0;
103     for(o=0;o<tot;o++){
104         if(o>=1){
105             j=pos[o]+1;
106             te=son[o];
107             tta[o]=tta[te]+a[j];
108 
109             for(kk=0;kk<cnt2[o];kk++){
110                 k=pos2[o][kk]+1;
111                 zhe[o][k]=zhe[te][k]*zhezhe[j][k];
112             }
113         }
114 
115         for(kk=0;kk<cnt2[o];kk++){
116             k=pos2[o][kk]+1;
117             te=o+h[k-1];
118             dp[te]=mini(dp[te],dp[o]+p[k]*zhe[o][k] );
119         }
120     }
121 }
122 
123 void out()
124 {
125     int o;
126     for(o=1;o<tot;o++){
127         //printf(" o=%d dp=%.4f\n",o,dp[o]);
128         ans=mini(ans,dp[o]/tta[o]);
129     }
130     printf("%.4f\n",ans);
131 }
132 
133 int main()
134 {
135     ini1();
136    // freopen("data.in","r",stdin);
137     //freopen("data.out","w",stdout);
138     while(scanf("%d",&m)!=EOF)
139     {
140         if( m==0 ) break;
141 
142         ini();
143         solve();
144         out();
145     }
146 
147     return 0;
148 }

RunID	User	Problem	Result	Memory	Time	Language	Length	Submit Time
5860	njczy2010	G	Accepted	9312 KB	734 ms	GCC	2215 B	2014-11-27 11:44:14
5859	njczy2010	G	Time Limit Exceed at Test 1			GCC	2215 B	2014-11-27 11:43:42
5858	njczy2010	G	Time Limit Exceed at Test 1			G++	2404 B	2014-11-27 11:36:29
5857	njczy2010	G	Time Limit Exceed at Test 1			G++	3036 B	2014-11-27 11:24:57
5856	njczy2010	G	Time Limit Exceed at Test 1			G++	3466 B	2014-11-27 11:13:39
5854	njczy2010	G	Time Limit Exceed at Test 1			G++	3413 B	2014-11-27 11:07:27
5849	njczy2010	G	Time Limit Exceed at Test 1			G++	3722 B	2014-11-27 10:23:56
5848	njczy2010	G	Compile Error			G++	3716 B	2014-11-27 10:23:19
5847	njczy2010	G	Time Limit Exceed at Test 1			G++	3330 B	2014-11-27 10:12:09
5846	njczy2010	G	Time Limit Exceed at Test 1			G++	3322 B	2014-11-27 10:09:51
5845	njczy2010	G	Time Limit Exceed at Test 1			G++	3323 B	2014-11-27 10:08:35
5844	njczy2010	G	Time Limit Exceed at Test 1			G++	3156 B	2014-11-27 10:05:04
5842	njczy2010	G	Time Limit Exceed at Test 1			GCC	2916 B	2014-11-26 23:30:18
5841	njczy2010	G	Time Limit Exceed at Test 1			G++	2986 B	2014-11-26 23:23:18
5840	njczy2010	G	Wrong Answer at Test 1			G++	2986 B	2014-11-26 23:22:42
5839	njczy2010	G	Wrong Answer at Test 1			G++	2984 B	2014-11-26 23:19:33
5838	njczy2010	G	Wrong Answer at Test 1			G++	2982 B	2014-11-26 23:18:46
5837	njczy2010	G	Time Limit Exceed at Test 1			G++	2981 B	2014-11-26 23:07:33
5836	njczy2010	G	Time Limit Exceed at Test 1			G++	2715 B	2014-11-26 22:58:10
5830	njczy2010	G	Time Limit Exceed at Test 1			G++	2167 B	2014-11-26 22:28:24

转载于:https://www.cnblogs.com/njczy2010/p/4127344.html

weixin_34356555

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
NOJ 1116 哈罗哈的大披萨【淡蓝】 [状压dp+各种优化]

我只能说，珍爱生命，远离卡常数的题。。。感谢陈老师和蔡神，没有他们，，，我调一个星期都弄不出来，，，，哈罗哈的大披萨【淡蓝】时间限制(普通/Java) : 1000 MS/ 3000 MS 运行内存限制 : 65536 KByte总提交 : 73 测试通过 : 9描述热风哈罗哈（三牌楼）店正在搞活动：他们将提供一个大披萨给第...
复制链接

扫一扫