codeforces round #419 E. Karen and Supermarket
On the way home, Karen decided to stop by the supermarket to buy some groceries.
She needs to buy a lot of goods, but since she is a student her budget is still quite limited. In fact, she can only spend up to b dollars.
The supermarket sells n goods. The i-th good can be bought for ci dollars. Of course, each good can only be bought once.
Lately, the supermarket has been trying to increase its business. Karen, being a loyal customer, was given n coupons. If Karen purchases the i-th good, she can use the i-th coupon to decrease its price by di. Of course, a coupon cannot be used without buying the corresponding good.
There is, however, a constraint with the coupons. For all i ≥ 2, in order to use the i-th coupon, Karen must also use the xi-th coupon (which may mean using even more coupons to satisfy the requirement for that coupon).
Karen wants to know the following. What is the maximum number of goods she can buy, without exceeding her budget b?
The first line of input contains two integers n and b (1 ≤ n ≤ 5000, 1 ≤ b ≤ 109), the number of goods in the store and the amount of money Karen has, respectively.
The next n lines describe the items. Specifically:
- The i-th line among these starts with two integers, ci and di (1 ≤ di < ci ≤ 109), the price of the i-th good and the discount when using the coupon for the i-th good, respectively.
- If i ≥ 2, this is followed by another integer, xi (1 ≤ xi < i), denoting that the xi-th coupon must also be used before this coupon can be used.
Output a single integer on a line by itself, the number of different goods Karen can buy, without exceeding her budget.
6 16
10 9
10 5 1
12 2 1
20 18 3
10 2 3
2 1 5
4
5 10
3 1
3 1 1
3 1 2
3 1 3
3 1 4
5
In the first test case, Karen can purchase the following 4 items:
- Use the first coupon to buy the first item for 10 - 9 = 1 dollar.
- Use the third coupon to buy the third item for 12 - 2 = 10 dollars.
- Use the fourth coupon to buy the fourth item for 20 - 18 = 2 dollars.
- Buy the sixth item for 2 dollars.
The total cost of these goods is 15, which falls within her budget. Note, for example, that she cannot use the coupon on the sixth item, because then she should have also used the fifth coupon to buy the fifth item, which she did not do here.
In the second test case, Karen has enough money to use all the coupons and purchase everything.
题解:
树上背包哈,F[x][j][0/1]表示x子节点和本身中,选j个,当前节点是否打折(0/1)
方程式:
F[x][j+k][0]=min(F[x][j+k][0],F[u][k][0]+F[x][j][0])
F[x][j+k][1]=min(F[x][j+k][1],F[u][k][1]+F[x][j][1])
F[x][j+k][1]=min(F[x][j+k][1],F[u][k][0]+F[x][j][1])
复杂度O(n^2).
注意初始化和边界调节:
F[x][0][0]是要赋为0的,因为当前节点不打折时是可以不选的,而F[x][0][1]不能.
1 #include<iostream> 2 #include<cstdio> 3 #include<cstring> 4 #include<algorithm> 5 #include<cmath> 6 using namespace std; 7 typedef long long ll; 8 const int N=5002; 9 int n,m; 10 int head[N],num=0,w[N],h[N],now[N];ll F[N][N][2]; 11 struct Lin 12 { 13 int next,to; 14 } a[N<<1]; 15 void init(int x,int y) 16 { 17 a[++num].next=head[x]; 18 a[num].to=y; 19 head[x]=num; 20 } 21 void dfs(int x) 22 { 23 int u; 24 now[x]=1; 25 F[x][0][0]=0; 26 F[x][1][0]=w[x];F[x][1][1]=h[x]; 27 for(int i=head[x]; i; i=a[i].next) 28 { 29 u=a[i].to; 30 dfs(u); 31 for(int j=now[x];j>=0;j--) 32 { 33 for(int k=0; k<=now[u]; k++) 34 { 35 F[x][j+k][0]=min(F[x][j+k][0],F[u][k][0]+F[x][j][0]); 36 F[x][j+k][1]=min(F[x][j+k][1],F[u][k][1]+F[x][j][1]); 37 F[x][j+k][1]=min(F[x][j+k][1],F[u][k][0]+F[x][j][1]); 38 } 39 } 40 now[x]+=now[u];//now为当前节点的子节点个数. 41 } 42 } 43 int main() 44 { 45 scanf("%d%d",&n,&m); 46 int x,y,fa; 47 scanf("%d%d",&w[1],&h[1]); 48 h[1]=w[1]-h[1]; 49 memset(F,127/3,sizeof(F)); 50 for(int i=2; i<=n; i++) 51 { 52 scanf("%d%d%d",&x,&y,&fa); 53 w[i]=x; 54 h[i]=x-y; 55 init(fa,i); 56 } 57 dfs(1); 58 for(int i=n; i>=0; i--) 59 if(F[1][i][0]<=m || F[1][i][1]<=m) 60 { 61 printf("%d",i); 62 break; 63 } 64 return 0; 65 }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· Linux glibc自带哈希表的用例及性能测试
· 深入理解 Mybatis 分库分表执行原理
· 如何打造一个高并发系统?
· .NET Core GC压缩(compact_phase)底层原理浅谈
· 现代计算机视觉入门之:什么是图片特征编码
· 手把手教你在本地部署DeepSeek R1,搭建web-ui ,建议收藏!
· Spring AI + Ollama 实现 deepseek-r1 的API服务和调用
· 数据库服务器 SQL Server 版本升级公告
· 程序员常用高效实用工具推荐,办公效率提升利器!
· C#/.NET/.NET Core技术前沿周刊 | 第 23 期(2025年1.20-1.26)