牛客网暑期ACM多校训练营（第三场）A.PACM Team(多重01背包)

链接：https://www.nowcoder.com/acm/contest/141/A
来源：牛客网

题目描述

Eddy was a contestant participating in ACM ICPC contests. ACM is short for Algorithm, Coding, Math. Since in the ACM contest, the most important knowledge is about algorithm, followed by coding(implementation ability), then math. However, in the ACM ICPC World Finals 2018, Eddy failed to solve a physics equation, which pushed him away from a potential medal.

Since then on, Eddy found that physics is actually the most important thing in the contest. Thus, he wants to form a team to guide the following contestants to conquer the PACM contests(PACM is short for Physics, Algorithm, Coding, Math).

There are N candidate groups each composed of p_i physics experts, a_i algorithm experts, c_i coding experts, m_i math experts. For each group, Eddy can either invite all of them or none of them. If i-th team is invited, they will bring g_i knowledge points which is calculated by Eddy's magic formula. Eddy believes that the higher the total knowledge points is, the better a team could place in a contest. But, Eddy doesn't want too many experts in the same area in the invited groups. Thus, the number of invited physics experts should not exceed P, and A for algorithm experts, C for coding experts, M for math experts.

Eddy is still busy in studying Physics. You come to help him to figure out which groups should be invited such that they doesn't exceed the constraint and will bring the most knowledge points in total.

示例1

输出

1
1

示例2

输入

1
2 1 1 0 31
1 0 2 1

输出

0

题意按照我的理解就是相当于一个具有多个重量W的01背包。就是从一个W扩展到P,A,C,M四个属性。大概做法就是按照01背包的样式进行改写就可以了，因为范围很小只有36,所以时间复杂度就是个五层的循环，大概O(pow(36,5)) = 6000w左右，不会超时，这里要降一层数组，就是4层的一个dp数组就够了。也不会超内存.使用记录路径的方法，直到最后再还原回去把加入的物品记录下来最后再输出。也就是一个很裸的做法。

#include <bits/stdc++.h>using namespace std;const int m=40;struct node{int P,A,C,M,G;
}a[m];int A,B,C,D;
int N;
int dp[m][m][m][m];
bool path[m][m][m][m][m]={0};//用int超内存了int main()
{scanf("%d",&N);for(int i=0;i<N;i++){scanf("%d%d%d%d%d",&a[i].P,&a[i].A,&a[i].C,&a[i].M,&a[i].G);}scanf("%d%d%d%d",&A,&B,&C,&D);for(int i=0;i<N;i++){for(int j=A;j>=a[i].P;j--){for(int k=B;k>=a[i].A;k--){for(int l=C;l>=a[i].C;l--){for(int o=D;o>=a[i].M;o--){if(dp[j][k][l][o]<dp[j-a[i].P][k-a[i].A][l-a[i].C][o-a[i].M]+a[i].G){dp[j][k][l][o]=dp[j-a[i].P][k-a[i].A][l-a[i].C][o-a[i].M]+a[i].G;path[i][j][k][l][o] = 1;}}}}}}vector<int> ans;for(int i=N-1; i>=0 && A>=0 && B>=0 && C >=0 && D>=0 ;i--) {if(path[i][A][B][C][D]) {ans.push_back(i);A -= a[i].P,B -= a[i].A;C -= a[i].C,D -= a[i].M;}}int sz = ans.size();printf("%d\n",sz);for(int i=0;i<sz;i++) {printf(i==sz-1?"%d\n":"%d ",ans[i]);}return 0;
}

转载于:https://www.cnblogs.com/Fy1999/p/9384061.html

牛客网暑期ACM多校训练营（第三场）A.PACM Team(多重01背包)相关推荐

牛客网暑期ACM多校训练营(第三场): E. Sort String（KMP）
链接:https://www.nowcoder.com/acm/contest/141/E 来源:牛客网题目描述 Eddy likes to play with string which is a ...
牛客网暑期ACM多校训练营(第三场): C. Shuffle Cards（splay）
链接:https://www.nowcoder.com/acm/contest/141/C 来源:牛客网题目描述 Eddy likes to play cards game since there ...
牛客网暑期ACM多校训练营(第三场): A. Ternary String（欧拉降幂+递推）
题目描述 A ternary string is a sequence of digits, where each digit is either 0, 1, or 2. Chiaki has a t ...
牛客网暑期ACM多校训练营(第三场): C. Chiaki Sequence Reloaded（数位DP）
题目描述 Chiaki is interested in an infinite sequence a1, a2, a3, ..., which defined as follows: Chiaki ...
牛客网暑期ACM多校训练营（第九场）
牛客网暑期ACM多校训练营(第九场) A. Circulant Matrix 做法:看到下标 \(xor\) 这种情况就想 \(FWT\),可是半天没思路,于是放弃了..其实这个 \(n\) 疯狂暗示 ...
牛客网暑期ACM多校训练营（第一场）
牛客网暑期ACM多校训练营(第一场) A. Monotonic Matrix 考虑0和1的分界线,1和2的分界线,发现问题可以转化为两条不互相穿过的路径的方案数(可重叠),题解的做法就是把一条路径斜着 ...
牛客网暑期ACM多校训练营（第二场）: H. travel（树形线头DP）
链接:https://ac.nowcoder.com/acm/contest/140/H 来源:牛客网题目描述 White Cloud has a tree with n nodes.The roo ...
牛客网暑期ACM多校训练营（第二场）A .run
链接:https://www.nowcoder.com/acm/contest/140/A 来源:牛客网题目描述 White Cloud is exercising in the playgroun ...
牛客网暑期ACM多校训练营（第一场） J (莫队算法)
题目链接:https://www.nowcoder.com/acm/contest/139/J 题目大意:给一个序列,进行q次查询,问1~l和r~n中有多少个不同的数字题目思路:之前只是听说过莫队算 ...
牛客网暑期ACM多校训练营（第二场)J farm (二维树状数组）
题目链接: https://www.nowcoder.com/acm/contest/140/J 思路: 都写在代码注释里了,非常好懂.. for_each函数可以去看一下,遍历起vector数组比较 ...

牛客网暑期ACM多校训练营（第三场）A.PACM Team(多重01背包)

题目描述

牛客网暑期ACM多校训练营（第三场）A.PACM Team(多重01背包)相关推荐

最新文章

热门文章